Lattice-based functional commitments: fast verification and cryptanalysis
From MaRDI portal
Publication:6604929
DOI10.1007/978-981-99-8733-7_7zbMATH Open1547.9443MaRDI QIDQ6604929
Publication date: 13 September 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Private constrained PRFs (and more) from LWE
- Aggregatable subvector commitments for stateless cryptocurrencies
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Subvector commitments with application to succinct arguments
- 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
- Somewhere statistical soundness, post-quantum security, and SNARGs
- 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
- Delegating RAM Computations
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
- Predicate Encryption for Circuits from LWE
- Computationally Sound Proofs
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Vector Commitments and Their Applications
- Streaming Authenticated Data Structures
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- How to delegate computations publicly
- Constrained Key-Homomorphic PRFs from Standard Lattice Assumptions
- Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Attribute-based encryption for circuits
- On the Size of Pairing-Based Non-interactive Arguments
- 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)
- Multi-authority ABE from lattices without random oracles
- Witness encryption and null-iO from evasive LWE
- Candidate witness encryption from lattice techniques
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Boosting batch arguments and RAM delegation
Related Items (8)
Lattice-based polynomial commitments: towards asymptotic and concrete efficiency ⋮ Succinct functional commitments for circuits from \(k\)-\textsf{Lin} ⋮ SLAP: succinct lattice-based polynomial commitments from standard assumptions ⋮ Aggregating Falcon signatures with LaBRADOR ⋮ Functional commitments for arbitrary circuits of bounded sizes ⋮ Fully-succinct multi-key homomorphic signatures from standard assumptions ⋮ Greyhound: fast polynomial commitments from lattices ⋮ Concretely efficient lattice-based polynomial commitment from standard assumptions
This page was built for publication: Lattice-based functional commitments: fast verification and cryptanalysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6604929)
