Efficient and secure Many-to-One signature delegation

Abstract

We propose an IBPMS scheme from pairings, which is more efficient in the sense of computation and operation time than the existing schemes. We also prove on random oracle that the propose d scheme is secure against existential forgery on adaptive chosen-message and adaptive-chosen ID attack under the k-CAA assumption. Additionally, our scheme fulfills all the security requirements of a proxy signature scheme. Moreover we do an efficiency analysis and show that our scheme is significantly more efficient than the existing IBPMS schemes in the sense of computation and operation time.