Privacy-preserving data mining
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
A verifiable secret shuffle and its application to e-voting
CCS '01 Proceedings of the 8th ACM conference on Computer and Communications Security
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
An Efficient Scheme for Proving a Shuffle
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Secure set intersection cardinality with application to association rule mining
Journal of Computer Security
Two methods for privacy preserving data mining with malicious participants
Information Sciences: an International Journal
Privacy preserving data mining of sequential patterns for network traffic data
Information Sciences: an International Journal
Privacy Preserving Set Intersection Protocol Secure against Malicious Behaviors
PDCAT '07 Proceedings of the Eighth International Conference on Parallel and Distributed Computing, Applications and Technologies
Privacy preserving set intersection based on bilinear groups
ACSC '08 Proceedings of the thirty-first Australasian conference on Computer science - Volume 74
An Unconditionally Secure Protocol for Multi-Party Set Intersection
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
ACNS '07 Proceedings of the 5th international conference on Applied Cryptography and Network Security
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
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
Efficient and secure protocols for privacy-preserving set operations
ACM Transactions on Information and System Security (TISSEC)
How to break a practical MIX and design a new one
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Distributed private matching and set operations
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
Privacy-preserving data mining: A feature set partitioning approach
Information Sciences: an International Journal
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
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Editorial: Guest editorial: Special issue on data mining for information security
Information Sciences: an International Journal
The Journal of Supercomputing
| Hi-index | 0.07 |
Privacy-preserving set operations such as set union and set intersection on distributed sets are widely used in data mining in which the preservation of privacy is of the utmost concern. In this paper, we extended privacy-preserving set operations and considered privacy-preserving disjunctive normal form (DNF) operations on distributed sets. A privacy-preserving DNF operation on distributed sets can be used to find a set S"F satisfying S"F=(S"1","1@?...@?S"1","t"""2)@?...@?(S"t"""1","1@?...@?S"t"""1","t"""2) without revealing any other information besides just the information which could be inferred from the DNF operations, where S"i","j@?{A"1,...,A"n,A"1@?,...,A"n@?} and set A"k is known only to a party P"k. A complement set A"k@? is defined as A"k@?=(A"1@?...@?A"n)-A"k. Using privacy-preserving DNF operations on distributed sets, it is possible to find set union, (threshold) set intersection, and a set of k-repeated elements.