Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries

DOI10.1007/978-3-319-26059-4_18zbMath1388.94050OpenAlexW2296131078MaRDI QIDQ3464406

Ratna Dutta, Sumit Kumar Debnath

Publication date: 27 January 2016

Published in: Provable Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-26059-4_18

zbMATH Keywords

malicious adversarysemi-honest adversaryBloom filterPSIPSI-CA

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Secure and efficient multiparty private set intersection cardinality

This page was built for publication: Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries