Simpler efficient group signatures from lattices

DOI10.1007/978-3-662-46447-2_18zbMATH Open1345.94082OpenAlexW2129193120MaRDI QIDQ2941202FDOQ2941202

Authors:

Publication date: 27 August 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-46447-2_18

Recommendations

• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• Lattice-based group signatures with logarithmic signature size
• Group signatures without NIZK: from lattices in the standard model
• A Group Signature Scheme from Lattice Assumptions
• Constant-size group signatures from lattices

Mathematics Subject Classification ID

Cryptography (94A60)

Cited In (40)

• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• Title not available (Why is that?)
• A new Gaussian sampling for trapdoor lattices with arbitrary modulus
• A scalable post-quantum hash-based group signature
• Lattice signature with efficient protocols, application to anonymous credentials
• Survey of lattice-based group signature
• Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
• Memory lower bounds of reductions revisited
• Better zero-knowledge proofs for lattice encryption and their application to group signatures
• Constant-size group signatures from lattices
• Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
• Policy-based signature scheme from lattices
• On new zero-knowledge arguments for attribute-based group signatures from lattices
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
• Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
• \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
• Lattice-based programmable hash functions and applications
• A rank metric code-based group signature scheme
• Floppy-sized group signatures from lattices
• A lattice-based group signature scheme with message-dependent opening
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Integral matrix Gram root and lattice Gaussian sampling without floats
• Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
• On New Zero-Knowledge Proofs for Lattice-Based Group Signatures with Verifier-Local Revocation
• Lattice-based group signatures with logarithmic signature size
• Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
• Achieving Almost-Full Security for Lattice-Based Fully Dynamic Group Signatures with Verifier-Local Revocation
• Relaxed Lattice-Based Signatures with Short Zero-Knowledge Proofs
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
• A code-based group signature scheme
• A multi-group signature scheme from lattices
• Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
• Shorter Lattice-Based Group Signatures via “Almost Free” Encryption and Other Optimizations
• Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
• A practical group signature scheme based on rank metric
• Lattice-based group signatures with verifier-local revocation: achieving shorter key-sizes and explicit traceability with ease
• A Group Signature Scheme from Lattice Assumptions

This page was built for publication: Simpler efficient group signatures from lattices

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