Abstract
After acquiring adequate background knowledge, we are now about to advance to the world of searchable encryption, which has made prosperous progress since its first construction in the early 2000s. Since mainstream designs in searchable encryption focus on symmetric key-based primitives, we will focus on them in this chapter and only briefly discuss other designs when necessary.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bloom BH (1970) Space/time trade-offs in hash coding with allowable errors. Communications of the ACM 13(7):422–426
Boneh D, Crescenzo GD, Ostrovsky R, Persiano G (2004) Public key encryption with keyword search. In: Advances in Cryptology—EUROCRYPT 2004, International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, May 2–6, 2004, Proceedings, Springer, Lecture Notes in Computer Science, vol 3027, pp 506–522
Chang F, Dean J, Ghemawat S, Hsieh WC, Wallach DA, Burrows M, Chandra T, Fikes A, Gruber R (2006) Bigtable: A distributed storage system for structured data (awarded best paper!). In: 7th Symposium on Operating Systems Design and Implementation (OSDI ’06), November 6–8, Seattle, WA, USA, USENIX Association, pp 205–218
Chase M, Kamara S (2010) Structured encryption and controlled disclosure. In: Advances in Cryptology—ASIACRYPT 2010—16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, December 5–9, 2010. Proceedings, Springer, Lecture Notes in Computer Science, vol 6477, pp 577–594
Curtmola R, Garay JA, Kamara S, Ostrovsky R (2006) Searchable symmetric encryption: improved definitions and efficient constructions. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS 2006, Alexandria, VA, USA, October 30–November 3, 2006, ACM, pp 79–88
Goh EJ (2003) Secure indexes. IACR Cryptology ePrint Archive p 216
Islam MS, Kuzu M, Kantarcioglu M (2012) Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: 19th Annual Network and Distributed System Security Symposium, NDSS 2012, San Diego, California, USA, February 5–8, 2012, The Internet Society
Kamara S, Moataz T (2019) Computationally volume-hiding structured encryption. In: Advances in Cryptology—EUROCRYPT 2019—38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Darmstadt, Germany, May 19–23, 2019, Proceedings, Part II, Springer, Lecture Notes in Computer Science, vol 11477, pp 183–213
Kamara S, Moataz T, Ohrimenko O (2018) Structured encryption and leakage suppression. In: Advances in Cryptology—CRYPTO 2018—38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19–23, 2018, Proceedings, Part I, Springer, Lecture Notes in Computer Science, vol 10991, pp 339–370
Li R, Liu AX (2017) Adaptively secure conjunctive query processing over encrypted data for cloud computing. In: 33rd IEEE International Conference on Data Engineering, ICDE 2017, San Diego, CA, USA, April 19–22, 2017, IEEE Computer Society, pp 697–708
Lindell Y (2016) How to simulate it—A tutorial on the simulation proof technique. IACR Cryptology ePrint Archive p 46
Nowak D, Zhang Y (2010) A calculus for game-based security proofs. In: Provable Security—4th International Conference, ProvSec 2010, Malacca, Malaysia, October 13-15, 2010. Proceedings, Springer, Lecture Notes in Computer Science, vol 6402, pp 35–52
Patel S, Persiano G, Yeo K, Yung M (2019) Mitigating leakage in secure cloud-hosted data structures: Volume-hiding for multi-maps via hashing. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, CCS 2019, London, UK, November 11–15, 2019, ACM, pp 79–93
Song DX, Wagner DA, Perrig A (2000) Practical techniques for searches on encrypted data. In: 2000 IEEE Symposium on Security and Privacy, Berkeley, California, USA, May 14–17, 2000, IEEE Computer Society, pp 44–55
Wang J, Chow SSM (2022) Omnes pro uno: Practical Multi-Writer encrypted database. In: 31st USENIX Security Symposium (USENIX Security 22), USENIX Association, Boston, MA, pp 2371–2388
Xu P, Wu Q, Wang W, Susilo W, Domingo-Ferrer J, Jin H (2015) Generating searchable public-key ciphertexts with hidden structures for fast keyword search. IEEE Transactions on Information Forensics and Security 10(9):1993–2006
Zeng M, Qian H, Chen J, Zhang K (2022) Forward secure public key encryption with keyword search for outsourced cloud storage. IEEE Transactions on Cloud Computing 10(1):426–438
Zhao Y, Wang H, Lam K (2021) Volume-hiding dynamic searchable symmetric encryption with forward and backward privacy. IACR Cryptology ePrint Archive p 786
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Ren, K., Wang, C. (2023). Searchable Encryption Semantics. In: Searchable Encryption. Wireless Networks. Springer, Cham. https://doi.org/10.1007/978-3-031-21377-9_3
Download citation
DOI: https://doi.org/10.1007/978-3-031-21377-9_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21376-2
Online ISBN: 978-3-031-21377-9
eBook Packages: Computer ScienceComputer Science (R0)