research-article

Optimal Average-Complexity Ideal-Security Order-Preserving Encryption

Authors:

Florian Kerschbaum,

Axel SchroepferAuthors Info & Claims

CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security

Pages 275 - 286

https://doi.org/10.1145/2660267.2660277

Published: 03 November 2014 Publication History

Abstract

Order-preserving encryption enables performing many classes of queries -- including range queries -- on encrypted databases. Popa et al. recently presented an ideal-secure order-preserving encryption (or encoding) scheme, but their cost of insertions (encryption) is very high. In this paper we present an also ideal-secure, but significantly more efficient order-preserving encryption scheme. Our scheme is inspired by Reed's referenced work on the average height of random binary search trees. We show that our scheme improves the average communication complexity from O(n log n) to O(n) under uniform distribution. Our scheme also integrates efficiently with adjustable encryption as used in CryptDB. In our experiments for database inserts we achieve a performance increase of up to 81% in LANs and 95% in WANs.

References

[1]

http://www.ciphercloud.com/.

[2]

http://www.vaultive.com/.

[3]

https://www.cs.cmu.edu/~enron/enron_mail_20110402.tgz.

[4]

D. Abadi, S. Madden, and M. Ferreira. Integrating compression and execution in column-oriented database systems. In Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2006.

Digital Library

[5]

D. Agrawal, A. El Abbadi, F. Emekçi, and A. Metwally. Database management as a service: challenges and opportunities. In Proceedings of the 25th International Conference on Data Engineering, ICDE, 2009.

Digital Library

[6]

R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Order preserving encryption for numeric data. In Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2004.

Digital Library

[7]

C. Binnig, S. Hildenbrand, and F. Farber. Dictionary-based order-preserving string compression for main memory column stores. In Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2009.

Digital Library

[8]

A. Boldyreva, N. Chenette, Y. Lee, and A. O'Neill. Order-preserving symmetric encryption. In Proceedings of the 28th International Conference on Advances in Cryptology, EUROCRYPT, 2009.

Digital Library

[9]

A. Boldyreva, N. Chenette, and A. O'Neill. Order-preserving encryption revisited: improved security analysis and alternative solutions. In Proceedings of the 31st International Conference on Advances in Cryptology, CRYPTO, 2011.

Digital Library

[10]

D. Boneh and B. Waters. Conjunctive, subset, and range queries on encrypted data. In Proceedings of the 4th Theory of Cryptography Conference, TCC, 2007.

Digital Library

[11]

D. Cash, S. Jarecki, C. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner. Highly-scalable searchable symmetric encryption with support for boolean queries. In Proceedings of the 33rd International Conference on Advances in Cryptology, CRYPTO, 2013.

[12]

F. Farber, N. May, W. Lehner, P. Große, I. Müller, H. Rauhe, and J. Dees. The SAP HANA database -- an architecture overview. IEEE Data Engineering Bulletin, 35(1):28--33, 2012.

[13]

C. Gentry. Fully homomorphic encryption using ideal lattices. In Proceedings of the Symposium on Theory of Computing, STOC, 2009.

Digital Library

[14]

S. Goldwasser, Y. T. Kalai, R. A. Popa, V. Vaikuntanathan, and N. Zeldovich. Reusable garbled circuits and succinct functional encryption. In Proceedings of the Symposium on Theory of Computing, STOC, 2013.

Digital Library

[15]

H. Hacigümüs, B. R. Iyer, C. Li, and S. Mehrotra. Executing sql over encrypted data in the database-service-provider model. In Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2002.

Digital Library

[16]

H. Hacigümüs, S. Mehrotra, and B. R. Iyer. Providing database as a service. In Proceedings of the 18th International Conference on Data Engineering, ICDE, 2002.

Digital Library

[17]

S. Hildenbrand, D. Kossmann, T. Sanamrad, C. Binnig, F. F\"arber, and J. Wöhler. Query processing on encrypted data in the cloud. Technical Report 735, Department of Computer Science, ETH Zurich, 2011.

[18]

M. Islam, M. Kuzu, and M. Kantarcioglu. Access pattern disclosure on searchable encryption: ramification, attack and mitigation. In Proceedings of the 19th Network and Distributed System Security Symposium, NDSS, 2012.

[19]

H. Kadhem, T. Amagasa, and H. Kitagawa. Mv-opes: multivalued-order preserving encryption scheme: a novel scheme for encrypting integer value to many different values. IEICE Transactions on Information and Systems, E93.D:2520--2533, 2010.

[20]

H. Kadhem, T. Amagasa, and H. Kitagawa. A secure and efficient order preserving encryption scheme for relational databases. In Proceedings of the International Conference on Knowledge Management and Information Sharing, KMIS, 2010.

[21]

J. Katz, A. Sahai, and B. Waters. Predicate encryption supporting disjunctions, polynomial equations, and inner products. In Advances in Cryptology, EUROCRYPT, 2008.

Digital Library

[22]

B. Klimt and Y. Yang. The enron corpus: a new dataset for email classification research. In Proceedings of the 15th European Conference on Machine Learning, ECML, 2004.

Digital Library

[23]

S. Lee, T.-J. Park, D. Lee, T. Nam, and S. Kim. Chaotic order preserving encryption for efficient and secure queries on databases. IEICE Transactions on Information and Systems, E92.D:2207--2217, 2009.

[24]

C. Liu, L. Zhu, M. Wang, and Y.-a. Tan. Search pattern leakage in searchable encryption: attacks and new constructions. Technical Report 163, IACR Cryptology ePrint Archive, 2013.

[25]

D. Liu and S. Wang. Programmable order-preserving secure index for encrypted database query. In Proceedings of the 5th International Conference on Cloud Computing, CLOUD, 2012.

Digital Library

[26]

D. Liu and S. Wang. Nonlinear order preserving index for encrypted database query in service cloud environments. Concurrency and Computation: Practice and Experience, 25(13):1967--1984, 2013.

[27]

Y. Lu. Privacy-preserving logarithmic-time search on encrypted data in cloud. In Proceedings of the 19th Network and Distributed System Security Symposium, NDSS, 2012.

[28]

G. Özsoyoglu, D. A. Singer, and S. S. Chung. Anti-tamper databases: querying encrypted databases. In Proceedings of the 17th Conference on Data and Application Security, DBSEC, 2003.

[29]

P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of the 18th International Conference on Advances in Cryptology, EUROCRYPT, 1999.

Digital Library

[30]

H. Plattner. A common database approach for oltp and olap using an in-memory column database. In Proceedings of the ACM International Conference on Management of Data, SIGMOD, 2009.

Digital Library

[31]

S. C. Pohlig and M. E. Hellman. An improved algorithm for computing logarithms over gf(p) and its cryptographic significance. IEEE Transactions on Information Theory, 24(1):106--110, 1978.

Digital Library

[32]

R. A. Popa, F. H. Li, and N. Zeldovich. An ideal-security protocol for order-preserving encoding. In 34th IEEE Symposium on Security and Privacy, S&P, 2013.

Digital Library

[33]

R. A. Popa, C. M. S. Redfield, N. Zeldovich, and H. Balakrishnan. Cryptdb: protecting confidentiality with encrypted query processing. In Proceedings of the 23rd ACM Symposium on Operating Systems Principles, SOSP, 2011.

Digital Library

[34]

B. Reed. The height of a random binary search tree. Journal of the ACM, 50(3):306--332, 2003.

Digital Library

[35]

E. Shi, J. Bethencourt, H. T.-H. Chan, D. X. Song, and A. Perrig. Multi-dimensional range query over encrypted data. In Proceedings of the 2007 Symposium on Security and Privacy, S&P, 2007.

Digital Library

[36]

M. Stonebraker, D. J. Abadi, A. Batkin, X. Chen, M. Cherniack, M. Ferreira, E. Lau, A. Lin, S. Madden, E. O'Neil, P. O'Neil, A. Rasin, N. Tran, and S. Zdonik. C-store: a column-oriented dbms. In Proceedings of the 31st International Conference on Very Large Data Bases, VLDB, 2005.

Digital Library

[37]

L. Xiao, O. Bastani, and I.-L. Yen. Security analysis for order preserving encryption schemes. Technical Report UTDCS-01--12, Department of Computer Science, University of Texas Dallas, 2012.

[38]

L. Xiao and I.-L. Yen. A note for the ideal order-preserving encryption object and generalized order-preserving encryption. Technical Report 350, IACR Cryptology ePrint Archive, 2012.

[39]

L. Xiao, I.-L. Yen, and D. T. Huynh. Extending order preserving encryption for multi-user systems. Technical Report 192, IACR Cryptology ePrint Archive, 2012.

[40]

A. C.-C. Yao. Protocols for secure computations (extended abstract). In Proceedings of the 23th Symposium on Foundations of Computer Science, FOCS, 1982.

Digital Library

[41]

A. C.-C. Yao. How to generate and exchange secrets (extended abstract). In Proceedings of the 27th Symposium on Foundations of Computer Science, FOCS, 1986.

Digital Library

[42]

D. H. Yum, D. S. Kim, J. S. Kim, P. J. Lee, and S. J. Hong. Order-preserving encryption for non-uniformly distributed plaintexts. In Proceedings of the 12th International Workshop on Information Security Applications, WISA, 2011.

Digital Library

[43]

M. Zukowski, P. A. Boncz, N. Nes, and S. Héman. Monetdb/x100 - a dbms in the cpu cache. IEEE Data Engineering Bulletin, 28(2):17--22, 2005.

[44]

M. Zukowski, S. Heman, N. Nes, and P. Boncz. Super-scalar ram-cpu cache compression. In Proceedings of the 22nd International Conference on Data Engineering, ICDE, 2006.

Digital Library

Cited By

Miao YWang GLi XLi HChoo KDeng R(2025)Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile CloudIEEE Transactions on Mobile Computing10.1109/TMC.2024.348232124:3(1621-1635)Online publication date: Mar-2025
https://doi.org/10.1109/TMC.2024.3482321
Xu JPeng CLi RFu JLuo M(2025)An Efficient Delegatable Order-Revealing Encryption Scheme for Multi-User Range QueriesIEEE Transactions on Cloud Computing10.1109/TCC.2024.350661413:1(75-86)Online publication date: Jan-2025
https://doi.org/10.1109/TCC.2024.3506614
Miao YYang YLi XWei LLiu ZDeng R(2024)Efficient Privacy-Preserving Spatial Data Query in Cloud ComputingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.328302036:1(122-136)Online publication date: Jan-2024
https://doi.org/10.1109/TKDE.2023.3283020
Show More Cited By

Index Terms

Optimal Average-Complexity Ideal-Security Order-Preserving Encryption

Recommendations

Order-Revealing Encryption: New Constructions, Applications, and Lower Bounds
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

In the last few years, there has been significant interest in developing methods to search over encrypted data. In the case of range queries, a simple solution is to encrypt the contents of the database using an order-preserving encryption (OPE) scheme (...
Frequency-Hiding Order-Preserving Encryption
CCS '15: Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security

Order-preserving encryption allows encrypting data, while still enabling efficient range queries on the encrypted data. This makes its performance and functionality very suitable for data outsourcing in cloud computing scenarios, but the security of ...
On the average cost of order-preserving encryption based on hypergeometric distribution

Order-preserving encryption (OPE) is a deterministic encryption scheme whose encryption function preserves numerical ordering of the plaintexts. The first provably-secure OPE scheme was constructed by Boldyreva, Chenette, Lee, and O@?Neill. The BCLO ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

CCS '14: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security

November 2014

1592 pages

ISBN:9781450329576

DOI:10.1145/2660267

General Chair:
Gail-Joon Ahn
Arizona State University, USA
,
Program Chairs:
Moti Yung
Google -- Columbia University, USA
,
Ninghui Li
Purdue University, USA

Copyright © 2014 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Sponsors

SIGSAC: ACM Special Interest Group on Security, Audit, and Control

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2014

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

CCS'14

Sponsor:

SIGSAC

CCS'14: 2014 ACM SIGSAC Conference on Computer and Communications Security

November 3 - 7, 2014

Arizona, Scottsdale, USA

Acceptance Rates

CCS '14 Paper Acceptance Rate 114 of 585 submissions, 19%;

Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

104
Total Citations
View Citations
837
Total Downloads

Downloads (Last 12 months)25
Downloads (Last 6 weeks)6

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Miao YWang GLi XLi HChoo KDeng R(2025)Efficient and Secure Geometric Range Search Over Encrypted Spatial Data in Mobile CloudIEEE Transactions on Mobile Computing10.1109/TMC.2024.348232124:3(1621-1635)Online publication date: Mar-2025
https://doi.org/10.1109/TMC.2024.3482321
Xu JPeng CLi RFu JLuo M(2025)An Efficient Delegatable Order-Revealing Encryption Scheme for Multi-User Range QueriesIEEE Transactions on Cloud Computing10.1109/TCC.2024.350661413:1(75-86)Online publication date: Jan-2025
https://doi.org/10.1109/TCC.2024.3506614
Miao YYang YLi XWei LLiu ZDeng R(2024)Efficient Privacy-Preserving Spatial Data Query in Cloud ComputingIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.328302036:1(122-136)Online publication date: Jan-2024
https://doi.org/10.1109/TKDE.2023.3283020
Lv CWang JSun SWang YQi SChen X(2024)Towards Practical Multi-Client Order-Revealing Encryption: Improvement and ApplicationIEEE Transactions on Dependable and Secure Computing10.1109/TDSC.2023.326865221:3(1111-1126)Online publication date: May-2024
https://doi.org/10.1109/TDSC.2023.3268652
Li ZMa JMiao YWang XLi JXu C(2024)Enabling Efficient Privacy-Preserving Spatiotemporal Location-Based Services for Smart CitiesIEEE Internet of Things Journal10.1109/JIOT.2023.330560511:3(5288-5300)Online publication date: 1-Feb-2024
https://doi.org/10.1109/JIOT.2023.3305605
Liang XHe JZhu N(2024)Secure Searchable Encryption Based on Local Differential Privacy2024 10th International Symposium on System Security, Safety, and Reliability (ISSSR)10.1109/ISSSR61934.2024.00017(83-91)Online publication date: 16-Mar-2024
https://doi.org/10.1109/ISSSR61934.2024.00017
Cao XLi YBogatov DLiu JRen K(2024)Secure and Practical Functional Dependency Discovery in Outsourced Databases2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00134(1645-1658)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00134
Peng CChen RWang YHe DHuang X(2024)Parameter-Hiding Order-Revealing Encryption Without PairingsPublic-Key Cryptography – PKC 202410.1007/978-3-031-57728-4_8(227-256)Online publication date: 15-Apr-2024
https://dl.acm.org/doi/10.1007/978-3-031-57728-4_8
Cao XLiu JShen YYe XRen K(2023)Frequency-Revealing Attacks against Frequency-Hiding Order-Preserving EncryptionProceedings of the VLDB Endowment10.14778/3611479.361151316:11(3124-3136)Online publication date: 24-Aug-2023
https://dl.acm.org/doi/10.14778/3611479.3611513
Li FMa JMiao YLiu XNing JDeng R(2023)A Survey on Searchable Symmetric EncryptionACM Computing Surveys10.1145/361799156:5(1-42)Online publication date: 27-Nov-2023
https://dl.acm.org/doi/10.1145/3617991
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten