VOLE-PSI: fast OPRF and circuit-PSI from vector-OLE

DOI10.1007/978-3-030-77886-6_31MaRDI QIDQ2056777zbMATH OpenOpenAlexFDO

Authors Peter Rindal, Phillipp Schoppmann

Publication date 8 December 2021

Full work available at URL https://doi.org/10.1007/978-3-030-77886-6_31

zbMATH Keywords

private set intersectionbatched oblivious pseudorandom functionPaXoS data structure

Mathematics Subject Classification ID

Cryptography (94A60)

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

• scientific article; zbMATH DE number 1418291 (Why is no real title available?)
• 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
• Improved private set intersection against malicious adversaries
• Linear Time Encoding of LDPC Codes
• Linear-complexity private set intersection protocols secure in malicious model
• PSI from PaXoS: fast, malicious private set intersection
• Private set intersection in the internet setting from lightweight oblivious PRF
• Secure arithmetic computation with constant computational overhead
• SpOT-light: lightweight private set intersection from sparse OT extension

Cited in

(21)

• Hiding the input-size in multi-party private set intersection
• The hardness of LPN over any integer ring and field for PCG applications
• Silver: silent VOLE and oblivious transfer from hardness of decoding structured LDPC codes
• MPCCache: privacy-preserving multi-party cooperative cache sharing at the edge
• Correlated pseudorandomness from expand-accumulate codes
• Scalable multi-party private set union from multi-query secret-shared private membership test
• Half-tree: halving the cost of tree expansion in COT and DPF
• Malicious secure, structure-aware private set intersection
• Improved circuit-based PSI via equality preserving compression
• Improved private set intersection for sets with small entries
• Efficient circuit-based PSI with linear communication
• Short signatures from regular syndrome decoding in the head
• 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
• Oblivious key-value stores and amplification for private set intersection
• Maliciously Secure Multi-party PSI with Lower Bandwidth and Faster Computation
• Structure-aware private set intersection, with applications to fuzzy matching
• Computation efficient structure-aware PSI from incremental function secret sharing
• Practical and malicious private set intersection with improved efficiency
• Element distinctness and bounded input size in private set intersection and related protocols

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)