Robust efficient distributed RSA-key generation
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Efficient generation of shared RSA keys
Journal of the ACM (JACM)
Executing SQL over encrypted data in the database-service-provider model
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Providing Database as a Service
ICDE '02 Proceedings of the 18th International Conference on Data Engineering
Practical Techniques for Searches on Encrypted Data
SP '00 Proceedings of the 2000 IEEE Symposium on Security and Privacy
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Introduction to Data Mining, (First Edition)
Introduction to Data Mining, (First Edition)
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Database Systems: The Complete Book
Database Systems: The Complete Book
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
Secure anonymous database search
Proceedings of the 2009 ACM workshop on Cloud computing 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
Deterministic and efficiently searchable encryption
CRYPTO'07 Proceedings of the 27th annual international cryptology conference on Advances in cryptology
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Non-interactive verifiable computing: outsourcing computation to untrusted workers
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Improved delegation of computation using fully homomorphic encryption
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
On the impossibility of cryptography alone for privacy-preserving cloud computing
HotSec'10 Proceedings of the 5th USENIX conference on Hot topics in security
(If) size matters: size-hiding private set intersection
PKC'11 Proceedings of the 14th international conference on Practice and theory in public key cryptography conference on Public key cryptography
Efficient techniques for privacy-preserving sharing of sensitive information
TRUST'11 Proceedings of the 4th international conference on Trust and trustworthy computing
Keyword search and oblivious pseudorandom functions
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Evaluating 2-DNF formulas on ciphertexts
TCC'05 Proceedings of the Second international conference on Theory of Cryptography
Privacy-preserving set operations
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Practical private set intersection protocols with linear complexity
FC'10 Proceedings of the 14th international conference on Financial Cryptography and Data Security
Efficient set operations in the presence of malicious adversaries
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Searching over encrypted data in cloud systems
Proceedings of the 18th ACM symposium on Access control models and technologies
| Hi-index | 0.00 |
Set intersection is a building block for many data analysis techniques, e.g. in data mining. Private set intersection enables to compute the set intersection without revealing the non-matching items. The advent of cloud computing drives the desire to outsource such computations, but without the need to trust the service provider. Homomorphic encryption enables secure, outsourced computations, but in case of multiple clients cannot prevent collusion. In this paper we present non-interactive, encrypted computation of the set intersection using an untrusted service provider. Two or more clients submit their encrypted sets to the service provider which facilitates the computation of their intersection. The service provider either learns the intersection or remains completely obvious to both input and output - including the intersection's size. We prove our protocols secure in the random oracle model and under the RSA assumption. Our prototypical implementation shows the difference between the protocols using different cryptographic techniques and that even a fully untrusted service provider can be practically feasible.