基于椭圆曲线的可证明安全的签密方案1  

Provably Secure Signcryption Scheme Based on Elliptic Curve

作　　者：任艳丽[1] 陆海宁[2] 

机构地区：[1]上海大学通信与信息工程学院,上海200072 [2]上海交通大学信息安全工程学院,上海200240

出　　处：《计算机工程》2011年第15期95-97,105,共4页Computer Engineering

基　　金：中国博士后科学基金资助项目(20100470675);上海市科委基金资助重大项目(10DZ1500200);上海市博士后计划基金资助项目(10R21413200)

摘　　要：签密方案可以同时实现保密和认证,且实现代价小于加密和签名之和,但大多数签密方案都没有严格的安全证明。为此,基于椭圆曲线群上的困难问题提出一个可证明安全的签密方案。方案仅需要一次双线性对运算,实现快速。在标准模型下,证明该方案既具有密文不可区分性与签名不可伪造性,也具有不可否认性、前向安全性和公开可验证性。A signcryption scheme can realize signature and encryption simultaneously, and its cost is smaller than the sum of signature and encryption. However, most signcryption schemes do not have strict security proof. This paper proposes a signcryption scheme based on difficult problems of elliptic curve group. The scheme is efficient and only needs one pair operation. It proves that the scheme is semantic secure and unforgeable in the standard model. Moreover, the scheme has non-repudiation, forward security and public verification.

关 键 词：可证明安全 签密 标准模型 公开可验证性 前向安全性 

分 类 号：TP309[自动化与计算机技术—计算机系统结构]