Simple Storage-Saving Structure For Volume-Hiding Encrypted Multi-Maps (A Slot In Need Is A Slot Indeed)

DATA AND APPLICATIONS SECURITY AND PRIVACY XXXV(2021)

引用 4|浏览17
暂无评分
摘要
Severe consequences in volume leakage (subject to the conditions required by specific attacks) stimulate a new research direction (Eurocrypt 2019) of volume-hiding structured encryption (STE), particularly encrypted multi-maps (EMM), in which all queries should share the same (as the largest) response size unless the scheme is lossy. Meanwhile, note that the responses are originated from the actual ciphertexts outsourced to the server. Conventional wisdom suggests that the ciphertexts (to be accessed by the server while answering a query) should also contain many dummy results to make a query look uniform with others. Supporting updates is also natural; however, attaching dummy results to a query also complicates the operation and leakage of updates, which excludes many advanced data structures, e.g., cuckoo hashing (CCS 2019). This paper proposes a space-efficient EMM without storing any dummy ciphertext, which is volume hiding against passive adversaries (SP 2021) and compatible with dynamic extensions. Its crux structure is a hash ring, which is famous for load balancing but rarely appears in any STE. Efficiency-wise, our scheme beats the state-of-the-art (Eurocrypt 2019, CCS 2019), maintaining the necessary communication overhead and downsizing the server storage to be linear in the number of values in the EMM, while ruling out any data loss due to truncations or differential privacy.
更多
查看译文
关键词
Volume hiding, Encrypted multi-maps, Consistent hashing, Structured encryption, Dynamic symmetric searchable encryption
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要