Scalable Multi-party Private Set-Intersection
From MaRDI portal
Publication:5738787
DOI10.1007/978-3-662-54365-8_8zbMath1404.94080OpenAlexW2585287165MaRDI QIDQ5738787
Muthuramakrishnan Venkitasubramaniam, Carmit Hazay
Publication date: 13 June 2017
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-54365-8_8
Related Items (11)
Oblivious key-value stores and amplification for private set intersection ⋮ Polynomial representation is tricky: maliciously secure private set intersection revisited ⋮ MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge ⋮ Hiding the input-size in multi-party private set intersection ⋮ Private polynomial commitments and applications to MPC ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Feasible private set intersection in quantum domain ⋮ Laconic private set intersection and applications ⋮ Secure and efficient multiparty private set intersection cardinality ⋮ Multiparty cardinality testing for threshold private intersection ⋮ Multi-party threshold private set intersection with sublinear communication
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Efficient set intersection with simulation-based security
- Fast cut-and-choose-based protocols for malicious and covert adversaries
- Efficient set operations in the presence of malicious adversaries
- Fast garbling of circuits under standard assumptions
- Secure Computation from Millionaire
- Efficient Three-Party Computation from Cut-and-Choose
- On the Non-malleability of the Fiat-Shamir Transform
- Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting
- Multiparty Computation from Somewhat Homomorphic Encryption
- Semi-homomorphic Encryption and Multiparty Computation
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform
- Computationally Secure Pattern Matching in the Presence of Malicious Adversaries
- Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
- (If) Size Matters: Size-Hiding Private Set Intersection
- More Efficient Constant-Round Multi-party Computation from BMR and SHE
- How asymmetry helps load balancing
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Fast Secure Computation of Set Intersection
- Founding Cryptography on Oblivious Transfer – Efficiently
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- A public key cryptosystem and a signature scheme based on discrete logarithms
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- New directions in cryptography
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Balanced Allocations
- MiniLEGO: Efficient Secure Two-Party Computation from General Assumptions
- Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists
- Secure Computation on the Web: Computing without Simultaneous Interaction
- The IPS Compiler: Optimizations, Variants and Concrete Efficiency
- Oblivious Polynomial Evaluation and Secure Set-Intersection from Algebraic PRFs
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Privacy-Preserving Set Operations
- Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
- Theory of Cryptography
- Theory of Cryptography
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries
This page was built for publication: Scalable Multi-party Private Set-Intersection
