Secure and efficient private set intersection cardinality using Bloom filter

DOI10.1007/978-3-319-23318-5_12zbMath1397.94058OpenAlexW1866535025MaRDI QIDQ1799244

Ratna Dutta, Sumit Kumar Debnath

Publication date: 18 October 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-23318-5_12

zbMATH Keywords

privacymalicious adversarysemi-honest adversaryBloom filter(A)PSI(A)PSI-CA

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (12)

SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter ⋮ Attribute-based fine-grained access control for outscored private set intersection computation ⋮ Efficient private set intersection cardinality protocol in the reverse unbalanced setting ⋮ Quantum solution to a class of two-party private summation problems ⋮ Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter ⋮ New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness ⋮ Quantum protocols for private set intersection cardinality and union cardinality based on entanglement swapping ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Quantum private set intersection cardinality and its application to anonymous authentication ⋮ Server-aided private set intersection based on reputation ⋮ Private set operations from oblivious switching ⋮ Two-sided malicious security for private intersection-sum with cardinality

This page was built for publication: Secure and efficient private set intersection cardinality using Bloom filter