Resettable zero knowledge with concurrent soundness in the bare public-key model under standard assumption

被引：0
|
作者：
Deng, Yi [1 ]
Lin, Dongdai [1 ]
机构：
[1] Chinese Acad Sci, Inst Software, State Key Lab Informat Secur, Beijing 100080, Peoples R China
来源：
INFORMATION SECURITY AND CRYPTOLOGY | 2008年 / 4990卷
关键词：
resettable zero knowledge; concurrent soundness; the bare public-key model; resettably sound zero knowledge;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we present the first constant round resettable zero knowledge arguments with Concurrent Soundness for NP in the bare public-key (BPK for short) model assuming only collision-resistant hash functions against polynomial-time adversaries. This resolves the problem whether there exist such protocols for NP in BPK model without assuming sub-exponential hardness. In our protocol, the resettable zero knowledge is demonstrated via a black-box simulator, while the concurrent soundness is proved by using the malicious prover strategy in non-black-box manner.
引用
收藏
页码：123 / 137
页数：15
相关论文
共 38 条
  • [1] Constant-round resettable zero knowledge with concurrent soundness in the bare public-key model
    Di Crescenzo, G
    Persiano, G
    Visconti, I
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2004, PROCEEDINGS, 2004, 3152 : 237 - 253
  • [2] Generic and practical resettable zero-knowledge in the bare public-key model
    Yung, Moti
    Zhao, Yunlei
    [J]. ADVANCES IN CRYPTOLOGY - EUROCRYPT 2007, 2007, 4515 : 129 - +
  • [3] Resettable zero-knowledge in the weak public-key model
    Zhao, YL
    Deng, XT
    Lee, CH
    Zhu, H
    [J]. ADVANCES IN CRYPTOLOGY-EUROCRYPT 2003, 2003, 2656 : 123 - 139
  • [4] Efficient concurrent zero knowledge arguments for NP in the bare public-key model
    Deng, Yi
    Lin, Dong-Dai
    [J]. 2008, Chinese Academy of Sciences, P.O. Box 8718, Beijing, 100080, China (19):
  • [5] Concurrent zero knowledge in the public-key model
    Di Crescenzo, G
    Visconti, I
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 816 - 827
  • [6] A new notion of soundness in bare public-key model
    Cheung, SHC
    Deng, XT
    Lee, CH
    Zhao, YL
    [J]. SECURITY IN COMMUNICATION NETWORKS, 2003, 2576 : 318 - 325
  • [7] A new notion of soundness in bare public-key model
    ZHAO Yunlei 1
    2. Department of Computer Science
    [J]. Progress in Natural Science:Materials International, 2003, (12) : 47 - 51
  • [8] A new notion of soundness in bare public-key model
    Zhao, YL
    Zhu, H
    [J]. PROGRESS IN NATURAL SCIENCE-MATERIALS INTERNATIONAL, 2003, 13 (12) : 927 - 931
  • [9] Min-round resettable zero-knowledge in the public-key model
    Micali, S
    Reyzin, L
    [J]. ADVANCES IN CRYPTOLOGY-EUROCRYPT 2001, PROCEEDINGS, 2001, 2045 : 373 - 393
  • [10] Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model
    Di Crescenzo, Giovanni
    [J]. COMPUTING AND COMBINATORICS, PROCEEDINGS, 2009, 5609 : 127 - 137
1234