计算机科学 ›› 2012, Vol. 39 ›› Issue (4): 63-66.

• 计算机网络与信息安全 • 上一篇    下一篇

基于格构造非交互不可展承诺方案

孙微微,杨波,杨德新,夏峰   

  1. (华南农业大学信息学院 广州510642)
  • 出版日期:2018-11-16 发布日期:2018-11-16

Non-interactive and Non-malleable Commitment Scheme Based on Lattice

  • Online:2018-11-16 Published:2018-11-16

摘要: NTRU是基于格归约困难问题的公钥密码体制,目前主要用于公钥加密及数字签名。利用N"I'RU实现了 一个非交互不可展承诺方案,其安全性基于格上CVP困难问题,实现了承诺者绑定性。它基于抗碰撞Hash函数的 安全性对承诺合法性进行验证,通过随机映射扰动明文,使明文具有随机分布特性,以实现验证者隐藏性以及与揭示 有关的不可展性质。本方案具有N I'RU快速高效的特点,同时可抵杭信道窃听攻击、消息重放攻击及复制承诺攻击。

关键词: 公钥密码,NTRU,格,承诺

Abstract: NTRU is a well-known publi}key cryptosystem based on the difficulty of lattice reduction problems, and is mainly applied in publi}kcy encryption and digital signature. This paper constructed a non-interactive and non-malleable commitment scheme, which relies the security on the intractable CVP on lattice, and the binding property of commuter is satisfied. The validity of commitment is verified by hash function's collision resistance. Perturbing the plaintext with randomized mapping,plaintext will be in random distribution, and this scheme satisfies the hiding property of verifier and is non-malleable with respect to decommitment} This scheme has high efficiency as well as NTRU, and can resist channel eavesdropping attack, message replay attack and copying commitment attack.

Key words: Public key cryptography, NTRU, Lattice, Commitment

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!