A compressed \(\varSigma \)-protocol theory for lattices
From MaRDI portal
Publication:2128575
DOI10.1007/978-3-030-84245-1_19zbMath1486.94145OpenAlexW3187842930MaRDI QIDQ2128575
Lisa Kohl, Ronald Cramer, Thomas Attema
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_19
Related Items (17)
ECLIPSE: Enhanced Compiling Method for Pedersen-Committed zkSNARK Engines ⋮ Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures ⋮ Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) ⋮ Practical sublinear proofs for R1CS from lattices ⋮ Fiat-Shamir transformation of multi-round interactive proofs (Extended version) ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Lattice-based inner product argument ⋮ Quantum rewinding for many-round protocols ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Vector commitments over rings and compressed \(\varSigma \)-protocols ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Lattice-based timed cryptography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Efficient secure two-party protocols. Techniques and constructions
- Parallel coin-tossing and constant-round secure two-party computation
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics
- The measure-and-reprogram technique 2.0: multi-round Fiat-Shamir and more
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Short lattice-based one-out-of-many proofs and applications to ring signatures
- Aurora: transparent succinct arguments for R1CS
- Worst-case to average-case reductions for module lattices
- Counterexamples to Hardness Amplification beyond Negligible
- Lattice Signatures without Trapdoors
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures
- An Efficient Parallel Repetition Theorem
- Parallel Repetition Theorems for Interactive Arguments
- Parallel Repetition of Computationally Sound Protocols Revisited
- Designated Confirmer Signatures Revisited
- Lattice-based Cryptography
- Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Foundations of Cryptography
- Tight Parallel Repetition Theorems for Public-Coin Arguments Using KL-Divergence
- Computational Integrity with a Public Random String from Quasi-Linear PCPs
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: A compressed \(\varSigma \)-protocol theory for lattices
