Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
From MaRDI portal
Recommendations
- Inner product functional commitments with constant-size public parameters and openings
- Succinct functional commitment for a large class of arithmetic circuits
- Vector and functional commitments from lattices
- Constant-Size Commitments to Polynomials and Their Applications
- Additive-homomorphic functional commitments and applications to homomorphic signatures
Cited in
(44)- Succinct functional commitment for a large class of arithmetic circuits
- KVaC: key-value commitments for blockchains and beyond
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Vector and functional commitments from lattices
- Non-zero inner product encryption with short ciphertexts and private keys
- Zero-Knowledge Accumulators and Set Algebra
- Verifiable functional encryption
- Constant-Size Commitments to Polynomials and Their Applications
- Verifiable Inner Product Encryption Scheme
- UC Updatable Databases and Applications
- Tightly Secure IBE Under Constant-Size Master Public Key
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- \textsf{Dew}: a transparent constant-sized polynomial commitment scheme
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Function-Dependent Commitments for Verifiable Multi-party Computation
- On the impossibility of algebraic vector commitments in pairing-free groups
- Inner product functional commitments with constant-size public parameters and openings
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Linear-map vector commitments and their practical applications
- PointProofs, revisited
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- On the impossibility of algebraic NIZK in pairing-free groups
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Committed private information retrieval
- Chainable functional commitments for unbounded-depth circuits
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based functional commitments: fast verification and cryptanalysis
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- 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
- Certifying private probabilistic mechanisms
- Greyhound: fast polynomial commitments from lattices
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Hybrid zero-knowledge from garbled circuits
- Cryptographic accumulators: new definitions, enhanced security, and delegatable proofs
- Foundations of data availability sampling
- Structure-preserving compressing primitives: vector commitments and accumulators and applications
- Pairing-based functional commitments for circuits with shorter parameters
- A sub-linear lattice-based submatrix commitment scheme
This page was built for publication: Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598166)
