Algebraic reductions of knowledge
From MaRDI portal
Publication:6190126
DOI10.1007/978-3-031-38551-3_21OpenAlexW4385654030MaRDI QIDQ6190126
Abhiram Kothapalli, Bryan Parno
Publication date: 6 February 2024
Published in: Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-38551-3_21
Cites Work
- Unnamed Item
- The algebraic group model and its applications
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- Spartan: efficient and general-purpose zkSNARKs without trusted setup
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Proof-carrying data without succinct arguments
- Sumcheck arguments and their applications
- An algebraic framework for universal and updatable SNARKs
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again
- Interactive Oracle Proofs
- Structure-Preserving Signatures and Commitments to Group Elements
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Algebraic methods for interactive proof systems
- The knowledge complexity of interactive proof-systems
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Computational Complexity
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
- Recursive composition and bootstrapping for SNARKS and proof-carrying data
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures
- \(\mathcal{Lunar}\): a toolbox for more efficient universal and updatable zkSNARKs and commit-and-prove extensions
- Proofs for inner pairing products and applications
- Nova: recursive zero-knowledge arguments from folding schemes
- Linear-map vector commitments and their practical applications
This page was built for publication: Algebraic reductions of knowledge
