Efficient searchable symmetric encryption for join queries

DOI10.1007/978-3-031-22969-5_11MaRDI QIDQ6135437zbMATH OpenOpenAlexFDO

Authors C. S. Jutla, Sikhar Patranabis

Publication date 25 August 2023

Published in Advances in Cryptology – ASIACRYPT 2022 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-031-22969-5_11

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Database theory (68P15)

Recommendations

• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Boolean searchable symmetric encryption with worst-case sub-linear complexity
• Private large-scale databases with distributed searchable symmetric encryption
• Strengthening the security of encrypted databases: non-transitive JOINs
• Ranked Searchable Symmetric Encryption Supporting Conjunctive Queries

Cites work

• Boolean searchable symmetric encryption with worst-case sub-linear complexity
• Computationally volume-hiding structured encryption
• Fully homomorphic encryption using ideal lattices
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Improved structured encryption for SQL databases via hybrid indexing
• SQL on structurally-encrypted databases
• Software protection and simulation on oblivious RAMs
• Structured encryption and controlled disclosure

Cited in

(1)

• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries

This page was built for publication: Efficient searchable symmetric encryption for join queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6135437)