How to make rational arguments practical and extractable
From MaRDI portal
Cites work
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- \textsf{ECLIPSE}: enhanced compiling method for Pedersen-committed zkSNARK engines
- \textsf{Testudo}: linear time prover SNARKs with constant size proofs and square root size universal setup
- Advances in cryptology -- ASIACRYPT 2021. 27th international conference on the theory and application of cryptology and information security, Singapore, December 6--10, 2021. Proceedings. Part III
- An algebraic framework for universal and updatable SNARKs
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Efficient rational proofs for space bounded computations
- Fine-grained secure computation
- How to delegate computations
- Interactive proofs of proximity: delegating computation in sublinear time
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- On the size of pairing-based non-interactive arguments
- Quadratic span programs and succinct NIZKs without PCPs
- Rational arguments: single round delegation with sublinear verification
- Rational proofs
- Rational sumchecks
- Sequentially composable rational proofs
- Snarks for C: verifying program executions succinctly and in zero knowledge
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Witness encryption and its applications
This page was built for publication: How to make rational arguments practical and extractable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7318565)
