Efficient ID-based multiproxy multisignature without bilinear maps in ROM |
| |
Authors: | Namita Tiwari Sahadeo Padhye Debiao He |
| |
Affiliation: | 1. Department of Mathematics, Motilal Nehru National Institute of Technology, Allahabad, India 2. School of Mathematics and Statistics, Wuhan University, Hubei Province, 430072, People’s Republic of China
|
| |
Abstract: | Most of the previously proposed identity-based multiproxy multisignature (IBMPMS) schemes used pairings in their construction. But pairing is regarded as an expensive cryptographic primitive in terms of complexity. The relative computation cost of a pairing is approximately more than ten times of the scalar multiplication over elliptic curve group. So, to reduce running time, we first define a model of a secure MPMS scheme, then propose an IBMPMS scheme without using pairings. We also prove the security of our scheme against chosen message attack in random oracle model. Our scheme’s construction avoids bilinear pairing operations but still provides signature in the ID-based setting and reduces running time heavily. Therefore, proposed scheme is more applicable than previous schemes in terms of computational efficiency for practical applications. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|