\texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication

DOI10.1007/978-3-030-64840-4_1OpenAlexW3091375188MaRDI QIDQ2691578

Vladimir Kolesnikov, Stanislav Peceny, David G. Heath

Publication date: 29 March 2023

Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_1

zbMATH Keywords

MPCGMWconditional branching

Mathematics Subject Classification ID

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

Related Items (4)

Secure multiparty computation with free branching ⋮ Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions ⋮ Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation ⋮ Masked triples. Amortizing multiplication triples across conditionals

Uses Software

• TASTY
• GitHub
• EMP-toolkit
• SCiFI

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Size-depth tradeoffs for Boolean formulae
• Overlaying conditional circuit clauses for secure computation
• Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
• Stacked garbling for disjunctive zero-knowledge proofs
• Efficient pseudorandom correlation generators: silent OT extension and more
• Valiant’s Universal Circuit is Practical
• Improved OT Extension for Transferring Short Secrets
• Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces
• A Practical Universal Circuit Construction and Secure Evaluation of Private Functions
• Secure Arithmetic Computation with No Honest Majority
• Universal circuits (Preliminary Report)
• Advances in Cryptology - CRYPTO 2003

This page was built for publication: \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication