A public key cryptosystem and a signature scheme based on discrete logarithms
Proceedings of CRYPTO 84 on Advances in cryptology
Comparing information without leaking it
Communications of the ACM
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Communications of the ACM
Direct Minimum-Knowledge Computations
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers
CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Probabilistic encryption & how to play mental poker keeping secret all partial information
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Information sharing across private databases
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Foundations of cryptography: a primer
Foundations and Trends® in Theoretical Computer Science
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Introduction to Modern Cryptography (Chapman & Hall/Crc Cryptography and Network Security Series)
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Private Intersection of Certified Sets
Financial Cryptography and Data 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
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Black-box construction of a non-malleable encryption scheme from any semantically secure one
TCC'08 Proceedings of the 5th conference on Theory of cryptography
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
Collaborative, privacy-preserving data aggregation at scale
PETS'10 Proceedings of the 10th international conference on Privacy enhancing technologies
Fast secure computation of set intersection
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Efficient and secure evaluation of multivariate polynomials and applications
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
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
Lightweight delegated subset test with privacy protection
ISPEC'11 Proceedings of the 7th international conference on Information security practice and experience
Secure efficient multiparty computing of multivariate polynomials and applications
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Private discovery of common social contacts
ACNS'11 Proceedings of the 9th international conference on Applied cryptography and network security
Public-key encrypted bloom filters with applications to supply chain integrity
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
PETS'11 Proceedings of the 11th international conference on Privacy enhancing technologies
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
Protocol to compute polygon intersection in STC model
ICICA'11 Proceedings of the Second international conference on Information Computing and Applications
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
Efficient robust private set intersection
International Journal of Applied Cryptography
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
Size-hiding in private set intersection: existential results and constructions
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
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
Privacy-preserving disjunctive normal form operations on distributed sets
Information Sciences: an International Journal
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 |
Computing Set Intersection privately and efficiently between two mutually mistrusting parties is an important basic procedure in the area of private data mining. Assuring robustness, namely, coping with potentially arbitrarily misbehaving (i.e., malicious) parties, while retaining protocol efficiency (rather than employing costly generic techniques) is an open problem. In this work the first solution to this problem is presented.