Multi-party threshold private set intersection with sublinear communication
From MaRDI portal
Publication:2061962
DOI10.1007/978-3-030-75248-4_13zbMath1479.94006OpenAlexW3031333860MaRDI QIDQ2061962
Peter Rindal, Saikrishna Badrinarayanan, Peihan Miao, Srinivasan Raghuraman
Publication date: 21 December 2021
Full work available at URL: https://doi.org/10.1007/978-3-030-75248-4_13
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Communication theory (94A05)
Related Items
Multi-party updatable delegated private set intersection ⋮ Hiding the input-size in multi-party private set intersection ⋮ Threshold private set intersection with better communication complexity ⋮ Multiparty cardinality testing for threshold private intersection
Cites Work
- Unnamed Item
- A local decision test for sparse polynomials
- Efficient circuit-based PSI via cuckoo hashing
- Threshold cryptosystems from threshold fully homomorphic encryption
- Multiparty cardinality testing for threshold private intersection
- Two-sided malicious security for private intersection-sum with cardinality
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Output compression, MPC, and iO for Turing machines
- An algebraic approach to maliciously secure private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
- The communication complexity of threshold private set intersection
- Computationally private randomizing polynomials and their applications
- Joint encryption and message-efficient secure computation
- On Information Complexity in the Broadcast Model
- Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- Set reconciliation with nearly optimal communication complexity
- Secure Linear Algebra Using Linearly Recurrent Sequences
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Fast solution of toeplitz systems of equations and computation of Padé approximants
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Advances in Cryptology - EUROCRYPT 2004
- Privacy-Preserving Set Operations
- Scalable Multi-party Private Set-Intersection
- Improved Private Set Intersection Against Malicious Adversaries
