Functional commitments for arbitrary circuits of bounded sizes

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
A hierarchy of polynomial time lattice basis reduction algorithms
Factoring polynomials with rational coefficients
Transparent SNARKs from DARK compilers
\textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
Subvector commitments with application to succinct arguments
Succinct functional commitment for a large class of arithmetic circuits
Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
Vector and functional commitments from lattices
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
Leveled Fully Homomorphic Signatures from Standard Lattices
Constant-Size Commitments to Polynomials and Their Applications
Delegating Computation
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Trapdoors for hard lattices and new cryptographic constructions
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
A Pseudorandom Generator from any One-way Function
Algebraic methods for interactive proof systems
Signatures of Correct Computation
Vector Commitments and Their Applications
A sieve algorithm for the shortest lattice vector problem
Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Functional commitments for all functions, with transparent setup and from SIS
Succinct vector, polynomial, and functional commitments from lattices
Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
Additive-homomorphic functional commitments and applications to homomorphic signatures
Lattice-based functional commitments: fast verification and cryptanalysis

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)