Pairing-based functional commitments for circuits with shorter parameters
From MaRDI portal
Cites work
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- An algebraic framework for Diffie-Hellman assumptions
- Boosting batch arguments and RAM delegation
- Chainable functional commitments for unbounded-depth circuits
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Fully-succinct multi-key homomorphic signatures from standard assumptions
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Functional commitments and SNARGs for P/poly from SIS
- Functional commitments for all functions, with transparent setup and from SIS
- How to delegate computations publicly
- How to prove false statements: practical attacks on Fiat-Shamir
- Lattice-based functional commitments: fast verification and cryptanalysis
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Leveled fully homomorphic signatures from standard lattices
- Non-interactive batch arguments for NP from standard assumptions
- Reducing the CRS size in registered ABE systems
- Separating succinct non-interactive arguments from all falsifiable assumptions
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Subvector commitments with application to succinct arguments
- Succinct functional commitment for a large class of arithmetic circuits
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Succinct vector, polynomial, and functional commitments from lattices
- The Uber-Assumption Family
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Zero-Knowledge Sets with Short Proofs
This page was built for publication: Pairing-based functional commitments for circuits with shorter parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363465)
