Abstract
Protocols for securely testing the equality of two encrypted integers are common building blocks for a number of proposals in the literature that aim for privacy preservation. Being used repeatedly in many cryptographic protocols, designing efficient equality testing protocols is important in terms of computation and communication overhead. In this work, we consider a scenario with two parties where party A has two integers encrypted using an additively homomorphic scheme and party B has the decryption key. Party A would like to obtain an encrypted bit that shows whether the integers are equal or not but nothing more. We propose three secure equality testing protocols, which are more efficient in terms of communication, computation or both compared to the existing work. To support our claims, we present experimental results, which show that our protocols achieve up to 99% computation-wise improvement compared to the state-of-the-art protocols in a fair experimental set-up
Original language | English |
---|---|
Title of host publication | ARES 2018 |
Subtitle of host publication | Proceedings of the 13th International Conference on Availability, Reliability and Security |
Place of Publication | New York, NY |
Publisher | Association for Computing Machinery (ACM) |
Pages | 1-10 |
Number of pages | 10 |
ISBN (Print) | 978-1-4503-6448-5 |
DOIs | |
Publication status | Published - 2018 |
Event | ARES 2018: 13th International Conference on Availability, Reliability and Security - Hamburg, Germany Duration: 27 Aug 2018 → 30 Aug 2018 Conference number: 13 https://www.ares-conference.eu/conference/ |
Conference
Conference | ARES 2018 |
---|---|
Country/Territory | Germany |
City | Hamburg |
Period | 27/08/18 → 30/08/18 |
Internet address |
Keywords
- Processing encrypted data
- equality test
- homomorphic encryption
- privacy
- efficiency