Using Bitmaps for Executing Range Queries in Encrypted Databases

Lil María Rodríguez-Henríquez, Debrup Chakraborty

Abstract

Privacy of data stored at un-trusted servers is an important problem of today. A solution to this problem can be achieved by encrypting the outsourced data, but simple encryption does not allow efficient query processing. In this paper we propose a novel scheme for encrypting relational databases so that range queries can be efficiently executed on the encrypted data. We formally define the syntax and security of the problem and specify a scheme called ESRQ1. ESRQ1 uses a deterministic encryption scheme along with bitmap indices to encrypt a relational database. We provide details of the functionality of ESRQ1 and prove its security in the specified model.

References

  1. Agrawal, R., Kiernan, J., Srikant, R., and Xu, Y. (2004). Order-preserving encryption for numeric data. In Weikum, G., König, A. C., and Deßloch, S., editors, SIGMOD Conference, pages 563-574. ACM.
  2. Boldyreva, A., Chenette, N., Lee, Y., and O'Neill, A. (2009). Order-preserving symmetric encryption. In Joux, A., editor, EUROCRYPT, volume 5479 of Lecture Notes in Computer Science, pages 224-241. Springer.
  3. Boldyreva, A., Chenette, N., and O'Neill, A. (2011). Orderpreserving encryption revisited: Improved security analysis and alternative solutions. In Rogaway, P., editor, CRYPTO, volume 6841 of Lecture Notes in Computer Science, pages 578-595. Springer.
  4. Lee, S., Park, T.-J., Lee, D., Nam, T., and Kim, S. (2009). Chaotic order preserving encryption for efficient and secure queries on databases. IEICE Transactions, 92- D(11):2207-2217.
  5. Popa, R. A., Li, F. H., and Zeldovich, N. (2013). An idealsecurity protocol for order-preserving encoding. In IEEE Symposium on Security and Privacy, pages 463- 477. IEEE Computer Society.
  6. Popa, R. A., Redfield, C. M. S., Zeldovich, N., and Balakrishnan, H. (2011). Cryptdb: protecting confidentiality with encrypted query processing. In SOSP, pages 85- 100.
  7. Yum, D., Kim, D., Kim, J., Lee, P., and Hong, S. (2012). Order-preserving encryption for non-uniformly distributed plaintexts. In Jung, S. and Yung, M., editors, Information Security Applications, volume 7115 of Lecture Notes in Computer Science, pages 84-97. Springer Berlin Heidelberg.
Download


Paper Citation


in Harvard Style

María Rodríguez-Henríquez L. and Chakraborty D. (2014). Using Bitmaps for Executing Range Queries in Encrypted Databases . In Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014) ISBN 978-989-758-045-1, pages 432-438. DOI: 10.5220/0005111604320438


in Bibtex Style

@conference{secrypt14,
author={Lil María Rodríguez-Henríquez and Debrup Chakraborty},
title={Using Bitmaps for Executing Range Queries in Encrypted Databases},
booktitle={Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)},
year={2014},
pages={432-438},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005111604320438},
isbn={978-989-758-045-1},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 11th International Conference on Security and Cryptography - Volume 1: SECRYPT, (ICETE 2014)
TI - Using Bitmaps for Executing Range Queries in Encrypted Databases
SN - 978-989-758-045-1
AU - María Rodríguez-Henríquez L.
AU - Chakraborty D.
PY - 2014
SP - 432
EP - 438
DO - 10.5220/0005111604320438