Translator Disclaimer
8 February 2011 Homomorphic encryption-based secure SIFT for privacy-preserving feature extraction
Author Affiliations +
Proceedings Volume 7880, Media Watermarking, Security, and Forensics III; 788005 (2011)
Event: IS&T/SPIE Electronic Imaging, 2011, San Francisco Airport, California, United States
Privacy has received much attention but is still largely ignored in the multimedia community. Consider a cloud computing scenario, where the server is resource-abundant and is capable of finishing the designated tasks, it is envisioned that secure media retrieval and search with privacy-preserving will be seriously treated. In view of the fact that scale-invariant feature transform (SIFT) has been widely adopted in various fields, this paper is the first to address the problem of secure SIFT feature extraction and representation in the encrypted domain. Since all the operations in SIFT must be moved to the encrypted domain, we propose a homomorphic encryption-based secure SIFT method for privacy-preserving feature extraction and representation based on Paillier cryptosystem. In particular, homomorphic comparison is a must for SIFT feature detection but is still a challenging issue for homomorphic encryption methods. To conquer this problem, we investigate a quantization-like secure comparison strategy in this paper. Experimental results demonstrate that the proposed homomorphic encryption-based SIFT performs comparably to original SIFT on image benchmarks, while preserving privacy additionally. We believe that this work is an important step toward privacy-preserving multimedia retrieval in an environment, where privacy is a major concern.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Chao-Yung Hsu, Chun-Shien Lu, and Soo-Chang Pei "Homomorphic encryption-based secure SIFT for privacy-preserving feature extraction", Proc. SPIE 7880, Media Watermarking, Security, and Forensics III, 788005 (8 February 2011);

Back to Top