An efficient blind signature scheme based on SM2 signature algorithm

DOI10.1007/978-3-030-71852-7_25zbMath1479.94356OpenAlexW3136749926MaRDI QIDQ2057164

Yudi Zhang, Fangguo Zhang, Dawei Li, Debiao He, Xin-Yi Huang

Publication date: 8 December 2021

Full work available at URL: https://doi.org/10.1007/978-3-030-71852-7_25

zbMATH Keywords

implementationdigital signatureprovable securityblind signatureSM2 algorithm

Mathematics Subject Classification ID

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

Related Items

On the (im)possibility of secure ElGamal blind signatures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Security arguments for digital signatures and blind signatures
• An efficient identity-based blind signature scheme without bilinear pairings
• Security of the SM2 signature scheme against generalized key substitution attacks
• Blind Schnorr signatures and signed ElGamal encryption in the algebraic group model
• On the Security of One-Witness Blind Signature Schemes
• Lattice-Based Blind Signatures
• Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions
• A Framework for Universally Composable Non-committing Blind Signatures
• ID-Based Blind Signature and Ring Signature from Pairings
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• Formalizing Group Blind Signatures and Practical Constructions without Random Oracles
• Efficient Round Optimal Blind Signatures
• Security in Communication Networks
• Round-Optimal Composable Blind Signatures in the Common Reference String Model