Mutual private set intersection with linear complexity

Authors:
Myungsun Kim;Hyung Tae Lee;Jung Hee Cheon
Affiliations:
ISaC & Dept. of Mathematical Sciences, Seoul National University, Seoul, Gwangak-gu, Korea;ISaC & Dept. of Mathematical Sciences, Seoul National University, Seoul, Gwangak-gu, Korea;ISaC & Dept. of Mathematical Sciences, Seoul National University, Seoul, Gwangak-gu, Korea
Venue:
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Year:
2011

Citing 17
Cited 0

A public key cryptosystem and a signature scheme based on discrete logarithms

Proceedings of CRYPTO 84 on Advances in cryptology
Oblivious transfer and polynomial evaluation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Multiparty Computation from Threshold Homomorphic Encryption

EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
A Generalisation, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System

PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Information sharing across private databases

Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Foundations of Cryptography: Volume 2, Basic Applications

Foundations of Cryptography: Volume 2, Basic Applications
Efficient Protocols for Set Membership and Range Proofs

ASIACRYPT '08 Proceedings of the 14th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
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
Private Intersection of Certified Sets

Financial Cryptography and Data Security
Privacy-Preserving Relationship Path Discovery in Social Networks

CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Public-key cryptosystems based on composite degree residuosity classes

EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Practical threshold signatures

EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries

TCC'08 Proceedings of the 5th conference on Theory of cryptography
Privacy-preserving set operations

CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
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

A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protocol enables all players to get the desired result. In this work, we construct a mutual PSI protocol that is significantly more efficient than the state-of-the-art in the computation overhead. To the best of our knowledge, our construction is the first result with linear computational complexity in the semi-honest model. For that, we come up with an efficient data representation technique, called prime representation.