位置:成果数据库 > 期刊 > 期刊详情页
An Anonymous Authentication Scheme Withstanding the Conspiracy Attack
  • ISSN号:1001-3695
  • 期刊名称:《计算机应用研究》
  • 时间:0
  • 分类:TP309.7[自动化与计算机技术—计算机系统结构;自动化与计算机技术—计算机科学与技术]
  • 作者机构:[1]Department of Public Computer Teaching, Hefei NormalUniversity, Hefei 230601, Anhui, China, [2]Xueyan Trade Faculty, Anhui Finance and TradeVocational College, Hefei 230601, Anhui, China
  • 相关基金:Supported by the National Natural Science Foundation of China(61503112);the Key Projects of Support Program for Outstanding Youth Talent of Universities in Anhui Province(gxyq ZD2016231)
中文摘要:

A novel anonymous authentication scheme is proposed based on the ring signature. In the scheme, the private key and the the freely chosen anonymity set are used to achieve anonymous authentication. In terms of the threshold sharing, a group of t members jointly implement threshold tracking. In order to improve the security of tracking, message recovery equation is used to verify and recover data leaked by the user. Compared with Liu et al’s scheme, the proposed scheme can resist conspiracy tracking and has less computational cost. On the premise of the discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf(LRSW) and Diffie-Hellman(DDH) assumption, the scheme is proved to meet the demands of anonymous authentication. The scheme has broad application prospects in many fields such as ad hoc network, electronic voting, and so on.

英文摘要:

A novel anonymous authentication scheme is proposed based on the ring signature. In the scheme, the private key and the the freely chosen anonymity set are used to achieve anonymous authentication. In terms of the threshold sharing, a group of t members jointly implement threshold tracking. In order to improve the security of tracking, message recovery equation is used to verify and recover data leaked by the user. Compared with Liu et al’s scheme, the proposed scheme can resist conspiracy tracking and has less computational cost. On the premise of the discrete-logarithm-based assumption put forth by Lysyanskaya, Rivest, Sahai, and Wolf(LRSW) and Diffie-Hellman(DDH) assumption, the scheme is proved to meet the demands of anonymous authentication. The scheme has broad application prospects in many fields such as ad hoc network, electronic voting, and so on.

同期刊论文项目
同项目期刊论文
期刊信息
  • 《计算机应用研究》
  • 北大核心期刊(2011版)
  • 主管单位:四川省科学技术厅
  • 主办单位:四川省计算机研究院
  • 主编:刘营
  • 地址:成都市成科西路3号
  • 邮编:610041
  • 邮箱:arocmag@163.com
  • 电话:028-85210177 85249567
  • 国际标准刊号:ISSN:1001-3695
  • 国内统一刊号:ISSN:51-1196/TP
  • 邮发代号:62-68
  • 获奖情况:
  • 第二届国家期刊奖百种重点科技期刊,国内计算技术类重点核心期刊,国内外著名数据库收录期刊
  • 国内外数据库收录:
  • 俄罗斯文摘杂志,波兰哥白尼索引,英国科学文摘数据库,日本日本科学技术振兴机构数据库,中国中国科技核心期刊,中国北大核心期刊(2004版),中国北大核心期刊(2008版),中国北大核心期刊(2011版),中国北大核心期刊(2014版),中国北大核心期刊(2000版)
  • 被引量:60049