A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Communication preserving protocols for secure function evaluation
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Efficient Identification and Signatures for Smart Cards
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
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
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
How asymmetry helps load balancing
Journal of the ACM (JACM)
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Secure multiparty computation of approximations
ACM Transactions on Algorithms (TALG)
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
A Framework for Efficient and Composable Oblivious Transfer
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Efficient Robust Private Set Intersection
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network 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
Efficient concurrent zero-knowledge in the auxiliary string model
EUROCRYPT'00 Proceedings of the 19th international conference on Theory and application of cryptographic techniques
Security against covert adversaries: efficient protocols for realistic adversaries
TCC'07 Proceedings of the 4th conference on Theory of cryptography
Secure linear algebra using linearly recurrent sequences
TCC'07 Proceedings of the 4th conference on Theory of cryptography
TCC'08 Proceedings of the 5th conference on Theory of cryptography
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
Communication efficient secure linear algebra
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Proceedings of the first ACM conference on Data and application security and privacy
Efficient privacy-preserving data mining in malicious model
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Privacy-preserving data mining in presence of covert adversaries
ADMA'10 Proceedings of the 6th international conference on Advanced data mining and applications: Part I
Secure set intersection with untrusted hardware tokens
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
(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
Secure two-party computation via cut-and-choose oblivious transfer
TCC'11 Proceedings of the 8th conference on Theory of cryptography
Highly-efficient universally-composable commitments based on the DDH assumption
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Mutual private set intersection with linear complexity
WISA'11 Proceedings of the 12th international conference on Information Security Applications
Fast computation on encrypted polynomials and applications
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
Collusion-resistant outsourcing of private set intersection
Proceedings of the 27th Annual ACM Symposium on Applied Computing
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
Policy-Enhanced private set intersection: sharing information while enforcing privacy policies
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
Experimenting with fast private set intersection
TRUST'12 Proceedings of the 5th international conference on Trust and Trustworthy Computing
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
Outsourced private set intersection using homomorphic encryption
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
When private set intersection meets big data: an efficient and scalable protocol
Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security
Fair private set intersection with a semi-trusted arbiter
DBSec'13 Proceedings of the 27th international conference on Data and Applications Security and Privacy XXVII
| Hi-index | 0.00 |
We revisit the problem of constructing efficient secure two-party protocols for set-intersection and set-union, focusing on the model of malicious parties. Our main results are constant-round protocols that exhibit linear communication and a linear number of exponentiations with simulation based security. In the heart of these constructions is a technique based on a combination of a perfectly hiding commitment and an oblivious pseudorandom function evaluation protocol. Our protocols readily transform into protocols that are UC-secure.