Min-round resettable zero-knowledge in the public-key model

被引：0
|
作者：
Micali, S [1 ]
Reyzin, L [1 ]
机构：
[1] MIT, Comp Sci Lab, Cambridge, MA 02139 USA
来源：
ADVANCES IN CRYPTOLOGY-EUROCRYPT 2001, PROCEEDINGS | 2001年 / 2045卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In STOC 2000, Canetti, Goldreich, Goldwasser, and Micali put forward the strongest notion of zero-knowledge to date, resettable zero-knowledge (RZK) and implemented it in constant rounds in a new model, where the verifier simply has a public key registered before any interaction with the prover. To achieve ultimate round efficiency, we advocate a slightly stronger model. Informally, we show that, as long as the honest verifier does not use a given public key more than a fixed-polynomial number of times, there exist 3-round (which we prove optimal) RZK protocols for all of NP.
引用
下载
收藏
页码：373 / 393
页数：21
相关论文
共 50 条
  • [1] Resettable zero-knowledge in the weak public-key model
    Zhao, YL
    Deng, XT
    Lee, CH
    Zhu, H
    ADVANCES IN CRYPTOLOGY-EUROCRYPT 2003, 2003, 2656 : 123 - 139
  • [2] Generic and practical resettable zero-knowledge in the bare public-key model
    Yung, Moti
    Zhao, Yunlei
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007, 2007, 4515 : 129 - +
  • [3] Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model
    Di Crescenzo, G
    Persiano, G
    Visconti, I
    ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 237 - 253
  • [4] Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
    Di Crescenzo, Giovanni
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 127 - 137
  • [5] ZERO-KNOWLEDGE ARGUMENTS AND PUBLIC-KEY CRYPTOGRAPHY
    DESANTIS, A
    DICRESCENZO, G
    PERSIANO, G
    INFORMATION AND COMPUTATION, 1995, 121 (01) : 23 - 40
  • [6] On Round-Optimal Zero Knowledge in the Bare Public-Key Model
    Scafuro, Alessandra
    Visconti, Ivan
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2012, 2012, 7237 : 153 - 171
  • [7] Resettable zero knowledge with concurrent soundness in the bare public-key model under standard assumption
    Deng, Yi
    Lin, Dongdai
    INFORMATION SECURITY AND CRYPTOLOGY, 2008, 4990 : 123 - 137
  • [8] From Laconic Zero-Knowledge to Public-Key Cryptography Extended Abstract
    Berman, Itay
    Degwekar, Akshay
    Rothblum, Ron D.
    Vasudevan, Prashant Nalini
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT III, 2018, 10993 : 674 - 697
  • [9] Zero-Knowledge Protocols for Code-Based Public-Key Encryption
    Hu, Rong
    Morozov, Kirill
    Takagi, Tsuyoshi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2015, E98A (10) : 2139 - 2151
  • [10] Concurrent zero knowledge in the public-key model
    Di Crescenzo, G
    Visconti, I
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 816 - 827
12345