Overlaying conditional circuit clauses for secure computation

DOI10.1007/978-3-319-70697-9_18MaRDI QIDQ1703937zbMATH OpenOpenAlexFDO

Authors W. Sean Kennedy, Vladimir Kolesnikov, Gordon Wilfong

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

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

Recommendations

• Constant-overhead secure computation of Boolean circuits using preprocessing
• On compiling Boolean circuits optimized for secure multi-party computation
• Circuits resilient to additive attacks with applications to secure computation
• Threshold garbled circuits and ad hoc secure computation
• MArBLed circuits: mixing arithmetic and Boolean circuits with active security
• Obfuscation of probabilistic circuits and applications

Cited in

(10)

• Efficient and scalable universal circuits
• Practical attacks against the walnut digital signature scheme
• Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation
• Garbled circuits with sublinear evaluator
• \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
• Stacked garbling. Garbled circuit proportional to longest execution path
• Garbled circuit lookup tables with logarithmic number of ciphertexts
• Hashing garbled circuits for free
• \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

This page was built for publication: Overlaying conditional circuit clauses for secure computation

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