北京邮电大学学报

  • EI核心期刊

北京邮电大学学报 ›› 2001, Vol. 24 ›› Issue (1): 52-55.

• • 上一篇    下一篇

一种高效的基于离散对数假设的身份认证方案

钟鸣, 杨义先   

  1. 北京邮电大学信息工程学院, 北京 100876
  • 收稿日期:2000-06-13 出版日期:2001-01-10
  • 作者简介:钟鸣(1978—),男,四川绵阳人,博士生.
  • 基金资助:
    国家自然科学基金资助项目(60073049;69882002);国家杰出青年基金资助项目(69425001);国家“973”资助项目(G1999035805);高等学校骨干教授资助计划项目

An Efficient Identification Scheme Based on Discrete Logarithm Assumption

ZHONG Ming, YANG Yi-xian   

  1. Information Engineering School, Beijing University of Posts and Telecommunications, Beijing 100876, China
  • Received:2000-06-13 Online:2001-01-10

摘要: 提出了一种新的实用的基于比特承诺和Schnorr的一次性知识证明方案的身份认证方案.在方案中不再需要使用Cut-and-Choose方法,而使用了单一的一个“挑战”整数取代在认证协议中通常使用的多个随机生成的校验侯选整数.在基于离散对数假设的前提下,证明了方案的安全性,从而澄清了该方案的密码学基础,也开辟了基于离散对数假设构筑身份认证方案的新途径.

关键词: 保密通信, 身份认证方案, 离散对数假设

Abstract: A new practical identification scheme based on bit commitment and Schnorr's one-time knowledge proof scheme is presented. Here the use of Cut-and-Choose method and many random exam candidates in the identification protocol is replaced by a single challenge number. Therefore our identification scheme is more efficient and practical than the previous schemes. In addition, we prove the security of the proposed scheme under discrete logarithm assumption, thus clarify the cryptographic basis of the proposed scheme.

Key words: secret communications, identification scheme, discrete logarithm assumption

中图分类号: