Succinct functional commitment for a large class of arithmetic circuits
From MaRDI portal
Publication:2691602
DOI10.1007/978-3-030-64840-4_23OpenAlexW3112756597MaRDI QIDQ2691602
Kateryna Pavlyk, Helger Lipmaa
Publication date: 29 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-64840-4_23
Related Items (5)
Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ Vector and functional commitments from lattices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A subversion-resistant SNARK
- Subversion-zero-knowledge SNARKs
- The algebraic group model and its applications
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Subvector commitments with application to succinct arguments
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions
- NIZKs with an Untrusted CRS: Security in the Face of Parameter Subversion
- Constant-Size Commitments to Polynomials and Their Applications
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
- Block-Wise P-Signatures and Non-interactive Anonymous Credentials with Efficient Attributes
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- The Uber-Assumption Family
- Adapting the Weaknesses of the Random Oracle Model to the Generic Group Model
- Signatures of Correct Computation
- Vector Commitments and Their Applications
- Quadratic Span Programs and Succinct NIZKs without PCPs
- On QA-NIZK in the BPK Model
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Déjà Q: Using Dual Systems to Revisit q-Type Assumptions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- On the Size of Pairing-Based Non-interactive Arguments
- Verifiable random functions from non-interactive witness-indistinguishable proofs
This page was built for publication: Succinct functional commitment for a large class of arithmetic circuits
