THE NOTION OF SECURITY FOR PROBABILISTIC CRYPTOSYSTEMS

被引:60
作者
MICALI, S [1 ]
RACKOFF, C [1 ]
SLOAN, B [1 ]
机构
[1] UNIV TORONTO,TORONTO M5S 1A4,ONTARIO,CANADA
关键词
Probability--Random Processes;
D O I
10.1137/0217025
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Three very different formal definitions of security for public-key cryptosystems have been proposed - two by S. Goldwasser and S. Micali and one by A.C. Yao. We prove all of them to be equivalent. This equivalence provides evidence that the right formalization of the notion of security has been reached.
引用
收藏
页码:412 / 426
页数:15
相关论文
共 11 条
[1]   A MEASURE OF ASYMPTOTIC EFFICIENCY FOR TESTS OF A HYPOTHESIS BASED ON THE SUM OF OBSERVATIONS [J].
CHERNOFF, H .
ANNALS OF MATHEMATICAL STATISTICS, 1952, 23 (04) :493-507
[2]  
Chor B., 1985, 26th Annual Symposium on Foundations of Computer Science (Cat. No.85CH2224-4), P383, DOI 10.1109/SFCS.1985.64
[3]   NEW DIRECTIONS IN CRYPTOGRAPHY [J].
DIFFIE, W ;
HELLMAN, ME .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1976, 22 (06) :644-654
[4]   PROBABILISTIC ENCRYPTION [J].
GOLDWASSER, S ;
MICALI, S .
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1984, 28 (02) :270-299
[6]   PROBABILISTIC ALGORITHM FOR TESTING PRIMALITY [J].
RABIN, MO .
JOURNAL OF NUMBER THEORY, 1980, 12 (01) :128-138
[7]   COMMUNICATION THEORY OF SECRECY SYSTEMS [J].
SHANNON, CE .
BELL SYSTEM TECHNICAL JOURNAL, 1949, 28 (04) :656-715
[8]  
Solovay R., 1977, SIAM Journal on Computing, V6, P84, DOI 10.1137/0206006
[9]  
Yao A. C., 1982, 23rd Annual Symposium on Foundations of Computer Science, P80, DOI 10.1109/SFCS.1982.45
[10]  
[No title captured]