A randomized protocol for signing contracts
Communications of the ACM
A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Fast Algorithms for Mining Association Rules in Large Databases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Privacy Preserving Data Mining
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Privacy preserving mining of association rules
Information Systems - Knowledge discovery and data mining (KDD 2002)
Privacy-Preserving Distributed Mining of Association Rules on Horizontally Partitioned Data
IEEE Transactions on Knowledge and Data Engineering
Data Mining: Concepts and Techniques
Data Mining: Concepts and Techniques
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Digital Design and Computer Architecture
Digital Design and Computer Architecture
Privacy-preserving collaborative association rule mining
Journal of Network and Computer Applications
Maintaining data privacy in association rule mining
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
Secure two-party k-means clustering
Proceedings of the 14th ACM conference on Computer and communications security
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Digital Principles and Logic Design
Digital Principles and Logic Design
Fully homomorphic encryption using ideal lattices
Proceedings of the forty-first annual ACM symposium on Theory of computing
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Implementing Gentry's fully-homomorphic encryption scheme
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Knowledge hiding from tree and graph databases
Data & Knowledge Engineering
Arbitrarily distributed data-based recommendations with privacy
Data & Knowledge Engineering
Fully homomorphic encryption with relatively small key and ciphertext sizes
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Fully homomorphic encryption over the integers
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
Association rule mining (ARM) is one of the popular data mining methods that discover interesting correlations amongst a large collection of data, which appears incomprehensible. This is known to be a trivial task when the data is owned by one party. But when multiple data sites collectively engage in ARM, privacy concerns are introduced. Due to this concern, privacy preserving data mining algorithms have been developed to attain the desired result, while maintaining privacy. In the case of two party privacy preserving ARM for horizontally partitioned databases, both parties are required to compare their itemset counts securely. This problem is comparable to the famous millionaire problem of Yao. However, in this paper, we propose a secure comparison technique using fully homomorphic encryption scheme that provides a similar level of security to the Yao based solution, but promotes greater efficiency due to the reuse of resources.