skip to main content
article

Modeling and assessing inference exposure in encrypted databases

Published: 01 February 2005 Publication History

Abstract

The scope and character of today's computing environments are progressively shifting from traditional, one-on-one client-server interaction to the new cooperative paradigm. It then becomes of primary importance to provide means of protecting the secrecy of the information, while guaranteeing its availability to legitimate clients. Operating online querying services securely on open networks is very difficult; therefore many enterprises outsource their data center operations to external application service providers. A promising direction toward prevention of unauthorized access to outsourced data is represented by encryption. However, data encryption is often supported for the sole purpose of protecting the data in storage while allowing access to plaintext values by the server, which decrypts data for query execution. In this paper, we present a simple yet robust single-server solution for remote querying of encrypted databases on external servers. Our approach is based on the use of indexing information attached to the encrypted database, which can be used by the server to select the data to be returned in response to a query without the need of accessing the plaintext database content. Our indexes balance the trade-off between efficiency requirements in query execution and protection requirements due to possible inference attacks exploiting indexing information. We investigate quantitative measures to model inference exposure and provide some related experimental results.

References

[1]
Agrawal, R., Kiernan, J., Srikant, R., and Xu, Y. 2004. Order-preserving encryption for numeric data. In Proceedings of the ACM SIGMOD 2004 Conference, Paris, France. ACM Press, New York.
[2]
Bouganim, L. and Pucheral, P. 2002. Chip-secured data access: Confidential data on untrusted servers. In Proceedings of the 28th International Conference on Very Large Data Bases, Hong Kong, China. Morgan Kaufmann, San Mateo, CA, 131--142.
[3]
Boyens, C. and Günter, O. 2003. Using online services in untrusted environments---a privacy-preserving architecture. In Proceedings of the 11th European Conference on Information Systems (ECIS '03), Naples, Italy.
[4]
Caprara, A., Kellerer, H., and Pferschy, U. 2000. A ptas for the multiple subset sum problem with different knapsack capacities. Inf. Process. Lett. 73, 111--118.
[5]
Caprara, A., Kellerer, H., and Pferschy, U. 2003. A 3/4-approximation algorithm for multiple subset sum. J. Heuristics 9, 99--111.
[6]
Cordella, L., Foggia, P., Sansone, C., and Vento, M. 1999. Performance evaluation of the VF graph matching algorithm. In Proceedings of the 10th International Conference on Image Analysis and Processing, Venice, Italy. IEEE Computer Society Press, Los Alamitos, CA.
[7]
Cordella, L., Foggia, P., Sansone, C., and Vento, M. 2001. An improved algorithm for matching large graphs. In Proceedings of the 3rd IAPR TC-15 Workshop on Graph-Based Representations in Pattern Recognition, Ischia, Italy, J. Jolion, W. Kropatsch, and M. Vento, Eds. 149--159.
[8]
Damiani, E., De Capitani di Vimercati, S., Jajodia, S., Paraboschi, S., and Samarati, P. 2003. Balancing confidentiality and efficiency in untrusted relational dbmss. In Proceedings of the 10th ACM Conference on Computer and Communications Security, Washington, DC. ACM Press, New York.
[9]
Damiani, E., De Capitani di Vimercati, S., Paraboschi, S., and Samarati, P. 2004. Computing range queries on obfuscated data. In Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems, Perugia, Italy.
[10]
Davida, G., Wells, D., and Kam, J. 1981. A database encryption system with subkeys. ACM Trans. Database Syst. 6, 2 (June), 312--328.
[11]
Denning, D. 1982. Cryptography and Data Security. Addison-Wesley, Reading, MA.
[12]
Domingo-Ferrer, J. 1996. A new privacy homomorphism and applications. Inf. Process. Lett. 60, 5 (Dec.), 277--282.
[13]
Domingo-Ferrer, J. and Herrera-Joanconmartí, J. 1998. A privacy homomorphism allowing field operations on encrypted data. Jornades de Matemàtica Discreta i Algorísmica.
[14]
Foggia, P. 2001. The vflib graph matching library, version 2.0. http://amalfi.dis.unina.it/graph/db/vflib-2.0/doc/vflib.html.
[15]
Garey, M. and Johnson, D. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York.
[16]
Hacigümüs, H., Iyer, B., Li, C., and Mehrotra, S. 2002a. Executing SQL over encrypted data in the database-service-provider model. In Proceedings of the ACM SIGMOD'2002, Madison, WI. ACM Press, New York.
[17]
Hacigümüs, H., Iyer, B., and Mehrotra, S. 2002b. Providing database as a service. In Proceedings of the 18th International Conference on Data Engineering, San Jose, CA. IEEE Computer Society Press, Los Alamitos, CA.
[18]
Hacigümüs, H., Iyer, B., and Mehrotra, S. 2004. Efficient execution of aggregation queries over encrypted relational databases. In Proceedings of the 9th International Conference on Database Systems for Advanced Applications. Springer, Jeju Island, Korea.
[19]
Hacigümüs, H. and Mehrotra, S. 2004. Performance-conscious key management in encrypted databases. In Proceedings of the 18th Annual IFIP WG 11.3 Working Conference on Data and Applications Security, Sitges, Catalonia, Spain. Kluwer Academic Publishers, Dordrecht.
[20]
Jensen, C. 2000. Cryptocache: a secure sharable file cache for roaming users. In Proceedings of the 9th Workshop on ACM SIGOPS European Workshop: Beyond the PC. New Challenges for the Operating System, Kolding, Denmark. 73--78.
[21]
Klein, S., Bookstein, A., and Deerwester, S. 1989. Storing text retrieval systems on CD-ROM: compression and encryption considerations. ACM Trans. Inf. Syst. 7, 3 (July), 230--245.
[22]
McKay, B. 1981. Practical graph isomorphism. Congressus Numerantium 30, 45--87.
[23]
Pisinger, D. 1995. Algorithms for knapsack problems. Ph.D. thesis, DIKU, University of Copenhagen, Copenhagen, Denmark. Report 95/1.
[24]
Rivest, R., Adleman, L., and Dertouzos, M. 1978. Data banks and privacy homomorphisms. In Foundations of Secure Computation. Academic Press, Orlando, FL. 169--179.
[25]
Samarati, P. 2001. Protecting respondent's privacy in microdata release. IEEE Trans. Knowledge Data Eng. 13, 6 (Nov./Dec.), 1010--1017.
[26]
Song, D., Wagner, D., and Perrig, A. 2000. Practical techniques for searches on encrypted data. In Proceedings of the 2000 IEEE Symposium on Security and Privacy, Oakland, CA. IEEE Computer Society Press, Los Alamitos, CA. 44--55.
[27]
Ullman, J. 1976. An algorithm for subgraph isomorphism. J. ACM 23, 31--42.
[28]
Walton, J. 2002. Developing an enterprise information security policy. In Proceedings of the 30th Annual ACM SIGUCCS Conference on User Services, Providence, RI. ACM Press, New York.
[29]
Ward, J., O'Sullivan, M., Shahoumian, T., and Wilkes, J. 2002. Appia: Automatic storage area network fabric design. In Proceedings of the Conference on File and Storage Technologies (FAST 2002). The USENIX Association, Monterey, CA.
[30]
Whitney, H. 1932. Congruent graphs and the connectivity of graphs. Am. J. Math. 54, 150--168.

Cited By

View all
  • (2024)Revisiting frequency-smoothing encryption: new security definitions and efficient constructionCybersecurity10.1186/s42400-024-00208-w7:1Online publication date: 1-Aug-2024
  • (2024)Preserving Order Encryption Algorithm for Cloud-Assisted Data2024 9th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS61882.2024.10603194(225-230)Online publication date: 19-Apr-2024
  • (2023)Protecting Data and Queries in Cloud-Based ScenariosSN Computer Science10.1007/s42979-023-01862-64:5Online publication date: 10-Jun-2023
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Transactions on Information and System Security
ACM Transactions on Information and System Security  Volume 8, Issue 1
February 2005
152 pages
ISSN:1094-9224
EISSN:1557-7406
DOI:10.1145/1053283
Issue’s Table of Contents
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 ACM 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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 February 2005
Published in TISSEC Volume 8, Issue 1

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Cryptography
  2. database service
  3. indexing
  4. inference

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)11
  • Downloads (Last 6 weeks)1
Reflects downloads up to 16 Feb 2025

Other Metrics

Citations

Cited By

View all
  • (2024)Revisiting frequency-smoothing encryption: new security definitions and efficient constructionCybersecurity10.1186/s42400-024-00208-w7:1Online publication date: 1-Aug-2024
  • (2024)Preserving Order Encryption Algorithm for Cloud-Assisted Data2024 9th International Conference on Computer and Communication Systems (ICCCS)10.1109/ICCCS61882.2024.10603194(225-230)Online publication date: 19-Apr-2024
  • (2023)Protecting Data and Queries in Cloud-Based ScenariosSN Computer Science10.1007/s42979-023-01862-64:5Online publication date: 10-Jun-2023
  • (2021)Multi-dimensional indexes for point and range queries on outsourced encrypted data2021 IEEE Global Communications Conference (GLOBECOM)10.1109/GLOBECOM46510.2021.9685186(1-6)Online publication date: Dec-2021
  • (2020)SAGMA: Secure Aggregation Grouped by Multiple AttributesProceedings of the 2020 ACM SIGMOD International Conference on Management of Data10.1145/3318464.3380569(587-601)Online publication date: 11-Jun-2020
  • (2019)Pseudonymization for research data collection: is the juice worth the squeeze?BMC Medical Informatics and Decision Making10.1186/s12911-019-0905-x19:1Online publication date: 4-Sep-2019
  • (2019)Quantifying Information Leakage of Deterministic EncryptionProceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop10.1145/3338466.3358915(129-139)Online publication date: 11-Nov-2019
  • (2019)Occupancy detection of residential buildings using smart meter data: A large-scale studyEnergy and Buildings10.1016/j.enbuild.2018.11.025183(195-208)Online publication date: Jan-2019
  • (2018)Service-Driven ComputingInformation Retrieval and Management10.4018/978-1-5225-5191-1.ch102(2287-2311)Online publication date: 2018
  • (2018)CipherBit192: Encryption Technique for Securing DataApplied Computing and Information Technology10.1007/978-3-319-98370-7_11(137-148)Online publication date: 30-Aug-2018
  • Show More Cited By

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media