Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Efficient and provably-secure identity-based signatures and signcryption from bilinear maps
ASIACRYPT'05 Proceedings of the 11th international conference on Theory and Application of Cryptology and Information Security
An efficient certificateless signature scheme
CIS'05 Proceedings of the 2005 international conference on Computational Intelligence and Security - Volume Part II
On the security of certificateless signature schemes from asiacrypt 2003
CANS'05 Proceedings of the 4th international conference on Cryptology and Network Security
An efficient certificateless signature scheme
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
On constructing certificateless cryptosystems from identity based encryption
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
Certificateless public-key signature: security model and efficient construction
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
Key replacement attack against a generic construction of certificateless signature
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Efficient and provably-secure certificateless short signature scheme from bilinear pairings
Computer Standards & Interfaces
Efficient and short certificateless signatures secure against realistic adversaries
The Journal of Supercomputing
Certificateless undeniable signatures from bilinear maps
Information Sciences: an International Journal
An efficient and provably-secure certificateless signature scheme without bilinear pairings
International Journal of Communication Systems
| Hi-index | 0.00 |
In ubiquitous computing environment, how to implement security and trust among the users that connected to a network is a big problem. Digital signature provides authenticity, integrity and nonrepudiation to many kinds of applications in ubiquitous computing environment. In this paper, we present a very efficient certificateless signature scheme from bilinear maps. In our scheme, only one paring operation is needed in the signing and verification processes. The security of the new scheme is based on the intractability of the q-Strong Diffie-Hellman (q-SDH) Problem and the Discrete Logarithm Problem. We prove the existential unforgeability of our scheme under adaptively chosen message attack against both types of adversaries in the random oracle model [3].