A Generic Construction of Identity-Based Online/Offline Signcryption

被引：14

作者：

Sun, Dongdong ^{[1
]}

Mu, Yi ^{[1
]}

Susilo, Willy ^{[1
]}

机构：

[1] Univ Wollongong, Sch Comp Sci & Software Engn, Wollongong, NSW 2522, Australia

来源：

PROCEEDINGS OF THE 2008 INTERNATIONAL SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING WITH APPLICATIONS | 2008年

关键词：

D O I：

10.1109/ISPA.2008.16

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

Signcryption has clear advantage over traditional sign-then-encrypt schemes. However, the computational overhead for signcryption is still too heavy when it is applied to resource-constraint systems. In this paper, we propose a generic construction of the identity-based online/offline signcryption, where most of computations are carried out when the associated message is still unavailable and the online part of our scheme does not require any exponent computations and therefore is very efficient. Our scheme is generic and identity-based, in the sense it is independent of the selection of signature and encryption algorithms. Our scheme possesses the properties of ciphertext indistinguishability (IND-gCCA2) and existentially unforgeability (UF-CMA).

引用

页码：707 / 712

页数：6

共 13 条

[1]

An JH, 2002, LECT NOTES COMPUT SC, V2332, P83

[2]

[Anonymous], 2001, LNCS

[3]

Bohio M, 2004, SECOND ANNUAL CONFERENCE ON COMMUNICATION NETWORKS AND SERVICES RESEARCH, PROCEEDINGS, P69

[4]

BONEH D, 2001, LNCS, V2139

[5]

Boyen X, 2003, LECT NOTES COMPUT SC, V2729, P383

[6]

CHEN L, 2004, 2004114 CRYPT EPRINT

[7]

Chen XF, 2007, LECT NOTES COMPUT SC, V4521, P18

[8]

EVEN S, 1990, CRYPTO 89

[9]

LIBERT B, 2003, IEEE INF THEOR WORKS

[10]

Malone-Lee J, 2002, CRYPTOLOGY EPRINT AR

← 1 2 →