Functional commitments for all functions, with transparent setup and from SIS
From MaRDI portal
Publication:6063522
Recommendations
- scientific article; zbMATH DE number 4081344
- On the means for centralized systems of functions
- A Formal Implementation of Value Commitment
- Universal composability from essentially any trusted setup
- Commitment and observability in a contracting environment
- Functional completion
- Incentive compatible mechanisms with full transferability
- Commitment and authentication systems
Cites work
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- A Depth-Universal Circuit
- Additive-homomorphic functional commitments and applications to homomorphic signatures
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Constant-Size Commitments to Polynomials and Their Applications
- Dory: efficient, transparent arguments for generalised inner products and polynomial commitments
- Faster Bootstrapping with Polynomial Error
- FHE circuit privacy almost for free
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Generalized Compact Knapsacks Are Collision Resistant
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- 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 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1759660 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- KVaC: key-value commitments for blockchains and beyond
- Lattice-based FHE as secure as PKE
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Leveled fully homomorphic signatures from standard lattices
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- On lattices, learning with errors, random linear codes, and cryptography
- Predicate encryption for circuits from LWE
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Signatures of correct computation
- Streaming authenticated data structures
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Succinct functional commitment for a large class of arithmetic circuits
- Theory of Cryptography
- Transparent SNARKs from DARK compilers
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Updatable Zero-Knowledge Databases
- Vector and functional commitments from lattices
- Vector commitments and their applications
- Verifiable delegation of computation over large datasets
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge for homomorphic key-value commitments with applications to privacy-preserving ledgers
Cited in
(25)- Succinct vector, polynomial, and functional commitments from lattices
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Chainable functional commitments for unbounded-depth circuits
- Cuckoo commitments: registration-based encryption and key-value map commitments for large spaces
- Lattice-based functional commitments: fast verification and cryptanalysis
- Efficient secure storage with version control and key rotation
- Updatable, aggregatable, succinct mercurial vector commitment from lattice
- Vector commitments with proofs of smallness: short range proofs and more
- Oblivious accumulators
- Witness encryption for succinct functional commitments and applications
- Fully homomorphic encryption beyond IND-CCA1 security: integrity through verifiability
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Functional commitments for arbitrary circuits of bounded sizes
- FRIDA: data availability sampling from FRI
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Greyhound: fast polynomial commitments from lattices
- Universal vector commitments
- Functional commitments and SNARGs for P/poly from SIS
- Polynomial commitments for Galois rings and applications to SNARKs over \(\mathbb{Z}_{2^k}\)
- New techniques for preimage sampling: improved NIZKs and more from LWE
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Lattice-based succinct mercurial functional commitment for Boolean circuits: definitions, and constructions
- Pairing-based functional commitments for circuits with shorter parameters
- Lattice-based accumulator and application to anonymous credential revocation
This page was built for publication: Functional commitments for all functions, with transparent setup and from SIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6063522)
