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
Oblivious transfer and polynomial evaluation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A fast string searching algorithm
Communications of the ACM
Efficient oblivious transfer protocols
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Foundations of Cryptography: Basic Tools
Foundations of Cryptography: Basic Tools
Zero Knowledge Proofs of Knowledge in Two Rounds
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th 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
Foundations of Secure Interactive Computing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
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
How to generate and exchange secrets
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Public-key cryptosystems based on composite degree residuosity classes
EUROCRYPT'99 Proceedings of the 17th 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
Keyword search and oblivious pseudorandom functions
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
Constructions of truly practical secure protocols using standardsmartcards
Proceedings of the 15th ACM conference on Computer and communications security
Secure Arithmetic Computation with No Honest Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
Privacy-Preserving Policy-Based Information Transfer
PETS '09 Proceedings of the 9th International Symposium on Privacy Enhancing Technologies
GUC-Secure Set-Intersection Computation
ProvSec '09 Proceedings of the 3rd International Conference on Provable Security
Cryptographically Secure Bloom-Filters
Transactions on Data Privacy
Secure text processing with applications to private DNA matching
Proceedings of the 17th ACM conference on Computer and communications security
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
Privacy-preserving group discovery with linear complexity
ACNS'10 Proceedings of the 8th international conference on Applied cryptography and network security
Privacy-preserving pattern matching for anomaly detection in RFID anti-counterfeiting
RFIDSec'10 Proceedings of the 6th international conference on Radio frequency identification: security and privacy issues
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 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
Privacy-preserving applications on smartphones
HotSec'11 Proceedings of the 6th USENIX conference on Hot topics in 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
Countering GATTACA: efficient and secure testing of fully-sequenced human genomes
Proceedings of the 18th ACM conference on Computer and communications security
Non-interactive opening for ciphertexts encrypted by shared keys
ICICS'11 Proceedings of the 13th international conference on Information and communications security
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
Text search protocols with simulation based security
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Constructing verifiable random functions with large input spaces
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
GUC-Secure join operator in distributed relational database
ICICS'09 Proceedings of the 11th international conference on Information and Communications Security
Efficient secure computation with garbled circuits
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
Mutual private set intersection with linear complexity
WISA'11 Proceedings of the 12th international conference on Information Security Applications
An efficient protocol for oblivious DFA evaluation and applications
CT-RSA'12 Proceedings of the 12th conference on Topics in Cryptology
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
Outsourced private set intersection using homomorphic encryption
Proceedings of the 7th ACM Symposium on Information, Computer and Communications Security
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Calling out cheaters: covert security with public verifiability
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information 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
Secure genomic testing with size- and position-hiding private substring matching
Proceedings of the 12th ACM workshop on Workshop on privacy in the electronic society
Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications
Proceedings of the 29th Annual Computer Security Applications Conference
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 |
In this paper we construct efficient secure protocols for set intersection and pattern matching. Our protocols for securely computing the set intersection functionality are based on secure pseudorandom function evaluations, in contrast to previous protocols that used secure polynomial evaluation. In addition to the above, we also use secure pseudorandom function evaluation in order to achieve secure pattern matching. In this case, we utilize specific properties of the Naor-Reingold pseudorandom function in order to achieve high efficiency. Our results are presented in two adversary models. Our protocol for secure pattern matching and one of our protocols for set intersection achieve security against malicious adversaries under a relaxed definition where one corruption case is simulatable and for the other only privacy (formalized through indistinguishability) is guaranteed. We also present a protocol for set intersection that is fully simulatable in the model of covert adversaries. Loosely speaking, this means that a malicious adversary can cheat, but will then be caught with good probability.