Name
Abstract | ||
|---|---|---|
According to actual needs, a generalized signcryption scheme can flexibly work as an encryption scheme, a signature scheme or a signcryption scheme. In this paper, firstly, we give a security model for identity based generalized signcryption which is more complete than the existing model. Secondly, we propose an identity based generalized signcryption scheme. Thirdly, we give the security proof of the new scheme in this complete model. Compared with existing identity based generalized signcryption, the new scheme has less implementation complexity. Moreover, the new scheme has comparable computation complexity with the existing normal signcryption schemes. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.tcs.2010.06.003 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
existing normal signcryption scheme,Bilinear pairing,generalized signcryption scheme,Encryption,Identity based cryptography,existing model,security model,complete model,provable secure identity,Signature,Generalized signcryption,bilinear pairing,encryption,signcryption scheme,signature scheme,encryption scheme,identity based cryptography,new scheme,generalized signcryption,signature | Journal | 411 |
Issue | ISSN | Citations |
40-42 | Theoretical Computer Science | 15 |
PageRank | References | Authors |
0.76 | 29 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Gang Yu | 1 | 15 | 0.76 |
| Xiaoxiao Ma | 2 | 202 | 14.68 |
| Yong Shen | 3 | 19 | 5.55 |
| zeng guang he kaicheng han wenbao | 4 | 84 | 12.68 |