可证安全的无证书两方认证密钥协商协议  

Certificateless Two-party Authenticated Key Agreement Protocol With Provable Security

作　　者：舒剑[1,2] 

机构地区：[1]江西财经大学电子商务系,南昌330013 [2]电子科技大学计算机科学与工程学院,成都611731

出　　处：《小型微型计算机系统》2012年第9期2056-2063,共8页Journal of Chinese Computer Systems

基　　金：国家"八六三"高技术研究发展计划项目(2009AA012415)资助

摘　　要：研究无证书公钥密码系统中两方认证密钥协商协议问题.现有的无证书认证密钥协商协议大多被证明是不安全的,或者要求较大的计算量.基于Cash,Kiltz和Shoup提出的双Diffie-Hellman问题,设计了一个高效的两方无证书认证密钥协商协议.为构造双Diffie-Hellman问题的有效的判定预言,给出了产生部分私钥的通用方法.通用方法采用一个主私钥和两个哈希函数,然后将这种方法应用到协议的设计中.和其它可证安全的无证书认证密钥协商协议相比,新协议在消息带宽相同的情况下,降低了计算复杂度.并在随机预言模型中不借助于Gap假设证明了协议的安全性.This paper studies two-party authenticated agreement protocol in the certificateless public setting. Most of existing schemes either are proved insecure or have computation burden. Basesd on twin Diffie-Hellman problem introduced by Cash, Kiltz and Shoup, an efficient certificateless authenticated two-party key agreement protocol using bilinear pair is proposed. To construct an effective de- cision oracle for twin Diffie-Hellman problem, generic method of extracting partial private key is proposed, the method, with one master key and two hash functions, is applied to the design of protocol. When compared with other schemes with provable security, the proposed scheme, with the same message bandwidth, achieve efficiency in computational cost. The security of the proposed scheme has been proven in the random oracle model without Gap assumption.

关 键 词：认证 密钥协商 无证书密码学 双线性映射 可证明安全 随机预言机模型 

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