Succinct vector, polynomial, and functional commitments from lattices
From MaRDI portal
Publication:6063525
DOI10.1007/978-3-031-30620-4_13zbMath1528.94084MaRDI QIDQ6063525
Publication date: 12 December 2023
Published in: Advances in Cryptology – EUROCRYPT 2023 (Search for Journal in Brave)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Compact multi-signatures for smaller blockchains
- Transparent SNARKs from DARK compilers
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
- Aggregatable subvector commitments for stateless cryptocurrencies
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- Subvector commitments with application to succinct arguments
- Batching techniques for accumulators with applications to IOPs and stateless blockchains
- 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
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Constant-Size Commitments to Polynomials and Their Applications
- Collision-Free Hashing from Lattice Problems
- Interactive Oracle Proofs
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Security Analysis of the Strong Diffie-Hellman Problem
- Computationally Sound Proofs
- Vector Commitments and Their Applications
- Streaming Authenticated Data Structures
- Verifiable Delegation of Computation over Large Datasets
- Fiat-Shamir: from practice to theory
- Generating Shorter Bases for Hard Random Lattices
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Advances in Cryptology - CRYPTO 2003
- Zero-Knowledge Sets with Short Proofs
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
This page was built for publication: Succinct vector, polynomial, and functional commitments from lattices
