Vector and functional commitments from lattices
From MaRDI portal
Publication:2697903
DOI10.1007/978-3-030-90456-2_16OpenAlexW3201715140MaRDI QIDQ2697903
Zachary Pepin, Chad Sharp, Chris Peikert
Publication date: 13 April 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90456-2_16
Related Items (8)
Functional commitments for all functions, with transparent setup and from SIS ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ On the impossibility of algebraic vector commitments in pairing-free groups ⋮ Inner product functional commitments with constant-size public parameters and openings ⋮ Additive-homomorphic functional commitments and applications to homomorphic signatures ⋮ PointProofs, revisited
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bonsai trees, or how to delegate a lattice basis
- Transparent SNARKs from DARK compilers
- Aggregatable subvector commitments for stateless cryptocurrencies
- Noninteractive zero knowledge for NP from (Plain) Learning With Errors
- 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
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Faster Bootstrapping with Polynomial Error
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- Leveled Fully Homomorphic Signatures from Standard Lattices
- Verifiable Functional Encryption
- Lattice-based FHE as secure as PKE
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Constant-Size Commitments to Polynomials and Their Applications
- Lossy Trapdoor Functions and Their Applications
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Trapdoors for hard lattices and new cryptographic constructions
- Efficient Lattice (H)IBE in the Standard Model
- Vector Commitments and Their Applications
- Improved (Hierarchical) Inner-Product Encryption from Lattices
- Streaming Authenticated Data Structures
- Verifiable Delegation of Computation over Large Datasets
- Zero-Knowledge Sets With Short Proofs
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Updatable Zero-Knowledge Databases
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Adaptively Secure Identity-Based Encryption from Lattices with Asymptotically Shorter Public Parameters
This page was built for publication: Vector and functional commitments from lattices
