SSE and SSD: Page-Efficient Searchable Symmetric Encryption
SSE and SSD: Page-Efficient Searchable Symmetric Encryption
复制标题
SSE 和 SSD：页面高效可搜索对称加密
DOI：
--
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Michael Reichle
中科院分区：
文献类型：
--
作者：
Angèle Bossuat;Raphael Bost;Pierre;Brice Minaud;Michael Reichle
可搜索的对称加密（SSE）使客户能够将数据库外包到不信任的服务器，同时保留了安全搜索数据的能力。记忆访问的成本。在许多旨在改善本地的SSE方案中，在传统的存储媒体中进行访问。工作是，对于越来越多的固态驱动器（SSD）等较新的存储媒体来说，越来越普遍的是，当地性能不是实践性能的良好预测指标主要取决于页面的效率，即，我们定义了这一概念，并确定一个简单的内存分配问题，与数据无关的包装（DIP），捕获了构建Page-e-forcient SSE所需的主要技术挑战作为我们的主要结果，我们构建了一个有效的数据独立的包装方案，并推断出Tethys SSE方案，这是第一个SSE方案（1）效率和o（1）储存效率。
Searchable Symmetric Encryption (SSE) enables a client to outsource a database to an untrusted server, while retaining the ability to securely search the data. The performance bottleneck of classic SSE schemes typically does not come from their fast, symmetric cryptographic operations, but rather from the cost of memory accesses. To address this issue, many works in the literature have considered the notion of locality, a simple design criterion that helps capture the cost of memory accesses in traditional storage media, such as Hard Disk Drives. A common thread among many SSE schemes aiming to improve locality is that they are built on top of new memory allocation schemes, which form the technical core of the constructions. The starting observation of this work is that for newer storage media such as Solid State Drives (SSDs), which have become increasingly common, locality is not a good predictor of practical performance. Instead, SSD performance mainly depends on page efficiency , that is, reading as few pages as possible. We define this notion, and identify a simple memory allocation problem, Data-Independent Packing (DIP), that captures the main technical challenge required to build page-efficient SSE. As our main result, we build a page-efficient and storage-efficient data-independent packing scheme, and deduce the Tethys SSE scheme, the first SSE scheme to achieve at once O (1) page efficiency and O (1) storage efficiency. The technical core of the result is a new generalization of cuckoo hashing to items of variable size. Practical experiments show that this new approach achieves excellent performance.
影响因子：
1.1
作者：
Martin Aumüller;Martin Dietzfelbinger;Philipp Woelfel
通讯作者：
Martin Aumüller;Martin Dietzfelbinger;Philipp Woelfel