Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Implementing Database Security and Auditing: Includes Examples for Oracle, SQL Server, DB2 UDB, Sybase
Secure set intersection cardinality with application to association rule mining
Journal of Computer Security
An Unconditionally Secure Protocol for Multi-Party Set Intersection
ACNS '07 Proceedings of the 5th 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
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
Distributed private matching and set operations
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Perfectly-secure MPC with linear communication complexity
TCC'08 Proceedings of the 5th conference on Theory of cryptography
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
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
Fair and privacy-preserving multi-party protocols for reconciling ordered input sets
ISC'10 Proceedings of the 13th international conference on Information security
Design and implementation of privacy-preserving reconciliation protocols
Proceedings of the Joint EDBT/ICDT 2013 Workshops
| Hi-index | 0.00 |
In this paper, we focus on the specific problems of Private Matching, Set Disjointness and Cardinality of Set Intersection in information theoretic settings. Specifically, we give perfectly secure protocols for the above problems in n party settings, tolerating a computationally unbounded semi-honest adversary, who can passively corrupt at most t n /2 parties. To the best of our knowledge, these are the first such information theoretically secure protocols in a multi-party setting for all the three problems. Previous solutions for Distributed Private Matching and Cardinality of Set Intersection were cryptographically secure and the previous Set Disjointness solution, though information theoretically secure, is in a two party setting. We also propose a new model for Distributed Private matching which is relevant in a multi-party setting.