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
Fundamentals of Computer Security
Fundamentals of Computer Security
On the Security of ElGamal Based Encryption
PKC '98 Proceedings of the First International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Privacy-Preserving Distributed Set Intersection
ARES '08 Proceedings of the 2008 Third International Conference on Availability, Reliability and 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
Efficient protocols for privacy preserving matching against distributed datasets
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Testing disjointness of private datasets
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Private itemset support counting
ICICS'05 Proceedings of the 7th international conference on Information and Communications Security
Honest-verifier private disjointness testing without random oracles
PET'06 Proceedings of the 6th international conference on Privacy Enhancing Technologies
Syntax-Driven private evaluation of quantified membership queries
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Efficient Disjointness Tests for Private Datasets
ACISP '08 Proceedings of the 13th Australasian conference on Information Security and Privacy
Unconditionally secure disjointness tests for private datasets
International Journal of Applied Cryptography
CANS '09 Proceedings of the 8th International Conference on Cryptology and Network Security
Privacy-preserving disjunctive normal form operations on distributed sets
Information Sciences: an International Journal
| Hi-index | 0.00 |
Motivated by the need of private set operations in a distributed environment, we extend the two-party private matching problem proposed by Freedman, Nissim and Pinkas (FNP) at Eurocrypt'04 to the distributed setting. By using a secret sharing scheme, we provide a distributed solution of the FNP private matching called the distributed private matching. In our distributed private matching scheme, we use a polynomial to represent one party's dataset as in FNP and then distribute the polynomial to multiple servers. We extend our solution to the distributed set intersection and the cardinality of the intersection, and further we show how to apply the distributed private matching in order to compute distributed subset relation. Our work extends the primitives of private matching and set intersection by Freedman et al. Our distributed construction might be of great value when the dataset is outsourced and its privacy is the main concern. In such cases, our distributed solutions keep the utility of those set operations while the dataset privacy is not compromised. Comparing with previous works, we achieve a more efficient solution in terms of computation. All protocols constructed in this paper are provably secure against a semi-honest adversary under the Decisional Diffie-Hellman assumption.