%0 Journal Article
%T One-time group signature model based on hash function<br>基于hash函数的一次群签名模型
%A GAO Xiao-dong
%A YANG Ya-tao
%A LI Zi-chen
%A <br>高晓东
%A 杨亚涛
%A 李子臣
%J 计算机应用研究
%D 2012
%I 
%X Since traditional digital signature based on the big integer prime decomposition and discrete logarithm problem can't resist attack in quantum computing, this paper proposed a signature model based on the hash function. The security of this model is based on the hash function is unidirectional. Its key generation, signature and verification are completed by hash computing. This model could help achieve higher efficiency, and resist attack in quantum computing effectively. Proved by experiments, its efficiency is 21 times higher than ECC a key length for 224, and can reach 102 times higher than RSA-2048.
%K quantum attacked
%K one-time group signature
%K one-way function
%K hash computing<br>量子攻击
%K 一次群签名
%K 单向函数
%K hash运算
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=31780116840884789037103110DCA486&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=DF92D298D3FF1E6E&sid=A0C0AE84F0018085&eid=30D12647FBC8A758&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=9