Paper 2020/274
An Optimal Relational Database Encryption Scheme
Seny Kamara, Tarik Moataz, Stan Zdonik, and Zheguang Zhao
Abstract
Recently, Kamara and Moataz described the first encrypted relational database solution with support for a non-trivial fraction of SQL that does not make use of property-preserving encryption (Asiacrypt, 2018). More precisely, their construction, called SPX, handles the set of conjunctive SQL queries. While SPX was shown to be optimal for the subset of uncorrelated conjunctive SQL queries, it did not handle correlated queries optimally. Furthermore, it only handles queries in heuristic normal form. In this work, we address these limitations by proposing an extension of SPX that handles all conjunctive SQL queries optimally no matter what form they are in.
Note: Updated keywords.
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint.
- Keywords
- structured encryptionencrypted searchSQLencrypted databases
- Contact author(s)
-
seny @ brown edu
tarik @ aroki com
sbz @ cs brown edu
zheguang zhao @ brown edu - History
- 2020-03-04: revised
- 2020-03-04: received
- See all versions
- Short URL
- https://ia.cr/2020/274
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/274,
author = {Seny Kamara and Tarik Moataz and Stan Zdonik and Zheguang Zhao},
title = {An Optimal Relational Database Encryption Scheme},
howpublished = {Cryptology {ePrint} Archive, Paper 2020/274},
year = {2020},
url = {https://eprint.iacr.org/2020/274}
}
