一种有效的无证书环签密方案  

Efficient Certificateless Ring Signcryption Scheme

作　　者：孙华[1] 孟坤[2] 

机构地区：[1]安阳师范学院计算机与信息工程学院,安阳455000 [2]清华大学计算机科学与技术系,北京100084

出　　处：《计算机科学》2014年第11期208-211,238,共5页Computer Science

基　　金：国家自然科学基金(U1204402);河南省科技厅科技攻关计划项目(112102210370);河南省教育厅科学技术研究重点项目(14A413014)资助

摘　　要：环签密是一个重要的密码学术语,它结合了加密和环签名的功能,具有保密性、可认证性和匿名性等安全属性。目前已有的无证书环签密方案大都是在随机预言模型下提出的,然而在该模型下可证安全的方案在哈希函数实例化后有时却并不安全。针对这一问题,设计了一个标准模型下可证安全的无证书环签密方案,并通过计算DiffieHellman(CDH)困难问题假设和判定性Diffie-Hellman(DBDH)困难问题假设,证明了方案满足适应性选择密文攻击下的不可区分性以及适应性选择消息攻击下存在的不可伪造性,因而方案是安全有效的。Ring signcryption is an important cryptographic primitive which combines the functions of encryption and ring signature.It can provide confidentiality,authenticity and anonymity simultaneously.At present,most of existing certificateless ring signcryption schemes are proposed in the random oracle,however,they sometimes are proven to be insecure when the hash functions are instantiated.Aiming at this problem,a certificateless ring signcryption scheme was put forward without random oracles in this paper.Meanwhile,it was proven that this scheme satisfies indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message attacks under the computational Diffie-Hellman assumption and decisional Diffie-Hellman assumption,so the scheme is secure and reliable.

关 键 词：环签密 无证书公钥密码体制 CDH问题 DBDH问题 

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