Tang Yongli, Guo Menghao, Huo Yachao, Zhao Zongqu, Yu Jinxia, Qin Baodong
School of Software, Henan Polytechnic University, Jiaozuo 454000, China.
School of Computer Science and Technology, Henan Polytechnic University, Jiaozuo 454003, China.
Entropy (Basel). 2024 Sep 16;26(9):793. doi: 10.3390/e26090793.
The existing lattice-based cut-and-choose oblivious transfer protocol is constructed based on the learning-with-errors (LWE) problem, which generally has the problem of inefficiency. An efficient cut-and-choose oblivious transfer protocol is proposed based on the difficult module-learning-with-errors (MLWE) problem. Compression and decompression techniques are introduced in the LWE-based dual-mode encryption system to improve it to an MLWE-based dual-mode encryption framework, which is applied to the protocol as an intermediate scheme. Subsequently, the security and efficiency of the protocol are analysed, and the security of the protocol can be reduced to the shortest independent vector problem (SIVP) on the lattice, which is resistant to quantum attacks. Since the whole protocol relies on the polynomial ring of elements to perform operations, the efficiency of polynomial modulo multiplication can be improved by using fast Fourier transform (FFT). Finally, this paper compares the protocol with an LWE-based protocol in terms of computational and communication complexities. The analysis results show that the protocol reduces the computation and communication overheads by at least a factor of while maintaining the optimal number of communication rounds under malicious adversary attacks.
现有的基于格的裁剪选择不经意传输协议是基于带误差学习（LWE）问题构建的，该问题通常存在效率低下的问题。基于困难的带误差模块学习（MLWE）问题，提出了一种高效的裁剪选择不经意传输协议。在基于LWE的双模加密系统中引入了压缩和解压缩技术，将其改进为基于MLWE的双模加密框架，并将其作为中间方案应用于该协议。随后，分析了该协议的安全性和效率，该协议的安全性可归约为格上的最短独立向量问题（SIVP），能抵抗量子攻击。由于整个协议依赖于元素的多项式环来执行操作，因此可以通过使用快速傅里叶变换（FFT）提高多项式模乘法的效率。最后，本文在计算和通信复杂度方面将该协议与基于LWE的协议进行了比较。分析结果表明，该协议在恶意对手攻击下，在保持最优通信轮数的同时，将计算和通信开销至少降低了一个因子。
