%0 Journal Article
%T Biased bit commitment protocol over braid groups<br>辫群上的非平衡比特承诺协议*
%A ZHU Dan
%A BAO Wan-su
%A ZHANG Xing-kai
%A WEI Yun
%A <br>朱丹
%A 鲍皖苏
%A 张兴凯
%A 隗云
%J 计算机应用研究
%D 2012
%I 
%X In order to construct quantum attack-resistant cryptographic protocols, non-commutative braid group is used as a new platform.This paper proposed a biased bit commitment protocol on base of the difficulty of root extraction problem over braid groups. Analysis shows that the proposed protocol is binding and hiding. And it is much more efficient in computation than the protocol based on since it needs no conjugacy decision operation.
%K braid group
%K bit commitment
%K root extraction problem(REP)
%K conjugacy search problem(CSP)<br>辫群
%K 比特承诺
%K 求根问题
%K 共轭搜索问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=A9D9BE08CDC44144BE8B5685705D3AED&aid=F950C016BC33E9015C67915E32825037&yid=99E9153A83D4CB11&vid=771469D9D58C34FF&iid=38B194292C032A66&sid=BB5084A31068995F&eid=E6E6318AC4BCBFDB&journal_id=1001-3695&journal_name=计算机应用研究&referenced_num=0&reference_num=26