• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Designs, Codes and Crytography >Modular lattice signatures, revisited
【24h】

Modular lattice signatures, revisited

机译：模块化格子签名，重新审视

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In this paper we revisit the modular lattice signature scheme and its efficient instantiation known as pqNTRUSign. First, we show that a modular lattice signature scheme can be based on a standard lattice problem. The fundamental problem that needs to be solved by the signer or a potential forger is recovering a lattice vector with a restricted norm, given the least significant bits. We show that this problem is equivalent to the short integer solution (SIS) problem over the corresponding lattice. In addition, we show that by replacing the uniform sampling in pqNTRUSign with a bimodal Gaussian sampling, we can further reduce the size of a signature. An important new contribution, enabled by this Gaussian sampling version of pqNTRUSign, is that we can now perform batch verification of messages signed by the same public key, which allows the verifier to check approximately 24 signatures in a single verification process.
机译：在本文中，我们将回顾模块化的格架签名方案及其有效的实例化，称为pqNTRUSign。首先，我们证明了模块化的格子签名方案可以基于标准格子问题。给定最低有效位，签名者或潜在伪造者需要解决的基本问题是恢复具有受限范数的晶格向量。我们表明，该问题等效于相应晶格上的短整数解决方案（SIS）问题。另外，我们显示出通过用双峰高斯采样替换pqNTRUSign中的均匀采样，我们可以进一步减小签名的大小。由pqNTRUSign的高斯采样版本实现的一项重要的新贡献是，我们现在可以对由同一公钥签名的消息执行批量验证，这使验证者可以在单个验证过程中检查大约24个签名。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号