STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
Enhancing privacy and trust in electronic communities
Proceedings of the 1st ACM conference on Electronic commerce
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Multiparty Computation from Threshold Homomorphic Encryption
EUROCRYPT '01 Proceedings of the International Conference on the Theory and Application of Cryptographic Techniques: Advances in Cryptology
Making Mix Nets Robust for Electronic Voting by Randomized Partial Checking
Proceedings of the 11th USENIX Security Symposium
Sharing Decryption in the Context of Voting or Lotteries
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
Fault tolerant anonymous channel
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Limiting privacy breaches in privacy preserving data mining
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Reusable anonymous return channels
Proceedings of the 2003 ACM workshop on Privacy in the electronic society
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
Privacy-preserving data linkage protocols
Proceedings of the 2004 ACM workshop on Privacy in the electronic society
Privacy-Preserving Top-k Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Privacy-Preserving graph algorithms in the semi-honest model
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information 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
Constant-round multiparty computation using a black-box pseudorandom generator
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
PBS: Private Bartering Systems
Financial Cryptography and Data Security
Algorithms and theory of computation handbook
Secure and efficient protocols for iris and fingerprint identification
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Privacy-Preserving network aggregation
PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I
Constant-Round multi-party private set union using reversed laurent series
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Size-hiding in private set intersection: existential results and constructions
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Private and oblivious set and multiset operations
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Privacy-preserving disjunctive normal form operations on distributed sets
Information Sciences: an International Journal
Design and implementation of privacy-preserving reconciliation protocols
Proceedings of the Joint EDBT/ICDT 2013 Workshops
| Hi-index | 0.00 |
Recently there has been a significant amount of work on privacy-preserving set operations, including: set intersection [14,6,21,9], testing set disjointness [17], multi-set operations [18], and set union [16,1,18] . In this paper, we introduce novel protocols for privacy- preserving set union in the malicious adversary model. More specifically, each participant inputs a set of values, and at the end of the protocol, each participant learns the items that are in at least one participant's set without learning the frequency of the items or which participant(s) contributed specific items. To our knowledge our protocol is the most efficient privacy-preserving set union protocol for the malicious adversary model to date.