Cryptology ePrint Archive: Report 2020/1169

Privacy-preserving greater-than integer comparison without binary decomposition in the malicious model

Sigurd Eskeland

Abstract: Common for the overwhelming majority of privacy-preserving greater-than integer comparison schemes is that cryptographic computations are conducted in a bitwise manner. To ensure secrecy, each bit must be encoded in such a way that nothing is revealed to the opposite party. The most noted disadvantage is that the computational and communication cost of bitwise encoding is at best linear to the number of bits. Also, many proposed schemes have complex designs that may be difficult to implement. Carlton et al. proposed in 2018 an interesting scheme that avoids bitwise decomposition and works on whole integers. A variant was proposed by Bourse et al. in 2019. Despite that the stated adversarial model of these schemes is honest-but-curious users, we show that they are vulnerable to malicious users. Inspired by the two mentioned papers, we propose a novel comparison scheme, which is resistant to malicious users.

Category / Keywords: cryptographic protocols / Millionaires' problem, Secure two-party computation, Privacy protocols

Original Publication (with minor differences): Proceedings of the 17th International Joint Conference on e-Business and Telecommunications, ICETE 2020 - Volume 2: SECRYPT
DOI:
10.5220/0009822403400348

Date: received 24 Sep 2020

Contact author: sigurd eskeland at nr no

Available format(s): PDF | BibTeX Citation

Version: 20200925:185022 (All versions of this report)

Short URL: ia.cr/2020/1169


[ Cryptology ePrint archive ]