Provably Secure Identity-Based Aggregate Signature Scheme
Provably Secure Identity-Based Aggregate Signature Scheme
复制标题
DOI：
10.1109/cyberc.2012.30
复制
发表时间：
2012-10
期刊：
影响因子：
--
通讯作者：
J. Kar
中科院分区：
文献类型：
--
作者：
J. Kar
本文提出了一种高效、安全的基于身份的随机预言机在线和离线聚合签名方案。聚合签名提供了一种将n个不同消息的n个不同签名组合成一个恒定长度的签名的技术。所提出的方案可以在无线传感器网络应用中实现。所提出方案的安全性基于打破双线性 Diffie-Hellman 问题（BDHP）的难度。在求解 BDHP 计算不可行的假设下，该方案在随机预言模型中是安全的。在自适应选择身份和自适应选择消息攻击下是存在不可伪造的。在线/离线签名方案中，签名过程可以分为两个阶段。第一阶段离线执行，独立于要签名的特定消息，而第二阶段在消息呈现后在线执行。
This paper proposes an efficient and secure identity based online and off-line aggregate signature scheme with random oracles. An aggregate signature privides a technique for combining n differents signatures of n different messages into one signature of constant length. The proposed scheme can be implimentated on Wireless Sensor Networks application. Security of the proposed scheme is based on difficulty of breaking Bilinear Diffie-Hellman problem (BDHP). The scheme is secure in random oracle models under the assumption of computational infeasibility of solving BDHP. It is existential unforgerable under adaptive-chosen-identity and adaptive-chosen-message attack In On-line/Off-line signature scheme, the signing process can be broken into two phases. The first phase, performed off-line, is independent of the particular message to be signed, while the second phase is performed on-line, once the message is presented.