Homomorphic encryption and secure comparison

DOI10.1504/IJACT.2008.017048MaRDI QIDQ2379113zbMATH OpenWikidataFDO

Authors Martin Geisler, Mikkel Krøigård, Ivan B. Damgård

Publication date 15 January 2009

Published in International Journal of Applied Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1504/IJACT.2008.017048

zbMATH Keywords

applied cryptographybenchmarkhomomorphic encryptionMPConline auctionsprotocolssecret sharingsecure integer comparisonsecure multiparty computationsecurity

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Review text

Summary: We propose a protocol for secure comparison of integers based on homomorphic encryption. We also propose a homomorphic encryption scheme that can be used in our protocol, makes it more efficient than previous solutions, and can also be used as the basis of efficient and general secure Multiparty Computation (MPC). We show how our comparison protocol can be used to improve security of online auctions, and demonstrate that it is efficient enough to be used in practice. For comparison of 16 bits numbers with security based on 1024 bits RSA (executed by two parties), our implementation takes 0.28 sec including all computation and communication. Using precomputation, one can save a factor of roughly 10.

Recommendations

• Efficient and Secure Comparison for On-Line Auctions
• Improved secure integer comparison via homomorphic encryption
• Practical and Secure Solutions for Integer Comparison
• Practical homomorphic encryption over the integers for secure computation in the cloud
• Efficient homomorphic comparison methods with optimal complexity

Cited in

(27)

• Non-interactive and fully output expressive private comparison
• Secure two-party integer comparison protocol without any third party
• Constant-round client-aided secure comparison protocol
• Numerical method for comparison on homomorphically encrypted numbers
• Privacy-preserving naive Bayes classifiers secure against the substitution-then-comparison attack
• Positional characteristics for efficient number comparison over the homomorphic encryption
• Comparison-based attacks against noise-free fully homomorphic encryption schemes
• Threshold properties of prime power subgroups with application to secure integer comparisons
• Efficient homomorphic comparison methods with optimal complexity
• A secure and efficient protocol for electronic treasury auctions
• Semi-homomorphic encryption and multiparty computation
• Client-aided two-party secure interval test protocol
• Improved multiplication triple generation over rings via RLWE-based AHE
• Conditional Encrypted Mapping and Comparing Encrypted Numbers
• scientific article; zbMATH DE number 5787842 (Why is no real title available?)
• Efficient and Secure Comparison for On-Line Auctions
• One-round secure comparison of integers
• Discrete logarithm based additively homomorphic encryption and secure data aggregation
• Encrypted integer division and secure comparison
• A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
• Practical and Secure Solutions for Integer Comparison
• Private evaluation of a decision tree based on secret sharing
• Cryptanalysis of a privacy-preserving authentication scheme based on private set intersection
• Secure function extensions to additively homomorphic cryptosystems
• Trusted computing with addition machines. I
• Updatable privacy-preserving blueprints
• Improved secure integer comparison via homomorphic encryption

This page was built for publication: Homomorphic encryption and secure comparison

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2379113)