作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (22): 147-149. doi: 10.3969/j.issn.1000-3428.2009.22.050

• 安全技术 • 上一篇    下一篇

弱公钥模型集下的零知识论证系统

谭 肖1,赵一鸣1,2   

  1. (1. 复旦大学计算机科学与工程学院,上海 200433;2. 复旦大学软件学院,上海 200433)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-11-20 发布日期:2009-11-20

Zero Knowledge Argument System in Bare Public Key Model Set

TAN Xiao1, ZHAO Yi-ming1,2   

  1. (1. School of Computer Science and Engineering, Fudan University, Shanghai 200433; 2. Software School, Fudan University, Shanghai 200433)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-11-20 Published:2009-11-20

摘要: 根据近年来弱公钥模型集下的零知识系统的研究成果,对其发展历程和特性设置进行阐释和剖析,探讨该模型集下最优轮数的零知识协议的构造方法,提出通用的4轮模式和3轮模式,以及协议的(并发)健壮性和(可重置)零知识的证明技术和问题,并总结弱公钥模型集下零知识系统的研究将来可能发展的导向。

关键词: 可重置零知识论证系统, 并发健壮性, 弱公钥模型, cPK模型, WPK模型, UPK模型

Abstract: This paper analyzes the development and properties of zero knowledge argument systems in Bare Public Key(BPK) model set, according to the researches and applications of recent years. The generic 4-round mode and 3-round mode are proposed for the constructions of zero knowledge protocols with optimal round complexity, following explorations on the proof techniques of (concurrent) soundness and (resettable) zero knowledge of the protocols. Possible focuses of the near future are discussed.

Key words: resettable zero knowledge argument system, concurrent soundness, Bare Public Key(BPK) model, counter Public Key(cPK) model, Weak Public Key(WPK) model, Upper-bounded Public Key(UPK) model

中图分类号: