基于扭共轭搜索问题的比特承诺

Bit Commitment Based on the Twisted Conjugacy Search Problem

该文提出了一个新的基于扭共轭搜索问题的比特承诺方案,并且给出了方案的正确性、安全性的证明。扭共轭搜索问题比共轭搜索问题的优势是可以使基于长度的攻击变得无效,并且可以抵抗线性攻击。平台的选取是基于扭共轭问题的密码算法的安全性最关键的一点。最后在一个具体的平台上讨论了密钥空间、参数设置和安全性。

This paper is a contribution to the study of bit commitment based on the twisted conjugacy search problem.The proposed scheme is proved to be correct and security.The important advantage of twisted conjugacy search problem over the conjugacy search problem is,it renders length based attacks and linear algebra attacks ineffective.The choice of the platform group is of the most paramount importance for the security of schemes based on the twisted conjugacy search problem.It also sketches out the key space,parameters and the cryptanalysis on a specific platform.