Lattice-based functional commitments: fast verification and cryptanalysis
From MaRDI portal
Publication:6604929
DOI10.1007/978-981-99-8733-7_7zbMATH Open1547.9443MaRDI QIDQ6604929FDOQ6604929
Authors: Hoeteck Wee, David J. Wu 
Publication date: 13 September 2024
Recommendations
- Functional commitments for all functions, with transparent setup and from SIS
- Succinct vector, polynomial, and functional commitments from lattices
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Functional commitments for arbitrary circuits of bounded sizes
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
Cites Work
- Title not available (Why is that?)
- Streaming authenticated data structures
- Leveled fully homomorphic signatures from standard lattices
- Attribute-based encryption for circuits
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Computationally Sound Proofs
- Succinct non-interactive arguments via linear interactive proofs
- Quadratic span programs and succinct NIZKs without PCPs
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Concise mercurial vector commitments and independent zero-knowledge sets with short proofs
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- How to delegate computations publicly
- Subvector commitments with application to succinct arguments
- Functional commitment schemes: from polynomial commitments to pairing-based accumulators from simple assumptions
- Vector commitments and their applications
- Private constrained PRFs (and more) from LWE
- On the size of pairing-based non-interactive arguments
- Predicate encryption for circuits from LWE
- Succinct arguments from multi-prover interactive proofs and their efficiency benefits
- Delegating RAM Computations
- Constant-Size Commitments to Polynomials and Their Applications
- Succinct vector, polynomial, and functional commitments from lattices
- Constrained key-homomorphic PRFs from standard lattice assumptions. Or: how to secretly embed a circuit in your PRF
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Multi-authority ABE from lattices without random oracles
- Aggregatable subvector commitments for stateless cryptocurrencies
- Witness encryption and null-iO from evasive LWE
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions
- Incrementally aggregatable vector commitments and applications to verifiable decentralized storage
- Succinct functional commitment for a large class of arithmetic circuits
- KVaC: key-value commitments for blockchains and beyond
- Somewhere statistical soundness, post-quantum security, and SNARGs
- Vector and functional commitments from lattices
- Functional commitments for all functions, with transparent setup and from SIS
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- 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
Cited In (9)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Succinct vector, polynomial, and functional commitments from lattices
- 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
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Greyhound: fast polynomial commitments from lattices
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)
