Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
From MaRDI portal
Publication:6582225
DOI10.1007/978-3-031-48621-0_14MaRDI QIDQ6582225
Publication date: 2 August 2024
Cites Work
- Title not available (Why is that?)
- A probabilistic remark on algebraic program testing
- Transparent SNARKs from DARK compilers
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Practical product proofs for lattice commitments
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- Sumcheck arguments and their applications
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- A compressed \(\varSigma \)-protocol theory for lattices
- Time- and space-efficient arguments from groups of unknown order
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Subvector commitments with application to succinct arguments
- Worst-case to average-case reductions for module lattices
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- A survey on IQ cryptography
- Hardness of SIS and LWE with Small Parameters
- Trapdoors for hard lattices and new cryptographic constructions
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- A method for obtaining digital signatures and public-key cryptosystems
- On Zeros of a Polynomial in a Finite Grid
- Proofs of Catalytic Space
- Removing the Strong RSA Assumption from Arguments over the Integers
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
- Derandomizing polynomial identity tests means proving circuit lower bounds
- Efficient verifiable delay functions
- Practical sublinear proofs for R1CS from lattices
- Practical statistically-sound proofs of exponentiation in any group
- Fiat-Shamir transformation of multi-round interactive proofs
- Linear-map vector commitments and their practical applications
Related Items (1)
This page was built for publication: Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6582225)
