EFFICIENT ZERO-KNOWLEDGE IDENTIFICATION SCHEMES FOR SMART CARDS

被引:9
作者
BURMESTER, M
DESMEDT, Y
BETH, T
机构
[1] UNIV WISCONSIN, DEPT ELECT ENGN & COMP SCI, MILWAUKEE, WI 53201 USA
[2] UNIV KARLSRUHE, FAK INFORMAT, EUROPEAN INST SYST SECUR, W-7500 KARLSRUHE, GERMANY
关键词
D O I
10.1093/comjnl/35.1.21
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Secure identification is an important security issue to avoid computer fraud due to masquerading. This can be achieved with zero-knowledge based smart cards. We present very efficient new zero-knowledge schemes in a general algebraic setting. Particular cases of our scheme improve the performance of the Guillou-Quisquater and the Chaum-Evertsevan de Graaf schemes. Our scheme is formally proven and, overall, is more efficient than currently available schemes including the Fiat-Shamir scheme. As an application we discuss how our scheme can be used for identification, in particular as an electronic passport scheme.
引用
收藏
页码:21 / 29
页数:9
相关论文
共 44 条
[21]  
Feige U., 1988, Journal of Cryptology, V1, P77, DOI 10.1007/BF02351717
[22]   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
[23]   COMPUTATIONAL COMPLEXITY OF PROBABILISTIC TURING MACHINES [J].
GILL, J .
SIAM JOURNAL ON COMPUTING, 1977, 6 (04) :675-695
[24]  
GOLDREICH O, 1990, LECT NOTES COMPUT SC, V443, P268
[25]   THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J].
GOLDWASSER, S ;
MICALI, S ;
RACKOFF, C .
SIAM JOURNAL ON COMPUTING, 1989, 18 (01) :186-208
[26]  
GUILLOU L, 1983, P CARTE MEMOIRE, P17
[27]  
Hua L.-K., 1982, INTRO NUMBER THEORY
[28]  
ITOH T, 1990, UNPUB COMPLEXITY CON
[29]  
Jacobson N., 1985, BASIC ALGEBRA
[30]  
KOBLITZ N, 1987, MATH COMPUT, V48, P203, DOI 10.1090/S0025-5718-1987-0866109-5