首页> 外文OA文献 >Signcryption schemes based on elliptic curve cryptography
【2h】

Signcryption schemes based on elliptic curve cryptography

机译:基于椭圆曲线密码学的签密方案

摘要

Signcryption is cryptographic primitive which simultaneously provide both the function of digital signature and public key encryption in a single logical step. Identity based cryptography is an alternative to the traditional certificate based cryptosystem. Its main idea is that each user uses his identity information as his public key. Many identity based signcryption scheme have been proposed so, far. However, all the schemes were proven using bilinear pairing. Elliptic curve cryptosystem (ECC) have recently received significant attention by research due to their low computational and communicational overhead. Elliptic curve cryptography (ECC) is the hardest computational problems; the elliptic curve discrete logarithm problem and elliptic curve Deffie-Hellman problem are the most reliable cryptographic technique in ECC. The advantages of ECC that it requires shorter key length compared to other public-key algorithms. So, that its use in low-end systems such as smart cards because of its efficiency and limited computational and communicational overhead. We introduce new signcryption schemes based on elliptic curve cryptography. The security of proposed schemes is based on elliptic curve discrete logarithm problem (ECDLP) and elliptic curve Diffie-Hellman problem (ECDHP). The proposed schemes provide various desirable security requirements like confidentiality, authenticity, non-repudiation and forward security as well as chosen ciphertext attack and unforgeability.
机译:签密是密码原语,它在单个逻辑步骤中同时提供数字签名和公钥加密的功能。基于身份的密码术是传统基于证书的密码系统的替代方法。其主要思想是每个用户都将其身份信息用作其公共密钥。到目前为止,已经提出了许多基于身份的签密方案。但是,所有方案都使用双线性配对证明。椭圆曲线密码系统(ECC)由于其较低的计算和通信开销而受到了研究的极大关注。椭圆曲线密码学(ECC)是最困难的计算问题。椭圆曲线离散对数问题和椭圆曲线Deffie-Hellman问题是ECC中最可靠的加密技术。 ECC的优点是与其他公钥算法相比,它需要较短的密钥长度。因此,由于其效率以及有限的计算和通信开销,使其在诸如智能卡之类的低端系统中使用。我们介绍了基于椭圆曲线密码学的新签密方案。所提出方案的安全性基于椭圆曲线离散对数问题(ECDLP)和椭圆曲线Diffie-Hellman问题(ECDHP)。所提出的方案提供了各种所需的安全性要求,例如机密性,真实性,不可否认性和前向安全性以及选定的密文攻击和不可伪造性。

著录项

  • 作者

    Nayak B;

  • 作者单位
  • 年度 2014
  • 总页数
  • 原文格式 PDF
  • 正文语种
  • 中图分类

相似文献

  • 外文文献
  • 中文文献
  • 专利

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号