More efficient universal circuit constructions

DOI10.1007/978-3-319-70697-9_16zbMath1409.94877OpenAlexW2769337162MaRDI QIDQ1703934

Thomas Schneider, Daniel Günther, Ágnes Kiss

Publication date: 8 March 2018

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

zbMATH Keywords

private function evaluationfunction hidinguniversal circuit

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

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 ⋮ 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