Chainable functional commitments for unbounded-depth circuits
From MaRDI portal
Recommendations
- Functional commitments for arbitrary circuits of bounded sizes
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Functional commitments for all functions, with transparent setup and from SIS
Cites work
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- An algebraic framework for Diffie-Hellman assumptions
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Functional commitments for all functions, with transparent setup and from SIS
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Homomorphic signatures for polynomial functions
- Homomorphic signatures with efficient verification for polynomial functions
- scientific article; zbMATH DE number 5485522 (Why is no real title available?)
- scientific article; zbMATH DE number 2079932 (Why is no real title available?)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Leveled fully homomorphic signatures from standard lattices
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Shorter pairing-based arguments under standard assumptions
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Subvector commitments with application to succinct arguments
- Succinct functional commitment for a large class of arithmetic circuits
- Succinct vector, polynomial, and functional commitments from lattices
- The kernel matrix Diffie-Hellman assumption
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Zero-Knowledge Sets with Short Proofs
Cited in
(18)- 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}
- Functional commitments for arbitrary circuits of bounded sizes
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- FRIDA: data availability sampling from FRI
- Greyhound: fast polynomial commitments from lattices
- Functional commitments and SNARGs for P/poly from SIS
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials
- Distributed broadcast encryption from lattices
- SNARK lower bounds via communication complexity
- Anonymous reputation systems with revocation, revisited
- Lattice-based multi-key homomorphic signatures forward-unforgeable against signing key leakage
- Pairing-based functional commitments for circuits with shorter parameters
- Multi-hop multi-key homomorphic signatures with context hiding from standard assumptions
This page was built for publication: Chainable functional commitments for unbounded-depth circuits
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582224)
