Overlaying conditional circuit clauses for secure computation

DOI10.1007/978-3-319-70697-9_18zbMath1417.94067OpenAlexW2770826492MaRDI QIDQ1703937

Vladimir Kolesnikov, Gordon Wilfong, W. Sean Kennedy

Publication date: 8 March 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-70697-9_18

zbMATH Keywords

secure computationgarbled circuitGMWset-universal circuit

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items

Practical attacks against the walnut digital signature scheme ⋮ Garbled circuits with sublinear evaluator ⋮ Efficient and scalable universal circuits ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ \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 ⋮ Stacked garbling. Garbled circuit proportional to longest execution path ⋮ Hashing Garbled Circuits for Free