Chainable functional commitments for unbounded-depth circuits
From MaRDI portal
Publication:6582224
DOI10.1007/978-3-031-48621-0_13zbMATH Open1544.94222MaRDI QIDQ6582224
David Balbás, Russell W. F. Lai, Dario Catalano, Dario Fiore
Publication date: 2 August 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Shorter pairing-based arguments under standard assumptions
- Subvector commitments with application to succinct arguments
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Succinct functional commitment for a large class of arithmetic circuits
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Vector and functional commitments from lattices
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- An Algebraic Framework for Diffie-Hellman Assumptions
- Homomorphic Signatures with Efficient Verification for Polynomial Functions
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Leveled Fully Homomorphic Signatures from Standard Lattices
- The Kernel Matrix Diffie-Hellman Assumption
- Homomorphic Signatures for Polynomial Functions
- Constant-Size Commitments to Polynomials and Their Applications
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Vector Commitments and Their Applications
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Zero-Knowledge Sets with Short Proofs
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Additive-homomorphic functional commitments and applications to homomorphic signatures
Related Items (8)
On instantiating unleveled fully-homomorphic signatures from falsifiable assumptions ⋮ Updatable, aggregatable, succinct mercurial vector commitment from lattice ⋮ Vector commitments with proofs of smallness: short range proofs and more ⋮ Witness encryption for succinct functional commitments and applications ⋮ Succinct functional commitments for circuits from \(k\)-\textsf{Lin} ⋮ Fully-succinct multi-key homomorphic signatures from standard assumptions ⋮ FRIDA: data availability sampling from FRI ⋮ Greyhound: fast polynomial commitments from lattices
This page was built for publication: Chainable functional commitments for unbounded-depth circuits
