检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:LI Zichen YAN Yunsheng ZHANG Juanmei
机构地区:[1]Department of Information Security, Beijing Eelctronic Science and Technology Institute, Beijing 100070, China [2]College of Science, Henan University of Technology, Zhengzhou 450052, China [3]Department of Basic Sciences, Beijing Eelctronic Science and Technology Institute, Beijing 100070, China
出 处:《Chinese Journal of Electronics》2008年第4期748-750,共3页电子学报(英文版)
摘 要:In 2004, Libert and Quisquater proposed an identity based undeniable signature scheme using pairings over elliptic curves. In this paper, we show that the scheme is not secure. In other words, if a signer reveal a pair of signature and message,an adversary can forge the signer's signature for arbitrary message. The signature will be confirmed with this protocol, and can not be denied by the signer. More importantly, through this example, we illustrate that the bilinear property of pairings, although is useful for the design of cryptographic schemes, is also a source for security flaws.
关 键 词:ID-based cryptography Undeniable signature Attck Bilinear pairings.
分 类 号:TN918[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.222