Abstract
Currently, image matching is being used in many daily life applications such as content-based image retrieval (CBIR), computer vision, and near duplicate images. Hence, a number of matching methods have been developed. However, most proposed methods do not address the challenges involved when confidential images are used in image matching between two security agencies. Thus, interest to develop a secure method, particularly one that can be used in privacy-preserving image matching, is growing. This paper addresses the challenge of privacy-preserving image matching between two parties where images are confidential. The descriptor set of the queried party needs to be generated and encrypted properly with the use of a secret key at the queried party side before being transferred to the other party. We present the development and validation of a secure scheme to measure the cosine similarity between two descriptor sets. The method can work without using any image encryption, sharing, and trusted third party. We conduct several empirical analyses on real image collections to demonstrate the performance of our work.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Li, M., Cao, N., Yu, S., Lou, W.: FindU: privacy-preserving personal profile matching in mobile social networks. In: Proceedings of 2011 INFOCOM, Shanghai, China, pp. 2435–2443. IEEE Press, April 2011
Zhang, R., Zhang, Y., Sun, J., Yan, G.: Fine-grained private matching for proximity-based mobile social networking. In: Proceedings of 2012 INFOCOM, Orlando, FL, USA, pp. 1969–1977, March 2012
Dai, Q., Kauffman, R.: Business models for Internet-based e-procurement systems and B2B electronic markets: an exploratory assessment. In: Proceedings of the 34th Annual Hawaii International Conference on System Sciences, Maui, HI, USA, pp. 1–10, January 2001
Frikken, K.: Privacy-preserving set union. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol. 4521, pp. 237–252. Springer, Heidelberg (2007)
Li, Y., Tygar, J., Hellerstein, J.: Private matching. In: Lee, D.T., Shieh, S.P., Tygar, J.D. (eds.) Computer Security in the 21st Century, pp. 25–50. Springer, USA (2005)
Nguyen, H.V., Bai, L.: Cosine similarity metric learning for face verification. In: Kimmel, R., Klette, R., Sugimoto, A. (eds.) ACCV 2010, Part II. LNCS, vol. 6493, pp. 709–720. Springer, Heidelberg (2011)
Choi, S., Ghinita, G., Bertino, E.: Secure mutual proximity zone enclosure evaluation. In: Proceedings of the 22nd ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, SIGSPATIAL 2014, pp. 133–142. ACM, New York (2014)
Lowe, D.: Distinctive image features from scale-invariant keypoints. Int. J. Comput. Vis. 60(2), 91–110 (2004)
Chao, J., Huitl, R., Steinbach, E., Schroeder, D.: A novel rate control framework for SIFT/SURF feature preservation in H.264/AVC video compression. IEEE Trans. Circ. Syst. Video Technol. 25(6), 958–972 (2015)
Bay, H., Ess, A., Tuytelaars, T., Gool, L.V.: Speeded-up robust features (SURF). Comput. Vis. Image Underst. 110(3), 346–359 (2008)
Truong, D.-D., Ngoc, C.-S.N., Nguyen, V.-T., Tran, M.-T., Duong, A.-D.: Local descriptors without orientation normalization to enhance landmark regconition. In: Huynh, V.N., Denoeux, T., Tran, D.H., Le, A.C., Pham, B.S. (eds.) KSE 2013, Part I. AISC, vol. 244, pp. 401–413. Springer, Heidelberg (2014)
Freedman, M.J., Nissim, K., Pinkas, B.: Efficient private matching and set intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 1–19. Springer, Heidelberg (2004)
Hazay, C., Nissim, K.: Efficient set operations in the presence of malicious adversari. J. Cryptology 25(3), 383–433 (2012)
Hong, J., Kim, J.W., Kim, J., Park, K., Cheon, J.H.: Constant-round privacy preserving multiset union. Cryptology ePrint Archive, Report 2011/138 (2011). http://eprint.iacr.org/
Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241–257. Springer, Heidelberg (2005)
Jarecki, S., Liu, X.: Efficient oblivious pseudorandom function with applications to adaptive ot and secure computation of set intersection. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 577–594. Springer, Heidelberg (2009)
Hazay, C., Lindell, Y.: Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 155–175. Springer, Heidelberg (2008)
De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218–231. Springer, Heidelberg (2012)
Lu, W., Swaminathan, A., Varna, A.L., Wu, M.: Enabling search over encrypted multimedia databases. In: Proceedings of Media Forensics and Security, SPIE, San Jose, CA, USA, vol. 7254, pp. 18–29 (2009)
Shashank, J., Kowshik, P., Srinathan, K., Jawahar, C.: Private content based image retrieval. In: Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Anchorage, AK, USA, pp. 1–8. IEEE Press, June 2008
Agrawal, R., Evfimievski, A., Srikant, R.: Information sharing across private databases. In: Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, SIGMOD 2003, pp. 86–97. ACM, New York (2003)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proceedings of the Nineteenth Annual ACM Symposium on Theory of Computing, STOC 1987, pp. 218–229. ACM, New York (1987)
Goethals, B., Laur, S., Lipmaa, H., Mielikäinen, T.: On private scalar product computation for privacy-preserving data mining. In: Park, C., Chee, S. (eds.) ICISC 2004. LNCS, vol. 3506, pp. 104–120. Springer, Heidelberg (2005)
Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, STOC 1985, pp. 291–304. ACM, New York (1985)
Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 223–238. Springer, Heidelberg (1999)
Corel test set. http://wang.ist.psu.edu/_jwang/test1.tar
Acknowledgment
This work is supported by National 973 Fundamental Basic Research Program of China under grant No. 2014CB340600.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Abduljabbar, Z.A. et al. (2016). Towards Secure Private Image Matching. In: Huang, X., Xiang, Y., Li, KC. (eds) Green, Pervasive, and Cloud Computing. Lecture Notes in Computer Science(), vol 9663. Springer, Cham. https://doi.org/10.1007/978-3-319-39077-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-39077-2_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-39076-5
Online ISBN: 978-3-319-39077-2
eBook Packages: Computer ScienceComputer Science (R0)