中文摘要：

量子计算的快速发展给基于整数分解或离散对数问题的密码协议带来严重威胁。为了研究抵抗量子分析的密码协议,基于非交换的辫群提出了一个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.