Privacy-preserving complex query evaluation over semantically secure encrypted data

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8712 LNCS, Issue PART 1, 2014, Pages 400-418

  Samanthula, Bharath Kumar ^a   Jiang, Wei ^b   Bertino, Elisa ^a  

^a Purdue University   (United States)

^b Missouri University of Science and Technology   (United States)

Author keywords

cloud computing; complex Query; encryption; privacy

Indexed keywords

CLOUD COMPUTING; CRYPTOGRAPHY; DATA PRIVACY; QUERY PROCESSING; SECURITY SYSTEMS;

AGGREGATE QUERIES; CLOUD COMPUTING ENVIRONMENTS; COMPLEX QUERIES; DATA ACCESS PATTERNS; HO-MOMORPHIC ENCRYPTIONS; PRIVACY PRESERVING; RESOURCECONSTRAINED DEVICES; STATE-OF-THE-ART TECHNIQUES;

SECURITY OF DATA;

EID: 84906500207     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-11203-9_23     Document Type: Conference Paper

References (35)

1. Bajaj, S., Sion, R.: Trusteddb: a trusted hardware based database with privacy and data confidentiality. In: ACM SIGMOD, pp. 205-216 (2011)
2. Agrawal, R., Kiernan, J., Srikant, R., Xu, Y.: Order preserving encryption for numeric data. In: ACM SIGMOD, pp. 563-574 (2004)
3. Mykletun, E., Tsudik, G.: Aggregation queries in the database-as-a- service model. In: Damiani, E., Liu, P. (eds.) Data and Applications Security 2006. LNCS, vol. 4127, pp. 89-103. Springer, Heidelberg (2006)
4. Shi, E., Bethencourt, J., Chan, T.H.H., Song, D., Perrig, A.: Multi-dimensional range query over encrypted data. In: IEEE Security & Privacy, pp. 350-364. IEEE Computer Society (2007)
5. Chung, S., Ozsoyoglu, S., Anti-tamper, G.: Anti-tamper databases: Processing aggregate queries over encrypted databases. In: ICDE Workshops, p. 98 (2006)
6. Boldyreva, A., Chenette, N., Lee, Y., O'Neill, A.: Order-preserving symmetric encryption. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 224-241. Springer, Heidelberg (2009)
7. Hore, B.,Mehrotra, S., Canim,M., Kantarcioglu, M.: Secure multidimensional range queries over outsourced data. The VLDB Journal 21(3), 333-358 (2012)
8. Samanthula, B.K., Jiang, W.: Efficient privacy-preserving range queries over encrypted data in cloud computing. In: IEEE CLOUD, pp. 51-58 (2013)
9. Williams, P., Sion, R., Carbunar, B.: Building castles out of mud: practical access pattern privacy and correctness on untrusted storage. In: CCS, pp. 139-148. ACM (2008)
10. De Capitani di Vimercati, S., Foresti, S., Samarati, P.: Managing and accessing data in the cloud: Privacy risks and approaches. In: 7th International Conference on Risk and Security of Internet and Systems, pp. 1-9 (2012)
11. Islam, M., Kuzu, M., Kantarcioglu, M.: Access pattern disclosure on searchable encryption: Ramification, attack and mitigation. In: NDSS (2012)
12. Goldreich, O.: Encryption Schemes. In: The Foundations of Cryptography, vol. 2, pp. 373-470. Cambridge University Press, Cambridge (2004)
13. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, p. 223. Springer, Heidelberg (1999)
14. Samanthula, B.K., Jiang, W., Bertino, E.: Privacy-preserving complex query evaluation over semantically secure encrypted data. Technical Report TR 2014-05, Dept. of Computer Science, Missouri S&T, Rolla (2014), http://web.mst.edu/wjiang/PPQED.pdf
15. Goldreich, O.: General Cryptographic Protocols. In: The Foundations of Cryptography, vol. 2, pp. 599-746. Cambridge University Press, Cambridge (2004)
16. Boneh, D.,Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 535-554. Springer, Heidelberg (2007)
17. Hac?gumus, H., Iyer, B., Mehrotra, S.: Efficient execution of aggregation queries over encrypted relational databases. In: Lee, Y., Li, J.,Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol. 2973, pp. 125-136. Springer, Heidelberg (2004)
18. Golle, P., Staddon, J.,Waters, B.: Secure conjunctive keyword search over encrypted data. In: Jakobsson, M., Yung, M., Zhou, J. (eds.) ACNS 2004. LNCS, vol. 3089, pp. 31-45. Springer, Heidelberg (2004)
19. Popa, R.A., Redfield, C.M.S., Zeldovich, N., Balakrishnan, H.: Cryptdb: Protecting confidentiality with encrypted query processing. In: SOSP, pp. 85-100. ACM (2011)
20. Shi, E., Chan, T.-H.H., Stefanov, E., Li,M.: Oblivious RAM with o((logn)3) worst-case cost. In: Lee, D.H.,Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197-214. Springer, Heidelberg (2011)
21. Gentry, C.: Fully homomorphic encryption using ideal lattices. In: STOC, pp. 169-178. ACM (2009)
22. Naehrig, M., Lauter, K., Vaikuntanathan, V.: Can homomorphic encryption be practical? In: The ACM Workshop on Cloud Computing Security, pp. 113-124. ACM (2011)
23. Gentry, C., Halevi, S.: Implementing gentry's fully-homomorphic encryption scheme. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 129-148. Springer, Heidelberg (2011)
24. Yao, A.C.: Protocols for secure computations. In: SFCS, pp. 160-164. IEEE Computer Society (1982)
25. Yao, A.C.: How to generate and exchange secrets. In: SFCS, pp. 162-167. IEEE Computer Society (1986)
26. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game-a completeness theorem for protocols with honest majority. In: STOC, pp. 218-229. ACM (1987)
27. Chaum, D., Crepeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: STOC, pp. 11-19. ACM (1988)
28. Damgard, I., Geisler, M., Kroigard, M.: Homomorphic encryption and secure comparison. International Journal of Applied Cryptography 1(1), 22-31 (2008)
29. Bugiel, S., Nurnberger, S., Sadeghi, A.R., Schneider, T.: Twin clouds: An architecture for secure cloud computing (extended abstract). In: Workshop on Cryptography and Security in Clouds (March 2011)
30. Wang, J., Ma, H., Tang, Q., Li, J., Zhu, H., Ma, S., Chen, X.: Efficient verifiable fuzzy keyword search over encrypted data in cloud computing. Computer Science and Information Systems 10(2), 667-684 (2013)
31. Blake, I.F., Kolesnikov, V.: One-round secure comparison of integers. Journal of Mathematical Cryptology 3(1), 37-68 (2009)
32. Schoenmakers, B., Tuyls, P.: Efficient binary conversion for paillier encrypted values. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 522-537. Springer, Heidelberg (2006)
33. Samanthula, B.K., Jiang, W.: An efficient and probabilistic secure bit-decomposition. In: ACM ASIACCS, pp. 541-546 (2013)
34. Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: Proceedings of the 20th USENIX Conference on Security, pp. 35-35 (2011)
35. Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved garbled circuit building blocks and applications to auctions and computing minima. In: Garay, J.A.,Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1-20. Springer, Heidelberg (2009)