Practical Attacks on Relational Databases Protected via Searchable Encryption

DOI10.1007/978-3-319-99136-8_10MaRDI QIDQ6108839zbMATH OpenOpenAlexFDO

Authors Mohamed Ahmed Abdelraheem, Tobias Andersson, Christian Gehrmann, Cornelius Glackin

Publication date 30 June 2023

Published in Developments in Language Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-99136-8_10

Mathematics Subject Classification ID

Database theory (68P15) Data encryption (aspects in computer science) (68P25) Privacy of data (68P27)

Recommendations

• Searchable symmetric encryption security definitions
• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• ObliviousDB: Practical and Efficient Searchable Encryption with Controllable Leakage
• Private large-scale databases with distributed searchable symmetric encryption
• Secure and practical searchable encryption: a position paper

Cites work

• Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
• Lower bounds for linear degeneracy testing
• Order-preserving encryption revisited: improved security analysis and alternative solutions
• Structured encryption and controlled disclosure

Cited in

(1)

• scientific article; zbMATH DE number 5284246 (Why is no real title available?)

This page was built for publication: Practical Attacks on Relational Databases Protected via Searchable Encryption

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