Improved secure integer comparison via homomorphic encryption

DOI10.1007/978-3-030-40186-3_17MaRDI QIDQ785030zbMATH OpenOpenAlexFDO

Authors Florian Bourse, Olivier Sanders, Jacques Traoré

Publication date 5 August 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40186-3_17

zbMATH Keywords

Millionaires' problempartially homomorphic encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Homomorphic encryption and secure comparison
• Practical and Secure Solutions for Integer Comparison
• Efficient homomorphic comparison methods with optimal complexity
• Non-interactive and fully output expressive private comparison
• Sub-linear, secure comparison with two non-colluding parties

Cited in

(14)

• scientific article; zbMATH DE number 5787842 (Why is no real title available?)
• \textsf{ComBo}: a novel functional bootstrapping method for efficient evaluation of nonlinear functions in the encrypted domain
• Practical and Secure Solutions for Integer Comparison
• Discretization error reduction for high precision torus fully homomorphic encryption
• Parameter optimization and larger precision for (T)FHE
• Fast secure comparison for medium-sized integers and its application in binarized neural networks
• Efficient and Secure Comparison for On-Line Auctions
• Numerical method for comparison on homomorphically encrypted numbers
• Large-precision homomorphic sign evaluation using FHEW/TFHE bootstrapping
• Threshold properties of prime power subgroups with application to secure integer comparisons
• Efficient homomorphic comparison methods with optimal complexity
• Encrypted integer division and secure comparison
• Non-interactive and fully output expressive private comparison
• Homomorphic encryption and secure comparison

This page was built for publication: Improved secure integer comparison via homomorphic encryption

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