HOW TO SIGN GIVEN ANY TRAPDOOR PERMUTATION

被引:31
作者
BELLARE, M
MICALI, S
机构
[1] Massachusetts Institute of Technology, Cambridge
关键词
ALGORITHMS; SECURITY; THEORY; CRYPTOGRAPHY; DIGITAL SIGNATURES; RANDOMNESS; TRAPDOOR FUNCTIONS;
D O I
10.1145/147508.147537
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A digital signature scheme is presented, which is based on the existence of any trapdoor permutation. The scheme is secure in the strongest possible natural sense: namely, it is secure against existential forgery under adaptive chosen message attack.
引用
收藏
页码:214 / 233
页数:20
相关论文
共 17 条
[1]  
BELLARE M, 1988, 20TH P STOC, P32
[2]   A SIMPLE UNPREDICTABLE PSEUDORANDOM NUMBER GENERATOR [J].
BLUM, L ;
BLUM, M ;
SHUB, M .
SIAM JOURNAL ON COMPUTING, 1986, 15 (02) :364-383
[3]   HOW TO GENERATE CRYPTOGRAPHICALLY STRONG SEQUENCES OF PSEUDO-RANDOM BITS [J].
BLUM, M ;
MICALI, S .
SIAM JOURNAL ON COMPUTING, 1984, 13 (04) :850-864
[4]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[5]   HOW TO CONSTRUCT RANDOM FUNCTIONS [J].
GOLDREICH, O ;
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF THE ACM, 1986, 33 (04) :792-807
[6]  
GOLDREICH O, 1986, MIT715 LAB COMP SCI
[7]   A DIGITAL SIGNATURE SCHEME SECURE AGAINST ADAPTIVE CHOSEN-MESSAGE ATTACKS [J].
GOLDWASSER, S ;
MICALI, S ;
RIVEST, RL .
SIAM JOURNAL ON COMPUTING, 1988, 17 (02) :281-308
[8]   PROBABILISTIC ENCRYPTION [J].
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :270-299
[9]  
GOLDWASSER S, 1983, 15TH P STOC, P431
[10]  
GUILLOU L, 1988, UNPUB ZERO KNOWLEDGE