Garbling, stacked and staggered. Faster k-out-of-n garbled function evaluation

DOI10.1007/978-3-030-92075-3_9MaRDI QIDQ6157518zbMATH OpenOpenAlexFDO

Authors David G. Heath, Vladimir Kolesnikov, Stanislav Peceny

Publication date 12 May 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-92075-3_9

zbMATH Keywords

conditional branchinggarbled circuitstacked garbling

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Garbled circuits with sublinear evaluator
• Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
• Hashing garbled circuits for free
• Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
• Improved Garbled Circuit: Free XOR Gates and Applications

Cites work

• \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions
• \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication
• Advances in Cryptology - CRYPTO 2003
• Amortizing Garbled Circuits
• Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
• Flexor: Flexible garbling for XOR gates that beats free-XOR
• Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free
• Improved Garbled Circuit: Free XOR Gates and Applications
• Masked triples. Amortizing multiplication triples across conditionals
• On the security of the ``Free-XOR technique
• Overlaying conditional circuit clauses for secure computation
• Private Policy Negotiation
• Stacked garbling for disjunctive zero-knowledge proofs
• Stacked garbling. Garbled circuit proportional to longest execution path
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
• Two halves make a whole: reducing data transfer in garbled circuits using half gates

Cited in

(4)

• Garbled circuits with sublinear evaluator
• Secure multiparty computation with free branching
• Efficient proofs of knowledge for threshold relations
• Compact proofs of partial knowledge for overlapping CNF formulae

This page was built for publication: Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation

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