Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
From MaRDI portal
Publication:2181848
DOI10.1007/978-3-030-26948-7_6zbMath1456.94122OpenAlexW2951264056MaRDI QIDQ2181848
William Whyte, Qiuliang Xu, Zuoxia Yu, Zhenfei Zhang, Man Ho Au, Rupeng Yang
Publication date: 20 May 2020
Full work available at URL: https://doi.org/10.1007/978-3-030-26948-7_6
Related Items
Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ More efficient amortization of exact zero-knowledge proofs for LWE ⋮ Black-box accumulation based on lattices ⋮ \textsf{GM}\textsuperscript{MT}: a revocable group Merkle multi-tree signature scheme ⋮ Security analysis of DGM and GM group signature schemes instantiated with XMSS-T ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Lattice-based secret handshakes with reusable credentials ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ Multimodal private signatures ⋮ Efficient lattice-based blind signatures via Gaussian one-time signatures ⋮ BLOOM: bimodal lattice one-out-of-many proofs and applications ⋮ Lattice-based succinct arguments for NP with polylogarithmic-time verification ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ A framework for practical anonymous credentials from lattices ⋮ A new lattice-based online/offline signatures framework for low-power devices ⋮ Forward-secure revocable secret handshakes from lattices ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Lattice-based succinct arguments from vanishing polynomials (extended abstract) ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Lattice-based e-cash, revisited ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Efficient range proofs with transparent setup from bounded integer commitments ⋮ Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Practical product proofs for lattice commitments
This page was built for publication: Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
