Privacy-preserving k-nearest neighbour query on outsourced database

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

Volumn 9722, Issue , 2016, Pages 181-197

  Xu, Rui ^a   Morozov, Kirill ^b   Yang, Yanjiang ^c   Zhou, Jianying ^d   Takagi, Tsuyoshi ^e,f  

^a KDDI R AND D LABORATORIES INC   (Japan)

^b TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^c Global Research Center Singapore/Organic Electronics   (Singapore)

^d INSTITUTE FOR INFOCOMM RESEARCH   (Singapore)

^e KYUSHU UNIVERSITY   (Japan)

^f JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

Author keywords

Encrypted database; k nearest neighbour search; Oblivious RAM; Outsourcing of computation; Privacy preserving computation

Indexed keywords

DATA PRIVACY; DATABASE SYSTEMS; DISTRIBUTED DATABASE SYSTEMS; INFORMATION MANAGEMENT; NEAREST NEIGHBOR SEARCH; QUERY PROCESSING; SECURITY OF DATA;

CLOUD SERVICE PROVIDERS; DATA ACCESS PATTERNS; DATABASE AS A SERVICE; ENCRYPTED DATABASE; K NEAREST NEIGHBOURS (K-NN); K-NEAREST NEIGHBOURS; OUTSOURCED DATABASES; PRIVACY PRESERVING COMPUTATION;

TREES (MATHEMATICS);

EID: 84978200144     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-40253-6_11     Document Type: Conference Paper

References (31)

1. Atallah, M.J., Frikken, K.B.: Securely outsourcing linear algebra computations. In: Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security, pp. 48–59. ACM (2010)
2. Bellare, M., Hoang, V.T., Keelveedhi, S., Rogaway, P.: Efficient garbling from a fixed-key blockcipher. SP 2013, 478–492 (2013)
3. Bellare, M., Hoang, V.T., Rogaway, P.: Foundations of garbled circuits. CCS 2012, 784–796 (2012)
4. Bugiel, S., Nurnberger, S., Sadeghi, A., Schneider, T.: Twin clouds: an architecture for secure cloud computing. In: Workshop on Cryptography and Security in Clouds (WCSC 2011) (2011)
5. Carter, H., Mood, B., Traynor, P., Butler, K.R.: Secure outsourced garbled circuit evaluation for mobile devices. In: USENIX Security, pp. 289–304 (2013)
6. Chor, B., Kushilevitz, E., Goldreich, O., Sudan, M.: Private information retrieval. J. ACM 45(6), 965–981 (1998). http://doi.acm.org/10.1145/293347.293350
7. Curino, C., et al.: Relational cloud: a database-as-a-service for the cloud. In: 5th Biennial Conference on Innovative Data Systems Research, CIDR, pp. 9–12 (2011)
8. Domingo-Ferrer, J.: A provably secure additive and multiplicative privacy homomorphism. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 471–483. Springer, Heidelberg (2002)
9. Elmehdwi, Y., Samanthula, B., Jiang, W.: Secure k-nearest neighbor query over encrypted data in outsourced environments. ICDE 2014, 664–675 (2014)
10. Friedman, J.H., Baskett, F., Shustek, L.J.: An algorithm for finding nearest neighbors. IEEE Trans. Comput. 24(10), 1000–1006 (1975)
11. Goldreich, O.: Foundations of Cryptography: Basic Applications, vol. 2. Cambridge University Press, New York (2009)
12. Goldreich, O., Ostrovsky, R.: Software protection and simulation on oblivious rams. J. ACM 43(3), 431–473 (1996)
13. Gordon, S.D., Katz, J., Kolesnikov, V., Krell, F., Malkin, T., Raykova, M., Vahlis, Y.: Secure two-party computation in sublinear (amortized) time. CCS 2012, 513–524 (2012)
14. Hu, H., Xu, J., Ren, C., Choi, B.: Processing private queries over untrusted data cloud through privacy homomorphism. In: ICDE 2011, pp. 601–612. IEEE (2011)
15. Kamara, S., Mohassel, P., Raykova, M.: Outsourcing multi-party computation. In: IACR Cryptology ePrint Archive 2011/272 (2011)
16. Kamara, S., Mohassel, P., Raykova, M., Sadeghian, S.: Scaling private set intersection to billion-element sets. In: Christin, N., Safavi-Naini, R. (eds.) FC 2014. LNCS, vol. 8437, pp. 193–213. Springer, Heidelberg (2014)
17. Kamara, S., Mohassel, P., Riva, B.: Salus: a system for server-aided secure function evaluation. In: Proceedings of the 2012 ACM conference on Computer and communications security, pp. 797–808. ACM (2012)
18. Kamara, S., Raykova, M.: Secure outsourced computation in a multi-tenant cloud. In: Workshop on Cryptography and Security in Clouds (2011)
19. Keller, M., Scholl, P.: Efficient, oblivious data structures for MPC. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014, Part II. LNCS, vol. 8874, pp. 506–525. Springer, Heidelberg (2014)
20. Samet, H.: The Design and Analysis of Spatial Data Structures. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)
21. Shi, E., Chan, T.-H.H., Stefanov, E., Li, M.: Oblivious RAM with O((logN)3) worst-case cost. In: Wang, X., Lee, D.H. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 197–214. Springer, Heidelberg (2011)
22. Stefanov, E., van Dijk, M., Shi, E., Fletcher, C., Ren, L., Yu, X., Devadas, S.: Path ORAM: an extremely simple Oblivious RAM protocol. CCS 2013, 299–310 (2013)
23. Wagner, D.: Cryptanalysis of an algebraic privacy homomorphism. In: Boyd, C., Mao, W. (eds.) ISC 2003. LNCS, vol. 2851, pp. 234–239. Springer, Heidelberg (2003)
24. Wang, C., Ren, K., Wang, J.: Secure and practical outsourcing of linear programming in cloud computing. In: INFOCOM, 2011 Proceedings IEEE, pp. 820–828. IEEE (2011)
25. 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. Comput. Sci. Inf. Syst. 10(2), 667–684 (2013)
26. Wang, X., Nayak, K., Liu, C., Shi, E., Stefanov, E., Huang, Y.: Oblivious data structures. In: CCS 2014 (2014)
27. Wong, W.K., Cheung, D.W.L., Kao, B., Mamoulis, N.: Secure kNN computation on encrypted databases. In: SIGMOD 2009, pp. 139–152 (2009)
28. Yao, A.C.: Protocols for secure computations. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, pp. 160–164. IEEE (1982)
29. Yao, B., Li, F., Xiao, X.: Secure nearest neighbor revisited. ICDE 2013, 733–744 (2013)
30. Zahur, S., Evans, D.: Circuit structures for improving efficiency of security and privacy tools. SP 2013, 493–507 (2013)
31. Zhu, Y., Xu, R., Takagi, T.: Secure k-nn computation on encrypted cloud data without sharing key with query users. In: Proceedings of the 2013 International Workshop on Security in Cloud Computing, pp. 55–60. ACM (2013)