A new identity based signcryption scheme from pairings

被引：143
作者：
Libert, B [1 ]
Quisquater, JJ [1 ]
机构：
[1] Catholic Univ Louvain, Microelect Lab, Crypto Grp, B-1348 Louvain, Belgium
来源：
2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS | 2003年
关键词：
D O I：
10.1109/ITW.2003.1216718
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present a new identity based scheme using pairings over elliptic curves. It combines the functionalities of signature and encryption and is provably secure in the random oracle model. We compare it with Malone-Lee's one from security and efficiency points of view. We give a proof of semantical security under the Decisional Bi-linear Diffie-Hellman assumption for this new scheme.
引用
收藏
页码：155 / 158
页数：4
相关论文
共 35 条
[1]  
An JH, 2002, LECT NOTES COMPUT SC, V2332, P83
[2]  
BAEK J, LNCS, V2274, P81
[3]  
Bao F, 1998, LNCS, P55
[4]  
Bellare M., 1995, P 1 ACM C COMPUTER C, P62
[5]  
BONEH D, 2001, LNCS, V2139
[6]  
CHA JC, IN PRESS LECT NOTES
[7]  
Cocks Clifford., 2001, IMA Int. Conf., V2260, P360, DOI DOI 10.1007/3-540-45325-3
[8]  
DUPONT R, PRACTICAL NONINTERAC
[9]   HOW TO PROVE YOURSELF - PRACTICAL SOLUTIONS TO IDENTIFICATION AND SIGNATURE PROBLEMS [J].
FIAT, A ;
SHAMIR, A .
LECTURE NOTES IN COMPUTER SCIENCE, 1987, 263 :186-194
[10]  
Fujisaki E., 1999, LNCS, V1666, P537, DOI DOI 10.1007/3-540-48405-1_34
1234