Secure and efficient multiparty private set intersection cardinality
From MaRDI portal
Publication:2025374
DOI10.3934/amc.2020071zbMath1464.94033OpenAlexW3016138846MaRDI QIDQ2025374
Sumit Kumar Debnath, Nibedita Kundu, Pantelimon Stănică, Tanmay Choudhury
Publication date: 12 May 2021
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/amc.2020071
Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Network protocols (68M12)
Related Items (5)
Hiding the input-size in multi-party private set intersection ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion ⋮ Streaming and unbalanced PSI from function secret sharing ⋮ Quantum protocols for private set intersection cardinality and union cardinality based on entanglement swapping
Cites Work
- Unnamed Item
- Unnamed Item
- Efficient set intersection with simulation-based security
- On the false-positive rate of Bloom filters
- Probabilistic encryption
- Probabilistic counting algorithms for data base applications
- Nothing refreshes like a RePSI: reactive private set intersection
- Security and cryptography for networks. 11th international conference, SCN 2018, Amalfi, Italy, September 5--7, 2018. Proceedings
- Secure and efficient private set intersection cardinality using Bloom filter
- How to meet big data when private set intersection realizes constant communication complexity
- An efficient toolkit for computing private set operations
- Quantum private set intersection cardinality and its application to anonymous authentication
- Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter
- New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries
- Efficient Set Operations in the Presence of Malicious Adversaries
- Fast Secure Computation of Set Intersection
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Private Intersection of Certified Sets
- Foundations of Cryptography
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - CRYPTO 2003
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
- Privacy-Preserving Set Operations
- Space/time trade-offs in hash coding with allowable errors
- Scalable Multi-party Private Set-Intersection
This page was built for publication: Secure and efficient multiparty private set intersection cardinality
