Valiant's universal circuits revisited: an overall improvement and a lower bound

DOI10.1007/978-3-030-34578-5_15zbMath1456.94124OpenAlexW2991366706MaRDI QIDQ2181888

Yu Yu, Hanlin Liu, Jiang Zhang, Shuoyao Zhao

Publication date: 20 May 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34578-5_15

zbMATH Keywords

private function evaluationdesign of optimal supernodes

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Cryptography (94A60) Analytic circuit theory (94C05)

Related Items (9)

Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact ⋮ Improved zero-knowledge argument of encrypted extended permutation ⋮ Making Private Function Evaluation Safer, Faster, and Simpler ⋮ Efficient and scalable universal circuits ⋮ Count me in! Extendability for threshold ring signatures ⋮ \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 ⋮ Blind polynomial evaluation and data trading

This page was built for publication: Valiant's universal circuits revisited: an overall improvement and a lower bound