VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
From MaRDI portal
Publication:2056777
Recommendations
- Efficient circuit-based PSI with linear communication
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- An algebraic approach to maliciously secure private set intersection
- SpOT-light: lightweight private set intersection from sparse OT extension
Cites work
- Actively secure 1-out-of-N OT extension with application to private set intersection
- Advances in Cryptology - CRYPTO 2003
- Combining private set intersection with secure two-party computation
- Efficient circuit-based PSI via cuckoo hashing
- Efficient circuit-based PSI with linear communication
- Fast modular transforms
- scientific article; zbMATH DE number 1418291 (Why is no real title available?)
- Improved private set intersection against malicious adversaries
- Linear Time Encoding of LDPC Codes
- Linear-complexity private set intersection protocols secure in malicious model
- Private set intersection in the internet setting from lightweight oblivious PRF
- PSI from PaXoS: fast, malicious private set intersection
- Secure arithmetic computation with constant computational overhead
- SpOT-light: lightweight private set intersection from sparse OT extension
Cited in
(36)- Oblivious key-value stores and amplification for private set intersection
- Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
- Efficient circuit-based PSI with linear communication
- MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
- Hiding the input-size in multi-party private set intersection
- Improved private set intersection for sets with small entries
- Short signatures from regular syndrome decoding in the head
- Structure-aware private set intersection, with applications to fuzzy matching
- Practical and malicious private set intersection with improved efficiency
- Correlated pseudorandomness from expand-accumulate codes
- Half-tree: halving the cost of tree expansion in COT and DPF
- Malicious secure, structure-aware private set intersection
- Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
- Element distinctness and bounded input size in private set intersection and related protocols
- Scalable multi-party private set union from multi-query secret-shared private membership test
- Improved circuit-based PSI via equality preserving compression
- New proof systems and an OPRF from CSIDH
- Private set operations from multi-query reverse private membership test
- Fuzzy private set intersection with large hyperballs
- The hardness of LPN over any integer ring and field for PCG applications
- Computation efficient structure-aware PSI from incremental function secret sharing
- Stationary syndrome decoding for improved PCGs
- Fast secure computations on shared polynomials and applications to private set operations
- Fast private set intersection from polynomial multiplication triples
- \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
- An efficient toolkit for computing third-party private set intersection
- Faster signatures from MPC-in-the-head
- Revisiting OKVS-based OPRF and PSI: cryptanalysis and better construction
- Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity
- Efficient fuzzy private set intersection from fuzzy mapping
- New framework for structure-aware PSI from distributed function secret sharing
- Fuzzy private set intersection from VOLE
- Fast pseudorandom correlation functions from sparse LPN
- Pseudorandom correlation functions for garbled circuits
- Updatable private set intersection from symmetric-key techniques
- Amortizing Circuit-PSI in the multiple sender/receiver setting
This page was built for publication: VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2056777)
