Multi-party threshold private set intersection with sublinear communication
type: Item
instance of: scholarly article
title: Multi-party threshold private set intersection with sublinear communication
zbMATH Open document ID: 1479.94006
DOI: 10.1007/978-3-030-75248-4_13
author: Saikrishna Badrinarayanan
author: Peihan Miao
author: Srinivasan Raghuraman
author: Peter Rindal
publication date: 2021-12-21T00:00:00Z
Mathematics Subject Classification ID: 94A05
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 68P25
zbMATH DE Number: 7450211
zbMATH Keywords: communication complexity
zbMATH Keywords: two-party protocol
MaRDI profile type: Publication
full work available at URL: 978-3-030-75248-4 13
OpenAlex ID: W3031333860
cites work: Computationally private randomizing polynomials and their applications
cites work: Multiparty cardinality testing for threshold private intersection
cites work: Output compression, MPC, and iO for Turing machines
cites work: Threshold cryptosystems from threshold fully homomorphic encryption
cites work: Fast solution of toeplitz systems of equations and computation of Padé approximants
cites work: On information complexity in the broadcast model
cites work: Q3149671
cites work: Private set intersection in the internet setting from lightweight oblivious PRF
cites work: Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
cites work: Scalable Multiparty Computation with Nearly Optimal Work and Resilience
cites work: Joint encryption and message-efficient secure computation
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: A local decision test for sparse polynomials
cites work: An algebraic approach to maliciously secure private set intersection
cites work: The communication complexity of threshold private set intersection
cites work: Scalable Multi-party Private Set-Intersection
cites work: On the Communication Complexity of Secure Function Evaluation with Long Output
cites work: Secure Linear Algebra Using Linearly Recurrent Sequences
cites work: Privacy-Preserving Set Operations
cites work: Two-sided malicious security for private intersection-sum with cardinality
cites work: Set reconciliation with nearly optimal communication complexity
cites work: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: SpOT-light: lightweight private set intersection from sparse OT extension
cites work: PSI from PaXoS: fast, malicious private set intersection
cites work: Efficient circuit-based PSI via cuckoo hashing
cites work: Improved Private Set Intersection Against Malicious Adversaries
Recommended article: The communication complexity of threshold private set intersection
Recommended article: Threshold private set intersection with better communication complexity
Recommended article: Practical multi-party private set intersection cardinality and intersection-sum under arbitrary collusion
Recommended article: Scalable Multi-party Private Set-Intersection
Recommended article: Secure and efficient multiparty private set intersection cardinality
Recommended article: Multiparty cardinality testing for threshold private intersection
Recommended article: Linear Complexity Private Set Intersection for Secure Two-Party Protocols
Recommended article: Combining private set intersection with secure two-party computation
description: scientific article; zbMATH DE number 7450211