计算机工程

• 安全技术 • 上一篇    下一篇

一种基于身份的服务器辅助验证签密方案

王彩芬,康步荣   

  1. (西北师范大学 计算机科学与工程学院,兰州 730070)
  • 收稿日期:2015-12-28 出版日期:2016-12-15 发布日期:2016-12-15
  • 作者简介:王彩芬(1963—),女,教授、博士生导师,主研方向为云计算、无线传感器网络;康步荣,硕士。
  • 基金项目:
    国家自然科学基金(61163038,61262057,61562077);甘肃省高等学校科研项目(2015B-220)。

An ID-based Server-aided Verification Signcryption Scheme

WANG Caifen,KANG Burong   

  1. (College of Computer Science and Engineering,Northwest Normal University,Lanzhou 730070,China)
  • Received:2015-12-28 Online:2016-12-15 Published:2016-12-15

摘要: 为解决已有基于身份的签密算法效率不高的问题,考虑低端设备计算能力弱的特点,引入服务器辅助验证思想,提出一种服务器辅助验证签密方案,通过服务器完成验证过程中的一些复杂运算,减少算法验证阶段的计算量和运行时间,使得签密算法可应用在低端设备上。基于判定双线性Diffie-Hellman问题及计算的Diffie-Hellman困难问题假设,在随机预言模型中,证明该方案满足不可伪造性和机密性。

关键词: 签密, 基于身份, 服务器辅助验证, 双线性对, 随机预言模型, 不可伪造性

Abstract: In order to improve the efficiency of the existing ID-based signcryption algorithm,taking into consideration the characteristic of low computing power of low-end devices,introducing the idea of server-aided verification,this paper presents a server-aided verification signcryption scheme.Complex operations in the verification process are carried out through the server,which effectively reduces the amount of computation and running time in the validation phase of the algorithm,and makes the application of the algorithm in the low-end device possible.Based on the difficult hypothesis of Decision Bilinear Diffie-Hellman(DBDH) problem and Calculation of Diffie-Hellman(CDH) problem,it proves the scheme meets the unforgeability and confidentiality in random oracle model.

Key words: signcryption, ID-based, server-aided verification, bilinear pairing, random oracle model, unforgeability

中图分类号: