A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function

DOI10.1007/978-3-319-15943-0_21zbMath1344.94043OpenAlexW793944516MaRDI QIDQ2942846

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

fairnessmalicious adversarysemi-honest adversaryPSIoptimistic\(\mathsf{mPSI}\)\(\mathsf{OPRF}\)

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness

Cites Work

• 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
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Advances in Cryptology - CRYPTO 2003
• Privacy-Preserving Set Operations
• Theory of Cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function