A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function

DOI10.1007/978-3-319-15943-0_21MaRDI QIDQ2942846zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

fairnessPSImalicious adversaryoptimisticsemi-honest adversary\(\mathsf{mPSI}\)\(\mathsf{OPRF}\)

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1302835 (Why is no real title available?)
• scientific article; zbMATH DE number 708820 (Why is no real title available?)
• Advances in Cryptology - CRYPTO 2003
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Privacy-Preserving Set Operations
• Private intersection of certified sets
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Security and composition of multiparty cryptographic protocols
• Theory of Cryptography

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)