How to Make a Secure Index for Searchable Symmetric Encryption, Revisited-Reference-Cited by-同舟云学术

How to Make a Secure Index for Searchable Symmetric Encryption, Revisited

Published:2022-12-01 Issue:12 Volume:E105.A Page:1559-1577
ISSN:0916-8508
Container-title:IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
language:en
Short-container-title:IEICE Trans. Fundamentals

Author:

WATANABE Yohei¹,NAKAI Takeshi¹,OHARA Kazuma²,NOJIMA Takuya¹,LIU Yexuan³,IWAMOTO Mitsugu¹,OHTA Kazuo²

Affiliation:

1. University of Electro-Communications (UEC)

2. National Institute of Advanced Industrial Science and Technology (AIST)

3. Yokohama National University (YNU)

Publisher

Institute of Electronics, Information and Communications Engineers (IEICE)

Subject

Applied Mathematics,Electrical and Electronic Engineering,Computer Graphics and Computer-Aided Design,Signal Processing

Link

https://www.jstage.jst.go.jp/article/transfun/E105.A/12/E105.A_2021EAP1163/_pdf

Reference34 articles.

1. [1] D.X. Song, D. Wagner, and A. Perrig, “Practical techniques for searches on encrypted data,” IEEE Symposium on Security and Privacy, S&P 2000, pp.44-55, 2000. 10.1109/secpri.2000.848445

2. [2] R. Curtmola, J. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” ACM SIGSAC Conference on Computer and Communications Security, CCS 2006, New York, NY, USA, pp.79-88, ACM, 2006. 10.1145/1180405.1180417

3. [3] R. Curtmola, J.A. Garay, S. Kamara, and R. Ostrovsky, “Searchable symmetric encryption: Improved definitions and efficient constructions,” Journal of Computer Security, vol.19, no.5, pp.895-934, 2011. 10.3233/jcs-2011-0426

4. [4] G. Asharov, G. Segev, and I. Shahaf, “Tight tradeoffs in searchable symmetric encryption,” Advances in Cryptology-CRYPTO 2018, H. Shacham and A. Boldyreva, eds., pp.407-436, Springer International Publishing, Cham, 2018. 10.1007/978-3-319-96884-1_14

5. [5] G. Asharov, M. Naor, G. Segev, and I. Shahaf, “Searchable symmetric encryption: Optimal locality in linear space via two-dimensional balanced allocations,” ACM Symposium on Theory of Computing, STOC 2016, New York, NY, USA, pp.1101-1114, ACM, 2016. 10.1145/2897518.2897562

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Security Technologies to Improve Content-Distribution and Broadcasting Services;IEICE ESS Fundamentals Review;2023-10-01