Lattice-based succinct arguments from vanishing polynomials (extended abstract)
From MaRDI portal
(Redirected from Publication:6186698)
Recommendations
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Sumcheck arguments and their applications
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
Cites work
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- A compressed \(\varSigma \)-protocol theory for lattices
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
- Linear-size constant-query IOPs for delegating computation
- On the hardness of the NTRU problem
- On the size of pairing-based non-interactive arguments
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Proofs for inner pairing products and applications
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Scalable zero knowledge via cycles of elliptic curves
- Simple verifiable delay functions
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Succinct arguments in the quantum random oracle model
- Succinct vector, polynomial, and functional commitments from lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(25)- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- (Verifiable) delay functions from Lucas sequences
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- Lattice-based functional commitments: fast verification and cryptanalysis
- Succinct functional commitments for circuits from \(k\)-\textsf{Lin}
- Succinct homomorphic secret sharing
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- Time-lock puzzles from lattices
- Adaptive security in SNARGs via iO and lossy functions
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Greyhound: fast polynomial commitments from lattices
- Concretely efficient lattice-based polynomial commitment from standard assumptions
- Functional commitments and SNARGs for P/poly from SIS
- New techniques for preimage sampling: improved NIZKs and more from LWE
- Vanishing short integer solution, revisited. Reductions, trapdoors, homomorphic signatures for low-degree polynomials
- Lattice-based proof-friendly signatures from vanishing short integer solutions
- Watermarkable and zero-knowledge verifiable delay functions from any proof of exponentiation
- Distributed broadcast encryption from lattices
- Batching adaptively-sound SNARGs for NP
- RoK, paper, SISsors toolkit for lattice-based succinct arguments (extended abstract)
- RoK and Roll -- verifier-efficient random projection for \(\tilde{O}(\lambda )\)-size lattice arguments (extended abstract)
- Tight reductions for SIS-with-hints assumptions with applications to anonymous credentials
- Practical batch proofs of exponentiation
- Post-quantum access control with application to secure data retrieval
- Leaky LWE: learning with errors with semi-adaptive secret- and error-leakage
This page was built for publication: Lattice-based succinct arguments from vanishing polynomials (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6186698)
