Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries

DOI10.1007/978-3-540-78524-8_10zbMath1162.94367OpenAlexW1544695791MaRDI QIDQ5445504

Carmit Hazay, Yehuda Lindell

Publication date: 5 March 2008

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-78524-8_10

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (26)

An efficient quantum scheme for private set intersection ⋮ Efficient set intersection with simulation-based security ⋮ An Efficient Protocol for Oblivious DFA Evaluation and Applications ⋮ Automata evaluation and text search protocols with simulation-based security ⋮ Rate-limited secure function evaluation ⋮ Secure parameterized pattern matching ⋮ Private set intersection: new generic constructions and feasibility results ⋮ Malicious secure, structure-aware private set intersection ⋮ Decentralized multi-client functional encryption for set intersection with improved efficiency ⋮ Efficient set operations in the presence of malicious adversaries ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ A novel quantum protocol for private set intersection ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ Rate-Limited Secure Function Evaluation: Definitions and Constructions ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Private set-intersection with common set-up ⋮ A communication-efficient private matching scheme in client-server model ⋮ Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries ⋮ PRUB: A privacy protection friend recommendation system based on user behavior ⋮ Secure Set Intersection with Untrusted Hardware Tokens ⋮ Server-aided private set intersection based on reputation ⋮ Computationally secure pattern matching in the presence of malicious adversaries ⋮ Bounded Size-Hiding Private Set Intersection ⋮ Two-sided malicious security for private intersection-sum with cardinality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parallel coin-tossing and constant-round secure two-party computation
• Security and composition of multiparty cryptographic protocols
• Oblivious transfer and polynomial evaluation
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• A fast string searching algorithm
• Number-theoretic constructions of efficient pseudo-random functions
• Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
• Fast Pattern Matching in Strings
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Foundations of Cryptography
• Foundations of Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Privacy-Preserving Set Operations
• Theory of Cryptography

This page was built for publication: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries