Enabling a Secure Match over Private Image Collections
DOI:
https://doi.org/10.31642/JoKMC/2018/030204Keywords:
Image matching, Secure Multiparty Computing (SMC), SURF descriptors, Homomorphic encryption.Abstract
Image matching techniques play an essential role in many real world applications such as content based image retrieval (CBIR), computer vision, and near duplicate images. The state of the art methods are generally assumed that the content of images is not private. This reduces the utilization of these methods to work within only environments where images are publicly access. Essentially, this assumption limits more practical applications, e.g., image matching between two security agencies, where images are confidential. This paper addresses the problem of privacy-preserving image matching between two parties where images should not be revealed to each other. The descriptor set of the queried party needs to be generated and encrypted properly using a secret key at the queried party side before being transferred to the other party. We have developed a secure scheme to measure the cosine similarity between two descriptor sets without decryption. Several experiments are conducted to investigate the performance of the proposed scheme.
Downloads
References
D. Lowe. Distinctive image features from scale-invariant key points. IJCV, 60(2):91–110, 2004. DOI: https://doi.org/10.1023/B:VISI.0000029664.99615.94
H. Bay, A. Ess, T. Tuytelaars, and L. Van Gool. Speeded-up robust features (SURF). Computer Vision and Image Understanding, 110:346–359, 2008. DOI: https://doi.org/10.1016/j.cviu.2007.09.014
O. Chum, J. Philbin, M. Isard, and A. Zisserman. Scalable near identical image and shot detection. In Proc. CIVR, 2007. [4] O. Chum, J. Philbin, and A. Zisserman. Near Duplicate Image Detection: min-Hash and tf-idf Weighting. In Proc. British Machine Vision, 2008. DOI: https://doi.org/10.5244/C.22.50
J. Shashank, P. Kowshik, K. Srinathan, and C. Jawahar. Private content based image retrieval. In Proc. IEEE Conf. on Computer Vision and Pattern Recognition, 2008 DOI: https://doi.org/10.1109/CVPR.2008.4587388
W. Lu, A. Swaminathan, A. L. Varna, and M. Wu. Enabling search over encrypted multimedia databases. In Proc. of SPIE Media Forensics and Security’09, 2009. DOI: https://doi.org/10.1117/12.806980
O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game—a completeness theorem for protocols with honest majority. In Proc. of the 19th ACM Symposium on Theory of Computing, New York, NY, USA, pp. 218–229, 1987. DOI: https://doi.org/10.1145/28395.28420
B. Goethals, S. Laur, H. Lipmaa, and T. Mielikainen. On secure scalar product computation for privacy-preserving data mining. In Proc. The 7th Annual International Conference in Information Security and Cryptology (ICISC 2004), Seoul, Korea, pp. 104–120, Dec 2–3, 2004. DOI: https://doi.org/10.1007/11496618_9
S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof systems. In Proc. of the 17th Annual ACM Symposium on Theory of Computing (STOC’85), Providence, Rhode Island, USA, pp. 291–304, May 6–8, 1985. DOI: https://doi.org/10.1145/22145.22178
P. Paillier. Public key cryptosystems based on composite degree residuosity classes. In Proc. Advances in Cryptology—Eurocrypt ’99. Lecture Notes in Computer Science, vol. 1592, pp. 223–238, Prague, Czech Republic, May 2–6, 1999. DOI: https://doi.org/10.1007/3-540-48910-X_16
J. Katz, and Y. Lindell. Introduction to Modern Cryptography: Principles and Protocols. 1st edition, CRC Press, 2007. DOI: https://doi.org/10.1201/9781420010756
Corel test set. [Online]. Available: http://wang.ist.psu.edu/_jwang/test1.tar
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2016 Ayad Ibrahim Abdulsada, Hesham Saleh Ridha, Hameed Abdul-kareem Younis
This work is licensed under a Creative Commons Attribution 4.0 International License.
which allows users to copy, create extracts, abstracts, and new works from the Article, alter and revise the Article, and make commercial use of the Article (including reuse and/or resale of the Article by commercial entities), provided the user gives appropriate credit (with a link to the formal publication through the relevant DOI), provides a link to the license, indicates if changes were made and the licensor is not represented as endorsing the use made of the work.
