Modeling and assessing inference exposure in encrypted databases

ACM Transactions on Information and System Security

Volumn 8, Issue 1, 2005, Pages 119-152

  Ceselli, Alberto ^a   Damiani, Ernesto ^a   De Capitani Di Vimercati, Sabrina ^a   Jajodia, Sushil ^b   Paraboschi, Stefano ^c   Samarati, Pierangela ^a  

^a UNIVERSITY OF MILAN   (Italy)

^b GEORGE MASON UNIVERSITY   (United States)

^c UNIVERSITY OF BERGAMO   (Italy)

Author keywords

Cryptography; Database service; Indexing; Inference

Indexed keywords

DATA INTEGRITY; DATABASE SERVICES; INFERENCE; SERVICE PROVIDERS;

CLIENT SERVER COMPUTER SYSTEMS; CRYPTOGRAPHY; INDEXING (OF INFORMATION); ONLINE SYSTEMS; QUERY LANGUAGES; SECURITY OF DATA;

DATABASE SYSTEMS;

EID: 16644381926     PISSN: 10949224     EISSN: None     Source Type: Journal    
DOI: 10.1145/1053283.1053289     Document Type: Article

References (30)

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. CORDELIA, 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. Vente, 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.