More efficient amortization of exact zero-knowledge proofs for LWE

DOI10.1007/978-3-030-88428-4_30zbMath1504.94107OpenAlexW3202327249MaRDI QIDQ2148770

Vadim Lyubashevsky, Ngoc Khanh Nguyen, Jonathan Bootle, Gregor Seiler

Publication date: 24 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-88428-4_30

zbMATH Keywords

latticeszero-knowledge proofsLWEamortization

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60)

Related Items

A generic transform from multi-round interactive proof to NIZK

Uses Software

• Ligero
• libiop

Cites Work

• Unnamed Item
• Using TopGear in overdrive: a more efficient ZKPoK for SPDZ
• Linear-time zero-knowledge proofs for arithmetic circuit satisfiability
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• More efficient commitments from structured lattice assumptions
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• 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
• Aurora: transparent succinct arguments for R1CS
• The theory of hash functions and random oracles. An approach to modern cryptography
• Scalable ciphertext compression techniques for post-quantum KEMs and their applications
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Interactive Oracle Proofs
• Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
• Interactive PCP
• A Framework for Efficient and Composable Oblivious Transfer
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• A new identification scheme based on syndrome decoding
• Computationally Sound Proofs
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Quadratic Span Programs and Succinct NIZKs without PCPs
• Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy
• Constant-round interactive proofs for delegating computation
• Interactive proofs of proximity
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting