Functional commitments for arbitrary circuits of bounded sizes
From MaRDI portal
Recommendations
- Chainable functional commitments for unbounded-depth circuits
- Succinct functional commitment for a large class of arithmetic circuits
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Lattice-based functional commitments: fast verification and cryptanalysis
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
Cites work
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- A hierarchy of polynomial time lattice basis reduction algorithms
- A Pseudorandom Generator from any One-way Function
- A sieve algorithm for the shortest lattice vector problem
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Algebraic methods for interactive proof systems
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Delegating computation: interactive proofs for muggles
- Factoring polynomials with rational coefficients
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- 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
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- 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
- Signatures of correct computation
- 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
- Transparent SNARKs from DARK compilers
- 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
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(2)
This page was built for publication: Functional commitments for arbitrary circuits of bounded sizes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6651898)
