Secure and efficient multiparty private set intersection cardinality
type: Item
instance of: scholarly article
title: Secure and efficient multiparty private set intersection cardinality
zbMATH Open document ID: 1464.94033
author: Sumit Kumar Debnath
author: Pantelimon Stanica
author: Nibedita Kundu
author: Tanmay Choudhury
published in: Advances in Mathematics of Communications
publication date: 2021-05-12T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68M12
Mathematics Subject Classification ID: 68P30
zbMATH DE Number: 7347780
zbMATH Keywords: MPSI-CA
zbMATH Keywords: MPSI
zbMATH Keywords: semi-honest adversary
zbMATH Keywords: flexibility
zbMATH Keywords: Bloom filter
MaRDI profile type: Publication
full work available at URL: amc.2020071
OpenAlex ID: W3016138846
cites work: Space/time trade-offs in hash coding with allowable errors
cites work: Q3840150
cites work: On the false-positive rate of Bloom filters
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4364567
cites work: Private Intersection of Certified Sets
cites work: Nothing refreshes like a RePSI: reactive private set intersection
cites work: Security and cryptography for networks. 11th international conference, SCN 2018, Amalfi, Italy, September 5--7, 2018. Proceedings
cites work: An efficient toolkit for computing private set operations
cites work: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
cites work: Efficient Private Set Intersection Cardinality in the Presence of Malicious Adversaries
cites work: Secure and efficient private set intersection cardinality using Bloom filter
cites work: How to meet big data when private set intersection realizes constant communication complexity
cites work: New Realizations of Efficient and Secure Private Set Intersection Protocols Preserving Fairness
cites work: Provably Secure Fair Mutual Private Set Intersection Cardinality Utilizing Bloom Filter
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Probabilistic counting algorithms for data base applications
cites work: Efficient set intersection with simulation-based security
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Foundations of Cryptography
cites work: Probabilistic encryption
cites work: Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
cites work: Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries
cites work: Efficient Set Operations in the Presence of Malicious Adversaries
cites work: Scalable Multi-party Private Set-Intersection
cites work: Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
cites work: Fast Secure Computation of Set Intersection
cites work: Privacy-Preserving Set Operations
cites work: Quantum private set intersection cardinality and its application to anonymous authentication
DOI: 10.3934/AMC.2020071
description: scientific article; zbMATH DE number 7347780