Better zero-knowledge proofs for lattice encryption and their application to group signatures

DOI10.1007/978-3-662-45611-8_29zbMATH Open1306.94026OpenAlexW1752323684MaRDI QIDQ2938865FDOQ2938865

Authors: Fabrice Benhamouda, Jan Camenisch, Stephan Krenn, Vadim Lyubashevsky, 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

Recommendations

• Simpler efficient group signatures from lattices
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Lattice-based group signatures with logarithmic signature size
• On new zero-knowledge arguments for attribute-based group signatures from lattices

zbMATH Keywords

group signaturesverifiable encryptionzero-knowledge proofs for lattices

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cited In (42)

• Lattice-based zero-knowledge arguments for additive and multiplicative relations
• Efficient lattice-based polynomial evaluation and batch ZK arguments
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• One-shot verifiable encryption from lattices
• Lattice-based inner product argument
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Group encryption: full dynamicity, message filtering and code-based instantiation
• A compressed \(\varSigma \)-protocol theory for lattices
• 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
• How to prove knowledge of small secrets
• 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)\)
• Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
• Group encryption: full dynamicity, message filtering and code-based instantiation
• Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
• Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
• On new zero-knowledge arguments for attribute-based group signatures from lattices
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Zero-knowledge proofs of knowledge for group homomorphisms
• A lattice-based group signature scheme with message-dependent opening
• Zero-knowledge arguments for subverted RSA groups
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Toward practical lattice-based proof of knowledge from Hint-MLWE
• Improved Zero-Knowledge Identification with Lattices
• A non-PCP approach to succinct quantum-safe zero-knowledge
• Fully dynamic attribute-based signatures for circuits from codes
• Maliciously secure matrix multiplication with applications to private deep learning
• Compact privacy protocols from post-quantum and timed classical assumptions
• Efficient range proofs with transparent setup from bounded integer commitments
• On structure-preserving cryptography and lattices
• Short zero-knowledge proof of knowledge for lattice-based commitment
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Two-round threshold signature from algebraic one-more learning with errors
• Concretely efficient lattice-based polynomial commitment from standard 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
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Title not available (Why is that?)

This page was built for publication: Better zero-knowledge proofs for lattice encryption and their application to group signatures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2938865)