Multilinear Schwartz-Zippel mod N and lattice-based succinct arguments

DOI10.1007/978-3-031-48621-0_14MaRDI QIDQ6582225zbMATH OpenFDO

Authors Benedikt Bünz, Ben Fisch

Publication date 2 August 2024

Full work available at URL https://doi.org/10.1007/978-3-031-48621-0_14

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cites work

• \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
• A compressed \(\varSigma \)-protocol theory for lattices
• A method for obtaining digital signatures and public-key cryptosystems
• A non-PCP approach to succinct quantum-safe zero-knowledge
• A probabilistic remark on algebraic program testing
• A survey on IQ cryptography
• Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
• Derandomizing polynomial identity tests means proving circuit lower bounds
• Efficient verifiable delay functions
• Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Fiat-Shamir transformation of multi-round interactive proofs
• Hardness of SIS and LWE with small parameters
• scientific article; zbMATH DE number 3651744 (Why is no real title available?)
• Linear-map vector commitments and their practical applications
• On zeros of a polynomial in a finite grid
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• Practical product proofs for lattice commitments
• Practical statistically-sound proofs of exponentiation in any group
• Practical sublinear proofs for R1CS from lattices
• Proofs of Catalytic Space
• Removing the strong RSA assumption from arguments over the integers
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Subvector commitments with application to succinct arguments
• Sumcheck arguments and their applications
• Time- and space-efficient arguments from groups of unknown order
• Transparent SNARKs from DARK compilers
• Trapdoors for hard lattices and new cryptographic constructions
• Worst-case to average-case reductions for module lattices

Cited in

(3)

• Aggregating Falcon signatures with LaBRADOR
• DewTwo: a transparent PCS with quasi-linear prover, logarithmic verifier and 4.5KB proofs from falsifiable assumptions
• Critical rounds in multi-round proofs: proof of partial knowledge and trapdoor commitments

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)