Pages that link to "Item:Q1710663"

The following pages link to Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free (Q1710663):

Displaying 9 items.

• Stacked garbling for disjunctive zero-knowledge proofs (Q2055668) (← links)
• \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation (Q2056778) (← links)
• Masked triples. Amortizing multiplication triples across conditionals (Q2061960) (← links)
• Stacked garbling. Garbled circuit proportional to longest execution path (Q2096548) (← links)
• \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630) (← links)
• Garbled circuits with sublinear evaluator (Q2169991) (← links)
• Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
• Efficient and scalable universal circuits (Q2188968) (← links)
• \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)