Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves
Mathematics of Computation
Security of Blind Discrete Log Signatures against Interactive Attacks
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Efficient Identity Based Signature Schemes Based on Pairings
SAC '02 Revised Papers from the 9th Annual International Workshop on Selected Areas in Cryptography
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
ID-Based Blind Signature and Ring Signature from Pairings
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Efficient ID-based blind signature and proxy signature from bilinear pairings
ACISP'03 Proceedings of the 8th Australasian conference on Information security and privacy
Linkability Analysis of Some Blind Signature Schemes
Computational Intelligence and Security
One-Round ID-Based Blind Signature Scheme without ROS Assumption
Pairing '08 Proceedings of the 2nd international conference on Pairing-Based Cryptography
Blind signature and ring signature schemes: Rehabilitation and attack
Computer Standards & Interfaces
Linkability of some blind signature schemes
WISTP'07 Proceedings of the 1st IFIP TC6 /WG8.8 /WG11.2 international conference on Information security theory and practices: smart cards, mobile and ubiquitous computing systems
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Provably-secure electronic cash based on certificateless partially-blind signatures
Electronic Commerce Research and Applications
Linkability of a blind signature scheme and its improved scheme
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part IV
| Hi-index | 0.00 |
In this paper, we first propose an efficient provably secure identity-based signature (IBS) scheme based on bilinear pairings, then propose an efficient identity-based blind signature (IBBS) scheme based on our IBS scheme. Assuming the intractability of the Computational Diffie-Hellman Problem, our IBS scheme is unforgeable under adaptive chosen-message and ID attack. Efficiency analyses show that our schemes can offer advantages in runtime over the schemes available. Furthermore, we show that, contrary to the authors claimed, Zhang and Kim’s scheme in ACISP 2003 is one-more forgeable, if the ROS-problem is solvable.