A scalable post-quantum hash-based group signature
DOI10.1007/S10623-021-00857-9zbMATH Open1464.94063OpenAlexW3136885472MaRDI QIDQ831185FDOQ831185
Authors: Masoumeh Shafieinejad, Navid Nasr Esfahani 
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-021-00857-9
Recommendations
group signatureshash-based signaturestransversal designs\( \tau \)-traceabilitypost quantum signatures
Combinatorics in computer science (68R05) Cryptography (94A60) Orthogonal arrays, Latin squares, Room squares (05B15) Quantum cryptography (quantum-theoretic aspects) (81P94) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- Title not available (Why is that?)
- Combinatorial Designs
- Short signatures without random oracles and the SDH assumption in bilinear groups
- How to share a secret
- Title not available (Why is that?)
- Scalable group signatures with revocation
- Group signatures with almost-for-free revocation
- Compact Group Signatures Without Random Oracles
- Group Signatures
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Topics in Cryptology – CT-RSA 2005
- Lattice-based group signatures with logarithmic signature size
- Simpler efficient group signatures from lattices
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- A Group Signature Scheme from Lattice Assumptions
- Lattice-based group signature scheme with verifier-local revocation
- Title not available (Why is that?)
- Unbalanced Oil and Vinegar Signature Schemes
- All-or-nothing encryption and the package transform
- Something about all or nothing (transforms)
- Rainbow, a New Multivariable Polynomial Signature Scheme
- A provably secure group signature scheme from code-based assumptions
- Short one-time signatures
- All or nothing at all
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- G-Merkle: a hash-based group signature scheme from standard assumptions
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
- Merkle Tree Traversal Revisited
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some results on the existence of t-all-or-nothing transforms over arbitrary alphabets
- Title not available (Why is that?)
Cited In (7)
- SKC-CCCO: an encryption algorithm for quantum group signature
- G-Merkle: a hash-based group signature scheme from standard assumptions
- \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
- Compact privacy protocols from post-quantum and timed classical assumptions
- Hash-Based Direct Anonymous Attestation
- A novel group signature scheme based on MPKC
Uses Software
This page was built for publication: A scalable post-quantum hash-based group signature
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831185)
