Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices

DOI10.1007/978-3-030-84245-1_18zbMath1486.94076OpenAlexW3159513901MaRDI QIDQ2128574

Martin R. Albrecht, Russell W. F. Lai

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84245-1_18

zbMATH Keywords

lattice-based cryptographySchnorr-like protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (11)

A compressed \(\varSigma \)-protocol theory for lattices ⋮ Efficient laconic cryptography from learning with errors ⋮ 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 ⋮ Quantum rewinding for many-round protocols ⋮ Fiat-Shamir transformation of multi-round interactive proofs ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ \textsf{Orbweaver}: succinct linear functional commitments from lattices ⋮ Lattice-based timed cryptography

Uses Software

• NTRU
• NTRUSign
• libiop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the key equation over a commutative ring
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• Transparent SNARKs from DARK compilers
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Expected-time cryptography: generic techniques and applications to concrete soundness
• Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
• Short discrete log proofs for FHE and ring-LWE ciphertexts
• More efficient algorithms for the NTRU key generation using the field norm
• Aurora: transparent succinct arguments for R1CS
• Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Key Homomorphic PRFs and Their Applications
• Lattice Signatures without Trapdoors
• Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
• Generalized Compact Knapsacks Are Collision Resistant
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• A new identification scheme based on syndrome decoding
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
• On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
• Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices