环上的身份认证方案
In this paper, we study ring identification schemesin the settingwhere each participant generates its public keyand maintains thecorrespondent secret key independently. The scheme isefficient as we separatesoundness and honest verifier zero-knowledge from thehardness of anyproblem. The security of the ring identificationscheme can be rigorouslyproved by simply assuming that each challenge stringis chosen uniformly atrandom by the honest verifier. This assumption isstandard and it has beenused to construct efficient honest verifier zeroknowledge proofs of knowledgewithout intractability assumptions by Cramer,Damgard, and MacKenzie already”3”.
环 身份认证 密码学
Huafei Zhu Guiliang Feng
Institute for Infocomm Research,21 Heng Mui Keng Terrace,Singapore 119613 The Center for Advanced Computer Studies,University of Louisiana,at Lafayette Lafayette,LA 70504,U.S
国内会议
上海
中文
82-92
2004-03-01（万方平台首次上网日期，不代表论文的发表时间）