A Note on "Confidentiality-Preserving Image Search: A Comparative Study Between Homomorphic Encryption and Distance-Preserving Randomization"

2016/01/06 by Zhengjun Cao, Lihua Liu, Cao, Zhengjun +1
Computer Science · #Chaos-based Image/Signal Encryption #Complexity and Algorithms in Graphs #Cryptography and Data Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences

paper · pdf · doi:10.48550/arxiv.1601.01079

openalex publication_date 2016/01/06 · openalex created_date 2019/06/27 · openalex updated_date 2026/07/28

Abstract

Recently, Lu et al. have proposed two image search schemes based on additive homomorphic encryption [IEEE Access, 2 (2014), 125-141]. We remark that both two schemes are flawed because: (1) the first scheme does not make use of the additive homomorphic property at all; (2) the additive homomorphic encryption in the second scheme is unnecessary and can be replaced by a more efficient symmetric key encryption.

Related

• Fully Homomorphic Image Processing
• Enabling Practical and Privacy-Preserving Image Processing
• k-Anonymously Private Search over Encrypted Data
• Encrypted Vector Similarity Computations Using Partially Homomorphic Encryption: Applications and Performance Analysis
• Danger of using fully homomorphic encryption: A look at Microsoft SEAL