Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
From MaRDI portal
Publication:2938865
DOI10.1007/978-3-662-45611-8_29zbMath1306.94026OpenAlexW1752323684MaRDI QIDQ2938865
Stephan Krenn, Fabrice Benhamouda, Vadim Lyubashevsky, Jan Camenisch, Gregory Neven
Publication date: 16 January 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-45611-8_29
Related Items (28)
Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Mhz2K: MPC from HE over \(\mathbb{Z}_{2^k}\) with new packing, simpler reshare, and better ZKP ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Mixed-technique multi-party computations composed of two-party computations ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Lattice-based inner product argument ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Maliciously secure matrix multiplication with applications to private deep learning ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ On the Scaled Inverse of $(x^i-x^j)$ modulo Cyclotomic Polynomial of the form $\Phi_{p^s}(x)$ or $\Phi_{p^s q^t}(x)$ ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Group signatures and more from isogenies and lattices: generic, simple, and efficient ⋮ Unnamed Item ⋮ 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 ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ How to Prove Knowledge of Small Secrets ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge
This page was built for publication: Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
