摘要
量子计算的快速发展给基于整数分解或离散对数问题的密码协议带来严重威胁。为了研究抵抗量子分析的密码协议,基于非交换的辫群提出了一个2取1不经意传输协议,并将其扩展为N取1不经意传输协议。在共轭搜索问题和多重共轭搜索问题难解的前提下协议能同时保证发送方和接收方的隐私性。
The rapid development of quantum computing brings great challenge to cryptographic protocols based on the integer factorization or the discrete logarithm problem. In order to research quantum cryptanalysis-resistant cryptographic protocols, this paper proposed a 1-out-of-2 oblivious transfer protocol based on non-commutative braid group,which was extended to a 1-out-of-N oblivious transfer protocol. The protocols could provide privacy for both the sender and the receiver on base of the difficulty of the conjugacy search problem and the multiple conjugacy search problem.
出处
《计算机应用研究》
CSCD
北大核心
2010年第8期3042-3044,共3页
Application Research of Computers
基金
国家自然科学基金资助项目(10501053)
关键词
辫群
不经意传输
共轭搜索
多重共轭搜索
braid group
oblivious transfer
conjugacy search
multiple conjugacy search