ACHIEVING ZERO-KNOWLEDGE ROBUSTLY

被引:0
|
作者
KILIAN, J [1 ]
机构
[1] MIT, COMP SCI LAB, CAMBRIDGE, MA 02139 USA
关键词
D O I
暂无
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We introduce the notion of robust transformations of interactive proof systems. A robust transformation takes an interactive proof system (P, V), and produces a new interactive proof system, (P*, V*), such that the power of P* is within a polynomial factor of that of P. We show that, given an ideal protocol for secure circuit evaluation, there exists a robust transformation that converts interactive proof systems to zero-knowledge interactive proof systems.
引用
收藏
页码:313 / 325
页数:13
相关论文
共 50 条
  • [11] Zero-Knowledge Traders
    Carrella, Ernesto
    JASSS-THE JOURNAL OF ARTIFICIAL SOCIETIES AND SOCIAL SIMULATION, 2014, 17 (03): : 05
  • [12] ZERO-KNOWLEDGE PROOFS
    WAYNER, P
    BYTE, 1987, 12 (11): : 149 - 152
  • [13] Solitaire zero-knowledge
    Niemi, Valtteri
    Renvall, Ari
    Fundamenta Informaticae, 1999, 38 (1-2): : 181 - 188
  • [14] Subquadratic zero-knowledge
    J Assoc Comput Mach, 6 (1169):
  • [15] Subquadratic zero-knowledge
    Boyar, J
    Brassard, G
    Peralta, R
    JOURNAL OF THE ACM, 1995, 42 (06) : 1169 - 1193
  • [16] Reduction zero-knowledge
    LEE C. H.
    ProgressinNaturalScience, 2004, (04) : 64 - 72
  • [17] NONINTERACTIVE ZERO-KNOWLEDGE
    BLUM, M
    DESANTIS, A
    MICALI, S
    PERSIANO, G
    SIAM JOURNAL ON COMPUTING, 1991, 20 (06) : 1084 - 1118
  • [18] Zero-knowledge sets
    Micali, S
    Rabin, M
    Kilian, J
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 80 - 91
  • [19] Zero-knowledge proofs for finite field arithmetic, or:: Can zero-knowledge be for free?
    Cramer, R
    Damgård, I
    ADVANCES IN CRYPTOLOGY - CRYPTO'98, 1998, 1462 : 424 - 441
  • [20] Amortized Complexity of Zero-Knowledge Proofs Revisited: Achieving Linear Soundness Slack
    Cramer, Ronald
    Damgard, Ivan
    Xing, Chaoping
    Yuan, Chen
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2017, PT I, 2017, 10210 : 479 - 500