Scalable multi-party private set-intersection
From MaRDI portal
Recommendations
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Multi-party threshold private set intersection with sublinear communication
- Linear-complexity private set intersection protocols secure in malicious model
- Advances in Cryptology - EUROCRYPT 2004
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 4191111 (Why is no real title available?)
- scientific article; zbMATH DE number 176545 (Why is no real title available?)
- scientific article; zbMATH DE number 176562 (Why is no real title available?)
- scientific article; zbMATH DE number 1301967 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- (If) size matters: size-hiding private set intersection
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Balanced Allocations
- Computationally secure pattern matching in the presence of malicious adversaries
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient RSA key generation and threshold Paillier in the two-party setting
- Efficient and secure generalized pattern matching via Fast Fourier Transform
- Efficient constant round multi-party computation combining BMR and SPDZ
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
- Efficient set intersection with simulation-based security
- Efficient set operations in the presence of malicious adversaries
- Efficient three-party computation from cut-and-choose
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Fast garbling of circuits under standard assumptions
- Fast secure computation of set intersection
- Founding Cryptography on Oblivious Transfer – Efficiently
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- How asymmetry helps load balancing
- Linear-complexity private set intersection protocols secure in malicious model
- MiniLEGO: efficient secure two-party computation from general assumptions
- More efficient constant-round multi-party computation from BMR and SHE
- Multiparty Computation from Somewhat Homomorphic Encryption
- New directions in cryptography
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs
- On the Non-malleability of the Fiat-Shamir Transform
- Privacy-Preserving Set Operations
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Secure computation from millionaire
- Secure computation on the web: computing without simultaneous interaction
- Semi-homomorphic encryption and multiparty computation
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- The IPS compiler: optimizations, variants and concrete efficiency
- Theory of Cryptography
- Theory of Cryptography
- Zero-knowledge argument for polynomial evaluation with application to blacklists
Cited in
(29)- Hiding the input-size in multi-party private set intersection
- An efficient toolkit for computing third-party private set intersection
- How to meet big data when private set intersection realizes constant communication complexity
- Advances in Cryptology - EUROCRYPT 2004
- Efficient set intersection with simulation-based security
- An Unconditionally Secure Protocol for Multi-Party Set Intersection
- Information Theoretically Secure Multi Party Set Intersection Re-visited
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- The communication complexity of threshold private set intersection
- MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
- Feasible private set intersection in quantum domain
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Unconditionally secure multiparty computation for symmetric functions with low bottleneck complexity
- Secure and efficient multiparty private set intersection cardinality
- Private polynomial commitments and applications to MPC
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- Efficient robust private set intersection
- Private set-intersection with common set-up
- Constant-Round Multi-party Private Set Union Using Reversed Laurent Series
- Efficient scalable multiparty private set-intersection via garbled Bloom filters
- Fast secure computations on shared polynomials and applications to private set operations
- Multiparty cardinality testing for threshold private intersection
- Multi-party threshold private set intersection with sublinear communication
- Server-aided private set intersection based on reputation
- Oblivious key-value stores and amplification for private set intersection
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Laconic private set intersection and applications
- Mixed-technique multi-party computations composed of two-party computations
- Threshold private set intersection with better communication complexity
This page was built for publication: Scalable multi-party private set-intersection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5738787)
