Functional commitments and SNARGs for P/poly from SIS
From MaRDI portal
Cites work
- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Almost optimal KP and CP-ABE for circuits from succinct LWE
- Boosting batch arguments and RAM delegation
- Chainable functional commitments for unbounded-depth circuits
- Correlation intractability and SNARGs from sub-exponential DDH
- Delegation with updatable unambiguous proofs and PPAD-hardness
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Fully-succinct publicly verifiable delegation from constant-size assumptions
- Functional commitments for all functions, with transparent setup and from SIS
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- How to delegate computations publicly
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Lattice-based functional commitments: fast verification and cryptanalysis
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Leveled fully homomorphic signatures from standard lattices
- Private constrained PRFs (and more) from LWE
- Shorter pairing-based arguments under standard assumptions
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- SNARGs for \(\mathcal{P}\) from LWE
- SNARGs for bounded depth computations and PPAD hardness from sub-exponential LWE
- Subvector commitments with application to succinct arguments
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Succinct vector, polynomial, and functional commitments from lattices
- Trapdoors for lattices: simpler, tighter, faster, smaller
This page was built for publication: Functional commitments and SNARGs for P/poly from SIS
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6866556)
