THE ZERO-KNOWLEDGE PROOF PROTOCOL OF THE NONISOMORPHISM OF GRAPHS
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [1]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    The discussion of the zero-knowledge proof protocol of the nonisomorphism of graphs (GNI) has appeared in many papers, but they are not complete zero-knowledge proof protocols at all. This paper proposed a complete zero-knowledge proof protocol on the problem.

    Reference
    1 G01dreich O,Micali S,Wigderson A.Proofs that yield nothing but their validity and a methodology of crypto- graphic protocol design.FOCS, 1986.174~187. 2 朱洪,吴京.零知识证明浅介.密码与信息,1992,(4):1~38.
    Related
    Cited by
Get Citation

郭宝安,卢开澄.关于图的非同构问题零知识交互证明协议.软件学报,1997,8(7):481-485

Copy
Share
Article Metrics
  • Abstract:4107
  • PDF: 4984
  • HTML: 0
  • Cited by: 0
History
  • Revised:July 21,1996
You are the first2033371Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063