检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]Department of Computer Science and Engineering,Shanghai Jiaotong University [2]College of Science,Hohai University [3]Department of Computer Science,Jinan University
出 处:《Journal of Shanghai Jiaotong university(Science)》2010年第6期657-661,共5页上海交通大学学报(英文版)
基 金:the National Natural Science Foundation of China (Nos. 60773092,60873229,60903178 and 60672072);the Zhejiang Provincial Natural Science Foundation of China (No. Y106505);the Fundamental Research Funds for the Central Universities (No. 2010B09614);the Foundation of Hohai University (No. 2084/409265)
摘 要:The only known construction of key-insulated signature(KIS) that can be proven secure in the standard model is based on the approach of using double signing. That is,the scheme requires two signatures:a signature with a master key and a signature with the signer's secret key. This folklore construction method leads to an ineffcient scheme. Therefore it is desirable to devise an effcient KIS scheme. We present the first scheme with such a construction. Our construction derives from some variations of the Waters' signature scheme. It is computationally effcient and the signatures are short. The scheme is provably secure based on the diffculty of computational Diffe-Hellman(CDH) problem in the standard model.The only known construction of key-insulated signature (KIS) that can be proven secure in the standard model is based on the approach of using double signing. That is, the scheme requires two signatures: a signature with a master key and a signature with the signer's secret key. This folklore construction method leads to an inefficient scheme. Therefore it is desirable to devise an efficient KIS scheme. We present the first scheme with such a construction. Our construction derives from some variations of the Waters' signature scheme. It is computationally efficient and the signatures are short. The scheme is provably secure based on the difficulty of computational Diffie-Hellman (CDH) problem in the standard model.
关 键 词:KEY-INSULATED KEY EXPOSURE standard model BILINEAR PAIRING
分 类 号:TP309[自动化与计算机技术—计算机系统结构]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.117.101.130