Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency

Demertzis, Ioannis; Papadopoulos, Dimitrios; Papamanthou, Charalampos

doi:10.1007/978-3-319-96884-1_13

Cited by 50 publications

(53 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Asharov et al [6] proposed the first schemes with optimal locality and space, and poly-logarithmic read efficiency and soon after, Demertzis and Papamanthou [21] published a tunable SE scheme that achieves various tradeoffs between read efficiency, locality and space requirements outperforming in practice the locality optimal schemes of Asharov et al for similar space requirements. Along this line, Demertzis et al [18] proposed a new theoretical construction which strictly improves the schemes of Asharov et al [6], thus providing the first SE with optimal locality, linear space and sub-logarithmic read efficiency.…”

Section: Prior Workmentioning

confidence: 99%

“…In particular, the adversary can pick the initial memory and any two polynomial size sequences of accesses y1 and y2 of the same length (|y1| = |y2|) and by observing the oblivious accesses of o(y1) and o(y2) she will not able to distinguish them, with non-negligible probability. We refer the reader to [18] for the formal correctness and security definitions of ORAM.…”

Section: Oblivious Ram (Oram)mentioning

confidence: 99%

“…It is worth noting that previous SE schemes with constant locality (ones that require few random accesses to retrieve the result) (e.g., [6,21,18]) have partially addressed this problem by reducing the number of cryptographic operations required by the server and not the total number of cryptographic operations. In this paper we take a more aggressive approach and aim at reducing the total number of cryptographic operations required by the protocol.…”

Section: Introductionmentioning

confidence: 99%

“…While combining compression and encryption can create security problems [33], we leverage the already existing leakage of searchable encryption to overcome this. We formally prove that our scheme can use any secure SE scheme as black-box (including the recent locality-aware SE schemes [6,21,18]), and any set of lossless compression algorithms improving the search efficiency of the used black-box by orders of magnitude without affecting its security.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Efficient searchable encryption through compression

2018

Self Cite

View full text Add to dashboard Cite

In this work we design new searchable encryption schemes whose goal is to minimize the number of cryptographic operations required to retrieve the result-a dimension mostly overlooked by previous works, yet very important in practice. Our main idea is to utilize compression so as to reduce the size of the plaintext indexes before producing the encrypted searchable indices. Our solution can use any existing Searchable Encryption (SE) scheme as a black-box and any combination of lossless compression algorithms, without compromising security.The efficiency of our schemes varies based on the leakage exposed by the underlying application. For instance, for private keyword search (more leakage), we demonstrate up to 188× savings in search time, while for database search (less leakage) our savings are up to 62×.The power of our approach is better manifested when combined with more secure, yet less practical, cryptographic tools, such as Oblivious Random Access Memory (ORAM). In particular while ORAM is known to be prohibitively expensive for large-scale applications, we show that our compressfirst-ORAM-next approach allows significant more efficient index search time, reducing the time for executing a query with result of size more than one million tuples from approximately 21 hours to 20 minutes.

show abstract

Section: Prior Workmentioning

confidence: 99%

Section: Oblivious Ram (Oram)mentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Efficient searchable encryption through compression

2018

Self Cite

View full text Add to dashboard Cite

show abstract

“…It allows a client to store encrypted documents on an untrusted server, then to retrieve all documents containing a certain keyword by submitting a token that cryptographically encodes the keyword. Now, SSE has been widely used in encrypted databases [1][2][3][4][5][6][7] and encrypted emails [8]. Take the CryptDB [4] as an example, besides supporting SQL LIKE operator by using an SSE scheme [11] directly, it uses SSE to implement SQL equality queries (=, !=, IN, NOT IN, etc) when the values in the column are not unique.…”

Section: Introductionmentioning

confidence: 99%

Searchable Symmetric Encryption with Forward Search Privacy

Huang

et al. 2021

IEEE Trans. Dependable and Secure Comput.

149

View full text Add to dashboard Cite

Searchable symmetric encryption (SSE) has been widely applied in the encrypted database for queries in practice. Although SSE is powerful and feature-rich, it is always plagued by information leaks. Some recent attacks point out that forward privacy which disallows leakage from update operations, now becomes a basic requirement for any newly designed SSE schemes. However, the subsequent search operations can still leak a significant amount of information. To further strengthen security, we extend the definition of forward privacy and propose the notion of "forward search privacy". Intuitively, it requires search operations over newly added documents do not leak any information about past queries. The enhanced security notion poses new challenges to the design of SSE. We address the challenges by developing the hidden pointer technique (HPT) and propose a new SSE scheme called Khons, which satisfies our security notion (with the original forward privacy notion) and is also efficient. We implemented Khons and our experiment results on large dataset (wikipedia) show that it is more efficient than existing SSE schemes with forward privacy.

show abstract

A rORAM scheme with logarithmic bandwidth and logarithmic locality

Gong

Gao

et al. 2022

Int J of Intelligent Sys

View full text Add to dashboard Cite

Oblivious Random Access Machine (ORAM) is a kind of cryptographic primitive that allows a client to access its private data from the server without disclosing the access pattern. To deal with consecutive requested blocks at a time efficiently, range ORAM (rORAM) is presented. In the previous rORAM scheme, the locality, namely, the number of discontinuous seeks to complete a request, is reduced to O(log 2 N), nevertheless, the bandwidth cost is increased to the polylogarithmic level. Hence, there exists an open question, that is, whether rORAM can be constructed with the same bandwidth efficiency as a regular ORAM, that is, O(log N)-block? In this paper, we propose a new rORAM scheme, called L 2 -rORAM. In our scheme, a compatible superblock technique is proposed, and it is combined together with an eviction technique for range blocks, so that it avoids duplication of multiple copies and extra dummy access. As a result, it obtains O(log N)-block bandwidth cost, which affirmatively answers the above open question. Meanwhile, the data locality is reduced to O(log N). In addition, the client storage is maintained at the small level of O(log N)block, and the server storage is maintained at the unexpanded level of O(N)-block. Finally, experimental results show that the average response time of our

show abstract

Searchable Encryption with Optimal Locality: Achieving Sublogarithmic Read Efficiency

Cited by 50 publications

References 26 publications

Efficient searchable encryption through compression

Efficient searchable encryption through compression

Searchable Symmetric Encryption with Forward Search Privacy

A rORAM scheme with logarithmic bandwidth and logarithmic locality

Contact Info

Product

Resources

About