首页> 外文期刊>Journal of information and computational science >A Verifiably Encrypted Signature Scheme from Lattice Assumption
【24h】

A Verifiably Encrypted Signature Scheme from Lattice Assumption

机译:基于格假设的可验证加密签名方案

获取原文
获取原文并翻译 | 示例

摘要

Utilizing the OrthoSamp algorithm, a lattice-based Verifiably Encrypted Signature scheme is proposed in this paper. Under the Short Integer Solution (SIS) problem intractability assumption, the proposed scheme is provably existentially unforgeable in the random oracles model. Moreover, opacity property of the proposed VES scheme is based on the hardness of the Learning with Errors (LWE) problems. Due to the quantum intractability of the lattice problems we are based on, the proposed scheme is secure even in quantum-eve.
机译:利用OrthoSamp算法,提出了一种基于格的可验证加密签名方案。在短整数解决方案(SIS)问题难处理性假设下,该方案在随机预言机模型中证明是不可伪造的。此外,所提出的VES方案的不透明性是基于“学习错误学习”(LWE)问题的难度。由于我们所基于的晶格问题具有量子难解性,因此即使在量子平安夜中,所提出的方案也是安全的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号