Pages that link to "Item:Q2055668"
From MaRDI portal
The following pages link to Stacked garbling for disjunctive zero-knowledge proofs (Q2055668):
Displayed 16 items.
- \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)
- TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures (Q2117059) (← links)
- Threshold Schnorr with stateless deterministic signing from standard assumptions (Q2120070) (← 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)
- Zero-knowledge IOPs with linear-time prover and polylogarithmic-time verifier (Q2170049) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- \texttt{MOTIF}: (almost) free branching in GMW. Via vector-scalar multiplication (Q2691578) (← links)
- PrORAM (Q6041295) (← links)
- Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions (Q6061364) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- Efficient proofs of knowledge for threshold relations (Q6109456) (← links)
- NanoGRAM: garbled RAM with \(\widetilde{O}(\log N)\) overhead (Q6138098) (← links)
- Garbling, stacked and staggered. Faster \(k\)-out-of-\(n\) garbled function evaluation (Q6157518) (← links)