Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter

DOI10.1007/978-3-319-54705-3_31zbMath1404.94062OpenAlexW2594025093MaRDI QIDQ2980879

Ratna Dutta, Sumit Kumar Debnath

Publication date: 5 May 2017

Published in: Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-54705-3_31

zbMATH Keywords

fairnessmalicious adversaryBloom filtermPSI-CAsemi-trusted arbiter

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Secure and efficient multiparty private set intersection cardinality

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient set intersection with simulation-based security
• Secure and efficient private set intersection cardinality using Bloom filter
• A Fair and Efficient Mutual Private Set Intersection Protocol from a Two-Way Oblivious Pseudorandom Function
• Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries
• Private Intersection of Certified Sets
• Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
• Advances in Cryptology - CRYPTO 2003
• Privacy-Preserving Set Operations
• Space/time trade-offs in hash coding with allowable errors
• Information Security and Cryptology - ICISC 2005

This page was built for publication: Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter