Valiant’s Universal Circuit is Practical

DOI10.1007/978-3-662-49890-3_27zbMath1385.94049OpenAlexW2483852738MaRDI QIDQ2820504

Thomas Schneider, Ágnes Kiss

Publication date: 9 September 2016

Published in: Advances in Cryptology – EUROCRYPT 2016 (Search for Journal in Brave)

Full work available at URL: https://encrypto.de/papers/KS16.pdf

zbMATH Keywords

private function evaluationuniversal circuitsize-optimization

Mathematics Subject Classification ID

Cryptography (94A60) Analytic circuit theory (94C05)

Related Items (12)

Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Practical attacks against the walnut digital signature scheme ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Efficient and scalable universal circuits ⋮ \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication ⋮ Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free ⋮ \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation ⋮ Masked triples. Amortizing multiplication triples across conditionals ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Hashing Garbled Circuits for Free ⋮ Zero-knowledge proofs for committed symmetric Boolean functions

This page was built for publication: Valiant’s Universal Circuit is Practical