Zero-Knowledge Identification Scheme Based on Weil Pairing

被引:3
作者
Dehkordi, Massoud Hadian [1 ]
Alimoradi, Reza [1 ,2 ]
机构
[1] Iran Univ Sci & Technol, Tehran, Iran
[2] Res Ctr Intelligent Signal Proc, Tehran, Iran
关键词
Identification; Elliptic Curves; Weil Pairing; Challenge-Response; Zero-Knowledge Proof;
D O I
10.1134/S1995080209030020
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Zero knowledge turned out to be a useful tool for many cryptographic applications. Many cryptographic protocols based on bilinear pairings, namely the Weil and Tate pairings, have been proposed recently. In this paper, first elliptic curves and weil pairing would be introduced. In addition a new zero-knowledge identification scheme based on weil pairing is proposed. Finally, our scheme is compared with some identification schemes. Also we have described zero-knowledge property of the scheme and evaluation security analysis of proposed scheme.
引用
收藏
页码:203 / 207
页数:5
相关论文
共 18 条
[1]  
Boneh D., 2001, LNCS, V2139, P27
[2]  
Buchmann J. A., 2001, INTRO CRYPTOGAPHY
[3]  
Feige U., 1988, Journal of Cryptology, V1, P77, DOI 10.1007/BF02351717
[4]   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
[5]   The Tate pairing and the discrete logarithm applied to elliptic curve cryptosystems [J].
Frey, G ;
Müller, M ;
Rück, HG .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1999, 45 (05) :1717-1719
[6]  
Galbraith SD, 2002, LECT NOTES COMPUT SC, V2369, P324
[7]  
Goldreich O., 1999, MODERN CRYPTOGRAPHY
[8]   THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J].
GOLDWASSER, S ;
MICALI, S ;
RACKOFF, C .
SIAM JOURNAL ON COMPUTING, 1989, 18 (01) :186-208
[9]  
Joux A, 2002, LECT NOTES COMPUT SC, V2369, P20
[10]  
Joux A, 2000, LECT NOTES COMPUT SC, V1838, P385