Verifiable private equality test: enabling unbiased 2-party reconciliation on ordered sets in the malicious model

Authors:
Daniel A. Mayer;Susanne Wetzel
Affiliations:
Stevens Institute of Technology, Hoboken, New Jersey;Stevens Institute of Technology, Hoboken, New Jersey
Venue:
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Year:
2012

Citing 11
Cited 0

Comparing information without leaking it

Communications of the ACM
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Information sharing across private databases

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Privacy-Preserving Data Mining: Models and Algorithms

Privacy-Preserving Data Mining: Models and Algorithms
Privacy-preserving data mining in the malicious model

International Journal of Information and Computer Security
Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Efficient Robust Private Set Intersection

ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Multiparty computation for interval, equality, and comparison without bit-decomposition protocol

PKC'07 Proceedings of the 10th international conference on Practice and theory in public-key cryptography
Privacy-preserving data mining in presence of covert adversaries

ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Practical private set intersection protocols with linear complexity

FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient set operations in the presence of malicious adversaries

PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we introduce the novel notion called Verifiable Private Equality Test (VPET) and propose an efficient 2-party protocol for its implementation. VPET enables two parties to securely perform an arbitrary number of comparisons on a fixed collection of (key, value) pairs and thus it is more generic than existing techniques such as Private Equality Test and Private Set Intersection. In addition, we demonstrate how higher-level protocols such as Privacy-Preserving Reconciliation on Ordered Sets (PROS) can be implemented using VPET. Using simulation-based techniques, our new protocols are proven secure in the malicious model. Furthermore, we present a theoretical complexity analysis as well as a thorough experimental performance evaluation of the C++ implementation of our new VPET and PROS protocols.