Garbled protocols and two-round MPC from bilinear maps

DOI10.1109/FOCS.2017.60MaRDI QIDQ6946326zbMATH OpenFDO

Authors Sanjam Garg, Akshayaram Srinivasan

Publication date 6 August 2025

Full work available at URL https://doi.org/10.1109/FOCS.2017.60

Mathematics Subject Classification ID

Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cited in

(5)

• A framework for witness encryption from linearly verifiable SNARKs and applications
• On the relationship between public key primitives via indifferentiability
• Secure computation with parallel calls to 2-ary functions
• Extractable witness encryption for KZG commitments and efficient laconic OT
• Succinct garbled circuits with low-depth garbling algorithms

This page was built for publication: Garbled protocols and two-round MPC from bilinear maps

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