NGBDHA在无证书公钥密码体系中的应用  

Application of NGBDH computational complexity assumption for certificateless public key cryptography

作　　者：钱雪忠[1] 王旭[1,2] 

机构地区：[1]江南大学信息工程学院,江苏无锡214122 [2]江南大学外国语学院,江苏无锡214122

出　　处：《计算机工程与设计》2009年第3期557-560,共4页Computer Engineering and Design

基　　金：江苏省自然科学基金项目(bk2003017);教育部网络教育安全强认证技术专项基金项目(教技[2001]740号)

摘　　要：分析了不基于配对的广义双线性Diffie-Hellman计算复杂性假设,将其典型应用在一到两个无证书公钥密码方案的安全性证明上,在证明了以前没有证明或证明有误的无证书公钥密码方案的安全性的同时,引出了一个方法论结论,为一类无证书公钥密码体系的安全证明提供了一种独特的思路。A novel computational complexity assumption, called non-pairing based generalized bilinear Diffie-Hellman assumption is analyzed, and then it is typically applied to the security proof of one or two certificateless public key cryptographic schemes. A methodological conclusion is drawn while demonstrating the security of the schemes which have not been proved or have not been proved correctly, and a distinctive way of security proof for some kind of certificateless public key cryptography schemes is provided.

关 键 词：无证书公钥密码 计算复杂性假设 安全模型 安全证明 配对 

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