Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
From MaRDI portal
Cites work
- A Pseudorandom Generator from any One-way Function
- Advances in Cryptology - EUROCRYPT 2004
- Chainable functional commitments for unbounded-depth circuits
- Concise Mercurial Subvector Commitments: Definitions and Constructions
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Functional commitments for all functions, with transparent setup and from SIS
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- 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
- Mercurial commitments with applications to zero-knowledge sets
- Mercurial Commitments with Applications to Zero-Knowledge Sets
- Subvector commitments with application to succinct arguments
- Succinct vector, polynomial, and functional commitments from lattices
- Theory of Cryptography
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Updatable Zero-Knowledge Databases
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Zero-knowledge elementary databases with more expressive queries
This page was built for publication: Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899414)
