Private set intersection in the internet setting from lightweight oblivious PRF
From MaRDI portal
Publication:2102052
DOI10.1007/978-3-030-56877-1_2zbMATH Open1504.94118OpenAlexW3037145554MaRDI QIDQ2102052FDOQ2102052
Authors: Melissa Chase, Peihan Miao 
Publication date: 7 December 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56877-1_2
Recommendations
- SpOT-light: lightweight private set intersection from sparse OT extension
- Efficient circuit-based PSI with linear communication
- Private set intersection: new generic constructions and feasibility results
- Linear-complexity private set intersection protocols secure in malicious model
- Faster unbalanced private set intersection
Cites Work
- Advances in Cryptology - EUROCRYPT 2004
- Oblivious transfer and polynomial evaluation
- (If) size matters: size-hiding private set intersection
- Cuckoo hashing
- Theory of Cryptography
- The security of the cipher block chaining message authentication code
- Advances in Cryptology - CRYPTO 2003
- Linear-complexity private set intersection protocols secure in malicious model
- Improved OT extension for transferring short secrets
- Efficient circuit-based PSI via cuckoo hashing
- An algebraic approach to maliciously secure private set intersection
- PSI from PaXoS: fast, malicious private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
- Improved private set intersection against malicious adversaries
Cited In (44)
- Hiding the input-size in multi-party private set intersection
- Finding one common item, privately
- Private set intersection: new generic constructions and feasibility results
- Multi-party updatable delegated private set intersection
- SE-PSI: fog/cloud server-aided enhanced secure and effective private set intersection on scalable datasets with Bloom Filter
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Private polynomial commitments and applications to MPC
- Polynomial representation is tricky: maliciously secure private set intersection revisited
- Privacy-preserving blueprints
- An algebraic approach to maliciously secure private set intersection
- (If) size matters: size-hiding private set intersection
- Malicious secure, structure-aware private set intersection
- Private computations on set intersection
- Improved circuit-based PSI via equality preserving compression
- Nothing refreshes like a RePSI: reactive private set intersection
- Linear Complexity Private Set Intersection for Secure Two-Party Protocols
- Faster unbalanced private set intersection
- Private set-intersection with common set-up
- Improved private set intersection for sets with small entries
- Predicate private set intersection with linear complexity
- VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
- A fair and efficient mutual private set intersection protocol from a two-way oblivious pseudorandom function
- Efficient circuit-based PSI with linear communication
- Private set operations from multi-query reverse private membership test
- Fuzzy private set intersection with large hyperballs
- Lower-bounds on public-key operations in PIR
- Combining private set intersection with secure two-party computation
- PSI from PaXoS: fast, malicious private set intersection
- Multi-party threshold private set intersection with sublinear communication
- Private set operations from oblivious switching
- Bounded size-hiding private set intersection
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Two-sided malicious security for private intersection-sum with cardinality
- SpOT-light: lightweight private set intersection from sparse OT extension
- Oblivious key-value stores and amplification for private set intersection
- Scalable private set union from symmetric-key techniques
- Adaptively code-correlation robustness functions and its applications to private set intersection
- Structure-aware private set intersection, with applications to fuzzy matching
- Amortizing rate-1 OT and applications to PIR and PSI
- Computation efficient structure-aware PSI from incremental function secret sharing
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Streaming and unbalanced PSI from function secret sharing
- Element distinctness and bounded input size in private set intersection and related protocols
- PSI-stats: private set intersection protocols supporting secure statistical functions
This page was built for publication: Private set intersection in the internet setting from lightweight oblivious PRF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2102052)
