Efficient private set intersection cardinality protocol in the reverse unbalanced setting

DOI10.1007/978-3-031-22390-7_2zbMath1527.68060MaRDI QIDQ6111980

Hanyu Li, Unnamed Author

Publication date: 4 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

private information retrievalprivate set intersection cardinalitycuckoo filterhash-prefix filterreverse unbalanced scenario

Mathematics Subject Classification ID

Cryptography (94A60) Privacy of data (68P27)

Cites Work

• Unnamed Item
• Efficient set intersection with simulation-based security
• Secure and efficient private set intersection cardinality using Bloom filter
• An efficient toolkit for computing private set operations
• Two-sided malicious security for private intersection-sum with cardinality
• Quantum private set intersection cardinality and its application to anonymous authentication
• Faster unbalanced private set intersection
• \textsf{Catalic}: delegated PSI cardinality with applications to contact tracing
• Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter
• Privately Computing Set-Union and Set-Intersection Cardinality via Bloom Filters
• Private Intersection of Certified Sets
• Cuckoo hashing
• A Scalable and Efficient Privacy Preserving Global Itemset Support Approximation Using Bloom Filters
• Advances in Cryptology - EUROCRYPT 2004

This page was built for publication: Efficient private set intersection cardinality protocol in the reverse unbalanced setting