Pages that link to "Item:Q2139630"
From MaRDI portal
The following pages link to \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions (Q2139630):
Displaying 11 items.
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions (Q2170057) (← links)
- Sok: vector OLE-based zero-knowledge protocols (Q6063131) (← links)
- \textsf{ReSolveD}: shorter signatures from regular syndrome decoding and VOLE-in-the-head (Q6635752) (← links)
- Toward malicious constant-rate 2PC via arithmetic garbling (Q6637552) (← links)
- The hardness of LPN over any integer ring and field for PCG applications (Q6637566) (← links)
- Succinct homomorphic secret sharing (Q6637573) (← links)
- CDS composition of multi-round protocols (Q6653053) (← links)
- More efficient zero-knowledge protocols over \(\mathbb{Z}_{2^k}\) via Galois rings (Q6653054) (← links)
- Compact proofs of partial knowledge for overlapping CNF formulae (Q6655872) (← links)
- An efficient ZK compiler from SIMD circuits to general circuits (Q6655875) (← links)
