Paper 2019/427
Improved Secure Integer Comparison via Homomorphic Encryption
Florian Bourse, Olivier Sanders, and Jacques Traoré
Abstract
Secure integer comparison has been one of the first problems introduced in cryptography, both for its simplicity to describe and for its applications. The first formulation of the problem was to enable two parties to compare their inputs without revealing the exact value of those inputs, also called the Millionaires' problem. The recent rise of fully homomorphic encryption has given a new formulation to this problem. In this new setting, one party blindly computes an encryption of the boolean
Metadata
- Available format(s)
-
PDF
- Category
- Cryptographic protocols
- Publication info
- Preprint. MINOR revision.
- Keywords
- secure comparisonhomomorphic encryption
- Contact author(s)
-
Florian Bourse @ ens fr
olivier sanders @ orange com
jacques traore @ orange com - History
- 2019-04-29: revised
- 2019-04-27: received
- See all versions
- Short URL
- https://ia.cr/2019/427
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2019/427, author = {Florian Bourse and Olivier Sanders and Jacques Traoré}, title = {Improved Secure Integer Comparison via Homomorphic Encryption}, howpublished = {Cryptology {ePrint} Archive, Paper 2019/427}, year = {2019}, url = {https://eprint.iacr.org/2019/427} }