【24h】

Secure Outsourcing of Lattice Basis Reduction

机译:减少格子基础的安全外包

获取原文

摘要

In the recent twenty years, lattice basis reduction algorithm, such as the celebrated LLL (A.K. Lenstra-H.W. Lenstra Jr.-L. Lovasz) algorithm plays an important role in the public-key schemes design and cryptanalysis. To assess the security of the public-key cryptosystems by lattice reduction algorithms, the most time-consuming part is running the lattice reduction algorithm on the corresponding lattice with high dimension or big coefficients. In this paper, we investigate secure outsourcing for lattice basis reduction for the first time. We propose a lattice basis reduction scheme such that the clients can outsource their main computation workloads to the untrusted cloud servers. We employ rounding technique and unimodular transformation matrix for privacy protection before sending the target lattice basis to the cloud. The results returned from the cloud need to be decrypted and verified to satisfy reduction conditions. The experimental results indicate that our scheme is correct, efficient and feasible.
机译:在最近的二十年中,诸如著名的LLL(A.K. Lenstra-H.W。Lenstra Jr.-L. Lovasz)算法之类的晶格基约简算法在公钥方案设计和密码分析中起着重要作用。为了通过晶格约简算法评估公钥密码系统的安全性,最耗时的部分是在具有高维或大系数的相应晶格上运行晶格约简算法。在本文中,我们首次研究了用于减少网格基数的安全外包。我们提出了一种基于格的基础简化方案,以便客户端可以将其主要计算工作量外包给不受信任的云服务器。在将目标点阵基础发送到云之前,我们采用舍入技术和单模变换矩阵进行隐私保护。从云返回的结果需要解密和验证以满足缩减条件。实验结果表明,该方案是正确,有效和可行的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号