Composable oblivious pseudo-random functions via garbled circuits

DOI10.1007/978-3-031-44469-2_13MaRDI QIDQ6619935zbMATH OpenFDO

Authors Sebastian H. Faller, Astrid Ottenhues, Johannes Ottenhues

Publication date 16 October 2024

Full work available at URL https://doi.org/10.1007/978-3-031-44469-2_13

zbMATH Keywords

garbled circuitsoblivious pseudo-random functionpost-quantum cryptographyuniversal composability

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Recommendations

• A post-quantum round-optimal oblivious PRF from isogenies
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Oblivious pseudorandom functions from isogenies
• Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection

Cites work

• Advances in Cryptology - CRYPTO 2003
• An efficient key recovery attack on SIDH
• An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries
• Cryptanalysis of an oblivious PRF from supersingular isogenies
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Exploring crypto dark matter: new simple PRF candidates and their applications
• scientific article; zbMATH DE number 1942416 (Why is no real title available?)
• scientific article; zbMATH DE number 4187706 (Why is no real title available?)
• Improved Garbled Circuit: Free XOR Gates and Applications
• MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
• Oblivious pseudorandom functions from isogenies
• OPAQUE: an asymmetric PAKE protocol secure against pre-computation attacks
• Random oracles in a quantum world
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Secure two-party computation in a quantum world
• Secure two-party computation is practical
• The simplest protocol for oblivious transfer
• Theory of Cryptography
• Two halves make a whole: reducing data transfer in garbled circuits using half gates
• Two-round oblivious transfer from CDH or LPN

Cited in

(6)

• A post-quantum round-optimal oblivious PRF from isogenies
• Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
• Latke: a framework for constructing identity-binding PAKEs
• The 2Hash OPRF framework and efficient post-quantum instantiations
• \textsc{Leap}: a fast, lattice-based OPRF with application to private set intersection
• Verifiable oblivious pseudorandom functions from lattices: practical-ish and thresholdisable

This page was built for publication: Composable oblivious pseudo-random functions via garbled circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6619935)