Computing - The security of knowing nothing

被引:3
作者
Chazelle, Bernard [1 ]
机构
[1] Princeton Univ, Dept Comp Sci, Princeton, NJ 08540 USA
关键词
D O I
10.1038/446992a
中图分类号
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号
07 ; 0710 ; 09 ;
摘要
'Zero-knowledge' proofs are all about knowing more, while knowing nothing. When married to cryptographic techniques, they are one avenue being explored towards improving the security of online transactions.
引用
收藏
页码:992 / 993
页数:2
相关论文
共 5 条
[1]  
Barak B, 2005, ANN IEEE SYMP FOUND, P543
[2]  
GOLDREICH O, 1991, J ACM, V38, P691, DOI 10.1145/116825.116852
[3]  
Goldreich O, 2001, FDN CRYPTOGRAPHY BAS
[4]  
Goldreich Oded, 1987, STOC, DOI DOI 10.1145/28395.28420
[5]   THE KNOWLEDGE COMPLEXITY OF INTERACTIVE PROOF SYSTEMS [J].
GOLDWASSER, S ;
MICALI, S ;
RACKOFF, C .
SIAM JOURNAL ON COMPUTING, 1989, 18 (01) :186-208