Efficient set operations in the presence of malicious adversaries
From MaRDI portal
Publication:434343
DOI10.1007/s00145-011-9098-xzbMath1272.94034OpenAlexW2167485997WikidataQ59379655 ScholiaQ59379655MaRDI QIDQ434343
Publication date: 10 July 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-011-9098-x
set intersectionconstant-round protocolsmalicious partiesoblivious pseudorandom function evaluation protocolsecure two-party protocolsset union
Related Items (8)
Automata evaluation and text search protocols with simulation-based security ⋮ Rate-limited secure function evaluation ⋮ Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters ⋮ Zero-Knowledge Accumulators and Set Algebra ⋮ Quantum secure two-party computation for set intersection with rational players ⋮ Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs ⋮ Scalable Multi-party Private Set-Intersection ⋮ Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Probabilistic encryption
- How to construct constant-round zero-knowledge proof systems for NP
- Security and composition of multiparty cryptographic protocols
- Secure multiparty computation of approximations
- A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
- Number-theoretic constructions of efficient pseudo-random functions
- How asymmetry helps load balancing
- Security Against Covert Adversaries: Efficient Protocols for Realistic Adversaries
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Efficient Secure Linear Algebra in the Presence of Covert or Computationally Unbounded Adversaries
- A Framework for Efficient and Composable Oblivious Transfer
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Private Intersection of Certified Sets
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Balanced Allocations
- Foundations of Cryptography
- Foundations of Cryptography
- Communication preserving protocols for secure function evaluation
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privacy-Preserving Set Operations
- Theory of Cryptography
- Theory of Cryptography
- Theory of Cryptography
- Privacy preserving data mining
This page was built for publication: Efficient set operations in the presence of malicious adversaries
