Name
Abstract | ||
|---|---|---|
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]. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/978-3-540-77090-9_64 | EUC Workshops |
Keywords | Field | DocType |
bilinear map,q-strong diffie-hellman,existential unforgeability,ubiquitous computing environment,new scheme,efficient certificateless signature scheme,new efficient certificateless signature,message attack,big problem,discrete logarithm problem,digital signature,diffie hellman,random oracle model,cryptography | Bilinear map,ElGamal signature scheme,Merkle signature scheme,Cryptography,Computer science,Random oracle,Digital signature,Distributed computing,Schnorr signature,Discrete logarithm | Conference |
Volume | ISSN | ISBN |
4809 | 0302-9743 | 3-540-77089-5 |
Citations | PageRank | References |
6 | 0.68 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lei Zhang | 1 | 68 | 8.33 |
| Futai Zhang | 2 | 596 | 41.18 |
| Fangguo Zhang | 3 | 1723 | 124.35 |