An efficient procedure for online/offline ID‐based signature using extended chaotic maps and group ring

Abstract

AbstractIn this article, we utilize the notions of extended chaotic maps and group ring to propose an efficient procedure for online/offline identity based (ID‐based) signature. The main purpose of engaging chaotic maps in our procedure is to reduce its computational complexity while maintaining the desired security and the purpose of including algebraic structure of group ring is to shorten the signature. We show that under chosen message attack, our signature procedure is secure under unforgeability of ID‐based short signature. Most of the available online/offline signature procedures allow one time use of the offline preadministered information (offline stockpiling), but the proposed procedure grants multitime usage of the offline stockpiling. Therefore, the offline preadministered information can be reused by the signer in polynomial time. We show that our signature procedure is efficient, fast and provides signature of the small size. Finally, we compare our procedure with the several existing schemes in the literature and discuss its advantages.