一个自授权系统及问题的知识复杂性*
作者:
基金项目:

本文研究得到国家自然科学基金和国家863高科技项目基金资助.


One Self-delegation Scheme and the Knowledge Complexity of Problems
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [8]
  • |
  • 相似文献 [20]
  • |
  • 引证文献
  • | |
  • 文章评论
    摘要:

    基于图同构零知识证明的标识-鉴别-签名系统,提出了一个解决自授权问题的方法.与以前的方法相比,虽然两者都是基于对主秘密的逐步暴露来实现的,但前者是基于图同构置换来实现的,而后者是基于类似于秘密共享的思想来实现的.在研究给出的自授权系统的安全性时,定义了问题级的知识复杂性、实际知识复杂性和计算知识复杂性.应把它们作为协议知识复杂性的上界.

    Abstract:

    A solution to the problem of self-delegation using the identification-authentication-signature scheme based on the graph isomorphism problem is proposed in this paper. The major difference from the traditional solutions is that it is based on the graph isomorphism rather than computing numeric theory problem, though they all leak out secret information little by little. The knowledge complexity of problems, the including knowledge complexity, the practical knowledge complexity, and the computing knowledge complexity are also defined. In the authors' opinion, these definitions should be used as the upper bound of knowledge complexity of protocols.

    参考文献
    [1]Goldreich O, Pfitmann B, Rivest R L. Self-delegation with Controlled Propagation-or-What if You Lose Your Laptop. http://www.mit.edu, 1997
    [2]Dwork C, Lotspiech J, Naor M. Digital signets: self-enforcing protection of digital information(preliminary version). In: Leighton F T ed. Proceedings of the 28th ACM Symposium on Theory of Computing. New York: ACM Press, 1996. 489~498
    [3]Bellare M, Goldreich O. On defining proofs of knowledge. In: Brickell E F ed. Proceedings of the CRYPTO, Lecture Notes in Computer Science 740. Berlin: Springer-Verlag, 1992. 390~420
    [4]Goldreich O, Petrank E. Quantifying knowledge complexity. In: Sipser M ed. Proceedings of IEEE Symposium on Foundations of Computer Science. Los Alamitors, California: IEEE Computer Society Press, 1991. 59~68
    [5]Goldreich O, Petrank E. Quantifying Knowledge Complexity. http://www.mit.edu, 1997
    [6]Ben-Or M, Goldreich O, Goldwasser S et al. Everything provable is provable in zero-knowledge. In: Goldwasser S ed. Proceedings of CRYPTO, Lecture Notes in Computer Science 403. Berlin: Springer-Verlag, 1988. 37~46
    [7]Blum M, Feldman P, Micali S. Non-interactive zero-knowledge and its applications(extended abstract). In: Ullman J D ed. Proceedings of the 20th ACM Symposium on Theory of Computing. New York: ACM Press, 1988. 103~112
    [8]Goldwasser S, Micali S, Rackoff C. The knowledge complexity of interactive proofs. In: Pipenger N ed. Proceedings of the 17th ACM Symposium on Theory of Computing. New York: ACM Press, 1985. 291~304
    引证文献
引用本文

徐寿怀,张根度,朱 洪.一个自授权系统及问题的知识复杂性*.软件学报,1999,10(2):170-174

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
  • HTML阅读次数:
  • 引用次数:
历史
  • 收稿日期:1997-12-16
  • 最后修改日期:1998-03-03
文章二维码
您是第位访问者
版权所有:中国科学院软件研究所 京ICP备05046678号-3
地址:北京市海淀区中关村南四街4号,邮政编码:100190
电话:010-62562563 传真:010-62562533 Email:jos@iscas.ac.cn
技术支持:北京勤云科技发展有限公司

京公网安备 11040202500063号