A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
From MaRDI portal
Publication:2942846
DOI10.1007/978-3-319-15943-0_21zbMATH Open1344.94043OpenAlexW793944516MaRDI QIDQ2942846FDOQ2942846
Authors: Sumit Kumar Debnath, Ratna Dutta
Publication date: 11 September 2015
Published in: Information Security and Cryptology - ICISC 2014 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-15943-0_21
Recommendations
- Private set intersection in the internet setting from lightweight oblivious PRF
- New realizations of efficient and secure private set intersection protocols preserving fairness
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- An algebraic approach to maliciously secure private set intersection
- Efficient circuit-based PSI with linear communication
Cites Work
- Title not available (Why is that?)
- Security and composition of multiparty cryptographic protocols
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Private intersection of certified sets
- Title not available (Why is that?)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Title not available (Why is that?)
- Privacy-Preserving Set Operations
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - CRYPTO 2003
Cited In (4)
- Provably secure fair mutual private set intersection cardinality utilizing Bloom filter
- New realizations of efficient and secure private set intersection protocols preserving fairness
- Private set operations from oblivious switching
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
This page was built for publication: A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942846)