Searchable Encryption over Feature-Rich Data

IEEE Transactions on Dependable and Secure Computing

Volumn 15, Issue 3, 2018, Pages 496-510

  Wang, Qian ^a   He, Meiqi ^b   Du, Minxin ^a   Chow, Sherman S M ^c   Lai, Russell W F ^c   Zou, Qin ^a  

^a WUHAN UNIVERSITY   (China)

^b UNIVERSITY OF HONG KONG   (Hong Kong)

^c CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Cloud storage; homomorphic encryption; proximity search; searchable encryption; similarity search

Indexed keywords

DATA STRUCTURES; DIGITAL STORAGE; FUZZY FILTERS;

CLOUD STORAGES; HO-MOMORPHIC ENCRYPTIONS; PROXIMITY SEARCH; SEARCHABLE ENCRYPTIONS; SIMILARITY SEARCH;

CRYPTOGRAPHY;

EID: 85038858282     PISSN: 15455971     EISSN: 19410018     Source Type: Journal    
DOI: 10.1109/TDSC.2016.2593444     Document Type: Article

References (31)

1. R. Curtmola, J. A. Garay, S. Kamara, and R. Ostrovsky, "Searchable symmetric encryption: Improved definitions and efficient constructions," in Proc. 13th ACM Conf. Comput. Commun. Secur., 2006, pp. 79-88.
2. S. Kamara, C. Papamanthou, and T. Roeder, "Dynamic searchable symmetric encryption," in Proc. ACM Conf. Comput. Commun. Secur., 2012, pp. 965-976.
3. D. Cash, S. Jarecki, C. S. Jutla, H. Krawczyk, M.-C. Rosu, and M. Steiner, "Highly-scalable searchable symmetric encryption with support for Boolean queries," in Proc. 33rd Annu. Cryptology Conf., 2013, pp. 353-373.
4. M. Chase and S. Kamara, "Structured encryption and controlled disclosure," in Proc. 16th Int. Conf. Theory Appl. Cryptology Inf. Secur., 2010, pp. 577-594.
5. R. W. F. Lai and S. S. M. Chow, "Structured encryption with noninteractive updates and parallel traversal," in Proc. IEEE 35th Int. Conf. Distrib. Comput. Syst., 2015, pp. 776-777.
6. S. Hu, Q. Wang, J. Wang, Z. Qin, and K. Ren, "Securing SIFT: Privacy-preserving outsourcing computation of feature extractions over encrypted image data," IEEE Trans. Image Process., vol. 25, no. 7, pp. 3411-3425, May 2016.
7. Z. Ren, L. Wang, Q. Wang, and M. Xu, "Dynamic proofs of retrievability for coded cloud storage systems," IEEE Trans. Service Comput., vol. PP, no. 99, pp. 1-1, Sep. 2015, Doi: 10.1109/TSC.2015.2481880.
8. Z. Xia, X. Wang, X. Sun, and Q. Wang, "A secure and dynamic multi-keyword ranked search scheme over encrypted cloud data," IEEE Trans. Parallel Distrib. Syst., vol. 27, no. 2, pp. 340-352, Feb. 2016.
9. D. X. Song, D. Wagner, and A. Perrig, "Practical techniques for searches on encrypted data," in Proc. IEEE Symp. Secur. Privacy, 2000, pp. 44-55.
10. S. Kamara and C. Papamanthou, "Parallel and dynamic searchable symmetric encryption," in Proc. 17th Int. Conf. Financial Cryptography Data Secur., 2013, pp. 258-274.
11. E. Stefanov, C. Papamanthou, and E. Shi, "Practical dynamic searchable encryption with small leakage," in Proc. Netw. Distrib. Syst. Secur. Symp., 2014, pp. 23-26.
12. P. Golle, J. Staddon, and B. Waters, "Secure conjunctive keyword search over encrypted data," in Proc. 2nd Int. Conf. Appl. Cryptography Netw. Secur., 2004, pp. 31-45.
13. D. Boneh and B. Waters, "Conjunctive, subset, and range queries on encrypted data," in Proc. 4th Theory Cryptography Conf., 2007, pp. 535-554.
14. T. Moataz and A. Shikfa, "Boolean symmetric searchable encryption," in Proc. 8th ACM SIGSAC Symp. Inf. Comput. Commun. Secur., 2013, pp. 265-276.
15. R. Weber, H.-J. Schek, and S. Blott, "A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces," in Proc. 24th Int. Conf. Very Large Data Bases, 1998, pp. 194-205.
16. Q. Lv, M. Charikar, and K. Li, "Image similarity search with compact data structures," in Proc. 13th ACM Int. Conf. Inf. Knowl. Manage., 2004, pp. 208-217.
17. I. Giangreco, I. Al Kabary, and H. Schuldt, "ADAM - Database and information retrieval system for big multimedia collections," in Proc. IEEE Int. Congr. Big Data, 2014, pp. 406-413.
18. M. Kuzu, M. S. Islam, and M. Kantarcioglu, "Efficient similarity search over encrypted data," in Proc. IEEE 28th Int. Conf. Data Eng., 2012, pp. 1156-1167.
19. G. R. Hjaltason and H. Samet, "Properties of embedding methods for similarity searching in metric spaces," IEEE Trans. Pattern Anal. Mach. Intell., vol. 25, no. 5, pp. 530-549, May 2003.
20. Q. Lv, W. Josephson, Z. Wang, M. Charikar, and K. Li, "Multiprobe LSH: Efficient indexing for high-dimensional similarity search," in Proc. 33rd Int. Conf. Very Large Data Bases, 2007, pp. 950-961.
21. J. Yuan and S. Yu, "Efficient privacy-preserving biometric identification in cloud computing," in Proc. IEEE INFOCOM, 2013, pp. 2652-2660.
22. T. Moataz, A. Shikfa, N. Cuppens-Boulahia, and F. Cuppens, "Semantic search over encrypted data," in Proc. 20th Int. Conf. Telecommun., 2013, pp. 1-5.
23. B. Wang, S. Yu, W. Lou, and Y. T. Hou, "Privacy-preserving multikeyword fuzzy search over encrypted data in the cloud," in Proc. IEEE INFOCOM, 2014, pp. 2112-2120.
24. W. K. Wong, D. W.-L. Cheung, B. Kao, and N. Mamoulis, "Secure kNN computation on encrypted databases," in Proc. ACM SIGMOD Int. Conf. Manage. Data, 2009, pp. 139-152.
25. T. Deselaers, D. Keysers, and H. Ney, "Features for image retrieval: An experimental comparison," Inf. Retrieval, vol. 11, no. 2, pp. 77-107, 2008.
26. S. Har-Peled, P. Indyk, and R. Motwani, "Approximate nearest neighbor: Towards removing the curse of dimensionality," Theory Comput., vol. 8, no. 1, pp. 321-350, 2012.
27. J. Katz and Y. Lindell, Introduction to Modern Cryptography: Principles and Protocols. Boca Raton, FL, USA: CRC Press, 2007.
28. P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes," in Proc. Int. Conf. Theory Appl. Cryptographic Techn., 1999, pp. 223-238.
29. M. Datar, N. Immorlica, P. Indyk, and V. S. Mirrokni, "Localitysensitive hashing scheme based on p-stable distributions," in Proc. 20th Annu. Symp. Comput. Geometry, 2004, pp. 253-262.
30. A. Joly and O. Buisson, "A posteriori multi-probe locality sensitive hashing," in Proc. 16th ACM Int. Conf. Multimedia, 2008, pp. 209-218.
31. B. Kulis and K. Grauman, "Kernelized locality-sensitive hashing for scalable image search," in Proc. IEEE 12th Int. Conf. Comput. Vision, 2009, pp. 2130-2137.