Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
From MaRDI portal
Publication:2953783
DOI10.1007/978-3-662-53890-6_13zbMath1407.94136OpenAlexW2552176082MaRDI QIDQ2953783
Huaxiong Wang, San Ling, Benoît Libert, Fabrice Mouhartem, Khoa Nguyen
Publication date: 6 January 2017
Published in: Advances in Cryptology – ASIACRYPT 2016 (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01267123/file/dynamic-lgsig-even-simpler.pdf
anonymitylattice-based cryptographyanonymous credentialsdynamic group signaturessignatures with efficient protocols
Related Items (34)
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 ⋮ Memory lower bounds of reductions revisited ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Multimodal private signatures ⋮ Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation ⋮ Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Forward-secure revocable secret handshakes from lattices ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Identity-based key-exposure resilient cloud storage public auditing scheme from lattices ⋮ Lattice-based e-cash, revisited ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Foundations of fully dynamic group signatures ⋮ Group signature from lattices preserving forward security in dynamic setting ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ Lattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with Ease ⋮ Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions ⋮ A code-based group signature scheme ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ Survey of Lattice-Based Group Signature ⋮ Access control encryption from group encryption ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- Confined guessing: new signatures from standard assumptions
- Formal Treatment of Privacy-Enhancing Credential Systems
- Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather Than the Statistical Distance
- A Provably Secure Group Signature Scheme from Code-Based Assumptions
- Lattice-Based Group Signatures with Logarithmic Signature Size
- Dynamic Fully Anonymous Short Group Signatures
- Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On the Security of Dynamic Group Signatures: Preventing Signature Hijacking
- Fully Anonymous Attribute Tokens from Lattices
- Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures
- Simpler Efficient Group Signatures from Lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- A Group Signature Scheme from Lattice Assumptions
- A new paradigm for public key identification
- Randomizable Proofs and Delegatable Anonymous Credentials
- Short and Stateless Signatures from the RSA Assumption
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Mixing and Vanishing Trapdoors: A Framework for Fully Secure Short Signatures and More
- On Ideal Lattices and Learning with Errors over Rings
- Bonsai Trees, or How to Delegate a Lattice Basis
- Efficient Lattice (H)IBE in the Standard Model
- Structure-Preserving Signatures and Commitments to Group Elements
- Compact Group Signatures Without Random Oracles
- Universally Composable Adaptive Oblivious Transfer
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- On the Portability of Generalized Schnorr Proofs
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- Group Signatures
- The knowledge complexity of interactive proof-systems
- Constant-Size Structure-Preserving Signatures: Generic Constructions and Simple Assumptions
- Commitments and Efficient Zero-Knowledge Proofs from Learning Parity with Noise
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- Streaming Authenticated Data Structures
- Fully homomorphic encryption using ideal lattices
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Advances in Cryptology – CRYPTO 2004
- Group Signatures with Efficient Concurrent Join
- Compact E-Cash
- Fully Anonymous Group Signatures Without Random Oracles
- Group Encryption
- Generating Shorter Bases for Hard Random Lattices
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- GGHLite: More Efficient Multilinear Maps from Ideal Lattices
- Lattice-Based Identification Schemes Secure Under Active Attacks
- P-signatures and Noninteractive Anonymous Credentials
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Public-Key Encryption with Non-interactive Opening
- Attribute-based encryption for circuits
- Classical hardness of learning with errors
- Topics in Cryptology – CT-RSA 2005
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- Full-Domain Subgroup Hiding and Constant-Size Group Signatures
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions