Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

DOI10.1007/978-3-030-45374-9_17zbMath1502.94029OpenAlexW3003231116MaRDI QIDQ5041168

Carsten Baum, Ariel Nof

Publication date: 13 October 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-45374-9_17

zbMATH Keywords

short integer solution problemsymmetric-key primitivesSPDZ-protocol

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (20)

Compilation of function representations for secure computing paradigms ⋮ SoK: how (not) to design and implement post-quantum cryptography ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ BooLigero: improved sublinear zero knowledge proofs for Boolean circuits ⋮ Succinct arguments in the quantum random oracle model ⋮ Ligero: lightweight sublinear arguments without a trusted setup ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Syndrome decoding in the head: shorter signatures from zero-knowledge proofs ⋮ Verifiable decryption in the head ⋮ Resumable zero-knowledge for circuits from symmetric key primitives ⋮ Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection ⋮ MinRank in the head. Short signatures from zero-knowledge proofs ⋮ Lattice-based inner product argument ⋮ MR-DSS -- smaller MinRank-based (ring-)signatures ⋮ Publicly verifiable zero-knowledge and post-quantum signatures from VOLE-in-the-head ⋮ Generalized proofs of knowledge with fully dynamic setup ⋮ Sigma protocols for MQ, PKP and SIS, and fishy signature schemes ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Banquet: short and fast signatures from AES ⋮ TurboIKOS: improved non-interactive zero knowledge and post-quantum signatures

Uses Software

• Pinocchio
• Ligero
• ZKBoo

Cites Work

• Unnamed Item
• Unnamed Item
• (Leveled) Fully Homomorphic Encryption without Bootstrapping
• Pinocchio
• Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
• More efficient commitments from structured lattice assumptions
• 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
• Multi-target attacks on the picnic signature scheme and related protocols
• Scalable zero knowledge with no trusted setup
• Libra: succinct zero-knowledge proofs with optimal prover computation
• Security of the Fiat-Shamir transformation in the quantum random-oracle model
• How to Prove Knowledge of Small Secrets
• Scalable Zero Knowledge via Cycles of Elliptic Curves
• Lattice Signatures without Trapdoors
• Multiparty Computation from Somewhat Homomorphic Encryption
• A new paradigm for public key identification
• Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Knowledge Complexity of Interactive Proof Systems
• Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
• Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

This page was built for publication: Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography