Loading [MathJax]/extensions/MathMenu.js
Secure outsourcing SIFT: Efficient and Privacy-Preserving Image Feature Extraction in the Encrypted Domain | IEEE Journals & Magazine | IEEE Xplore

Secure outsourcing SIFT: Efficient and Privacy-Preserving Image Feature Extraction in the Encrypted Domain


Abstract:

Multimedia data needs huge storage space, and application of multimedia data needs powerful capability of computing. Cloud computing can help owner of multimedia data to ...Show More

Abstract:

Multimedia data needs huge storage space, and application of multimedia data needs powerful capability of computing. Cloud computing can help owner of multimedia data to deal with it. But, multimedia data on cloud may reveal privacy of data owner, such as sex, hobbies, address, looks, and so on. Data owner can encrypt multimedia data for confidentiality before uploading it to cloud. However, encrypted multimedia data makes its utilization difficult. In this paper, we first discover pre-existing schemes have problems of huge storage space, security and low efficiency due to their inefficient and insecure algorithms. Then, we provide an effective and practical privacy-preserving scale-invariant feature transform (SIFT) scheme for encrypted image. It uses leveled homomorphic encryption based on our new encoding schemes, our new homomorphic comparison, division and derivative encryption. Our new secure SIFT scheme can realize higher computing efficiency, greatly reduce communication costs and interactive times between user and server, and perform correct feature key point detection, accurate feature point description and image matching. We evaluate security and efficiency of our new secure SIFT scheme, and compare our new secure SIFT scheme with other schemes in detail. The result shows that it is closest to the original SIFT algorithm.
Published in: IEEE Transactions on Dependable and Secure Computing ( Volume: 17, Issue: 1, 01 Jan.-Feb. 2020)
Page(s): 179 - 193
Date of Publication: 12 September 2017

ISSN Information:

Funding Agency:

References is not available for this document.

1 Introduction

With the development of cloud computing, server provides huge storage space and powerful computing capacity. For users and enterprises, server not only stores a variety of text files, but also stores a variety of multimedia files (images, voices and videos). Cloud service provides us with convenience, but server is not always credible. When malicious users access to server, data on server may expose privacy of users and enterprises [1], [2], such as sex of user, hobbies, home address and workplace, looks, salary, and so on. Privacy and security of cloud computing have become research hotspots. To preserve privacy and insure security for cloud computing, one of the best opinions is to encrypt data. Then, the encrypted data is uploaded to server by users. All operations of server are performed on encrypted data. Server can perform computing on encrypted data without decryption [3], [4]. Fu et al. proposed a content-aware search scheme which can make semantic search more smart. Their scheme uses conceptual graphs as a knowledge representation to substitute traditional keywords and solve the problem of privacy-preserving smart semantic search over encrypted outsourced data [5]. Many schemes support privacy-preserving keyword search [6], [7], [8] on text data. Server does not know contents of queries and the returned results on queries. Privacy of users and users’ query is protected.

Select All
1.
R. L. Rivest, L. Adleman and M. L. Dertouzos, "On data banks and privacy homomorphisms", Found. Secure Comput., vol. 76, no. 4, pp. 169-179, 1978.
2.
R. Kui, C. Wang and Q. Wang, "Security challenges for the public cloud", IEEE Internet Comput., vol. 16, no. 1, pp. 69-73, Jan. 2012.
3.
C. Gentry, "Computing arbitrary functions of encrypted data", Commun. ACM, vol. 53, no. 3, pp. 97-105, 2010.
4.
C. Gentry, "Fully homomorphic encryption using ideal lattices", Proc. 13th Annu. ACM Symp. Theory Comput., vol. 2009, no. 4, pp. 169-178, 2011.
5.
Z. Fu, F. Huang, K. Ren, J. Weng and C. Wang, IEEE Trans. Inf. Forensics Security, vol. 12, no. 8, pp. 1874-1884, Aug. 2017.
6.
S. D. Xiaodong, D. Wagner and A. Perrig, "Practical techniques for searches on encrypted data", Proc. IEEE Symp. Security Privacy, pp. 44-55, 2000.
7.
A. Swaminathan et al., "Confidentiality-preserving rank-ordered search", Proc. ACM Workshop Storage Security Survivability, pp. 7-12, 2007.
8.
W. Zhang, Y. Lin, S. Xiao, J. Wu and S. Zhou, "Privacy preserving ranked multi-keyword search for multiple data owners in cloud computing", IEEE Trans. Comput., vol. 65, no. 5, pp. 1566-1577, May 2016.
9.
J. Shashank, P. Kowshik, K. Srinathan and C. V. Jawahar, "Private content based image retrieval", Proc. IEEE Conf. Comput. Vis. Pattern Recog., pp. 1-8, 2008.
10.
L. Wenjun, "Enabling search over encrypted multimedia databases", Proc. SPIE - Int. Soc. Optical Eng., vol. 7254, pp. 725418-11, 2009.
11.
Q. Wang, S. Hu, K. Ren, M. He, M. Du and Z. Wang, "CloudBI: Practical privacy-preserving outsourcing of biometric identification in the cloud" in Computer Security ESORICS, Berlin, Germany:Springer International Publishing, 2015.
12.
L. Zhang, T. Jung, P. Feng, K. Liu, X. Y. Li and Y. Liu, "PIC: Enable large-scale privacy preserving content-based image search on cloud", Proc. 44th Int. Conf. Parallel Process. IEEE Comput. Soc., pp. 949-958, 2015.
13.
L. C. Shien, "Homomorphic encryption-based secure SIFT for privacy-preserving feature extraction", Proc. SPIE - Int. Soc. Optical Eng., pp. 788005-788017, 2011.
14.
C. Y. Hsu, C. S. Lu and S. C. Pei, "Image feature extraction in encrypted domain with privacy-preserving SIFT", IEEE Trans. Image Process. Publication. IEEE Signal Process. Soc., vol. 21, no. 11, pp. 4593-607, Nov. 2012.
15.
D. G. Lowe, "Distinctive image features from scale-invariant keypoints", Int. J. Comput. Vis., vol. 60, no. 2, pp. 91-110, 2004.
16.
M. Schneider and T. Schneider, "Notes on non-interactive secure comparison in image feature extraction in the encrypted domain with privacy-preserving SIFT", ACM IH, pp. 432-440, 2014.
17.
Z. Qin, J. Yan, K. Ren, C. W. Chen and C. Wang, "Towards efficient privacy-preserving image feature extraction in cloud computing", Proc. ACM Int. Conf., pp. 497-506, 2014.
18.
A. Boldyreva, N. Chenette, Y. Lee and A. ONeill, "Order-preserving symmetric encryption", Proc. Int. Conf. Theory Appl. Cryptographic Techn. Adv. Cryptology - EUROCRYPT, pp. 224-241, Apr. 2009.
19.
S. Hu, W. Qian, J. Wang, Q. Zhan and K. Ren, "Securing SIFT: Privacy-preserving outsourcing computation of feature extractions over encrypted image data", IEEE Tran. Image Process., vol. 25, no. 7, pp. 3411-3425, Jul. 2016.
20.
S. Wang, M. Nassar, M. Atallah and Q. Malluhi, "Secure and private outsourcing of shape-based feature extraction" in Information and Communications Security, Berlin, Germany:Springer International Publishing, pp. 90-99, 2013.
21.
P. Paillier, "Public-key cryptosystems based on composite degree residuosity classes" in Advances in Cryptology, Berlin, Germany:Springer-Verlag, pp. 223-238, 1999.
22.
Q. Wang, S. Hu, K. Ren, J. Wang, Z. Wang and M. Du, "Catch me in the dark: Effective privacy-preserving outsourcing of feature extractions over image data", Proc. IEEE Conf. Comput. Commun., pp. 1-9, 2016.
23.
Q. Wang, J. Wang, S. Hu, Q. Zou and K. Ren, "SecHOG: Privacy-preserving outsourcing computation of histogram of oriented gradients in the cloud", Proc. 11th ACM Asia Conf. Comput. Commun. Security, pp. 257-268, 2016.
24.
H. Jeffrey, J. Pipher and J. H. Silverman, "NTRU: A ring-based public key cryptosystem", Proc. Int. Symp. Algorithmic Number Theory, pp. 267-288, 1998.
25.
J. W. Bos, K. Lauter, J. Loftus and M. Naehrig, "Improved security for a ring-based fully homomorphic encryption scheme" in Cryptography and Coding, Berlin, Heidelberg:Springer, pp. 45-64, 2013.
26.
D. G. Lowe, "Object recognition from local scale-invariant features", Proc. Int. Conf. Comput. Vis., pp. 1150-1157, Sep. 1999.
27.
D. G. Lowe, "Local feature view clustering for 3D object recognition", Proc. IEEE Conf. Comput. Vis. Pattern Recog., pp. 682-688, Dec. 2001.
28.
X. Liu, R. Choo, R. Deng, R. Lu and J. Weng, "Efficient and privacy-preserving outsourced calculation of rational numbers", IEEE Trans. Dependable Secure Comput., vol. PP, no. 99, pp. 1, 2016.
29.
V. Lyubashevsky, C. Peikert and O. Regev, "On ideal lattices and learning with errors over rings", J. ACM, vol. 60, no. 6, pp. 1-35, 2010.
30.
J. Alperin-Sheriff and and C. Peikert, "Faster bootstrapping with polynomial error" in Advances in Cryptology-CRYPTO., Berlin, Heidelberg:Springer, pp. 297-314, 2014.

Contact IEEE to Subscribe

References

References is not available for this document.