Searchable symmetric encryption

Keyword search using an SSE scheme

Searchable symmetric encryption (SSE) is a form of encryption that allows one to efficiently search over a collection of encrypted documents or files without the ability to decrypt them.[1][2][3] SSE can be used to outsource files to an untrusted cloud storage server without ever revealing the files in the clear but while preserving the server's ability to search over them.

  1. ^ Dawn Xiaoding Song; Wagner, D.; Perrig, A. (2000). "Practical techniques for searches on encrypted data". Proceeding 2000 IEEE Symposium on Security and Privacy. S&P 2000. IEEE Comput. Soc. pp. 44–55. doi:10.1109/secpri.2000.848445. ISBN 0-7695-0665-8. S2CID 2829840.
  2. ^ Curtmola, Reza; Garay, Juan; Kamara, Seny; Ostrovsky, Rafail (2006-10-30). "Searchable symmetric encryption". Proceedings of the 13th ACM conference on Computer and communications security. CCS '06. Alexandria, Virginia, USA: Association for Computing Machinery. pp. 79–88. doi:10.1145/1180405.1180417. ISBN 978-1-59593-518-2. S2CID 961719.
  3. ^ Amorim, Ivone; Costa, Ivan (2023-07-01). "Leveraging Searchable Encryption through Homomorphic Encryption: A Comprehensive Analysis". Mathematics. 11 (13): 2948. arXiv:2306.14407. doi:10.3390/math11132948. ISSN 2227-7390.