Pairing Free Identity-Based Blind Signature Scheme with Message Recovery
AbstractWith the rapid development of modern technology, personal privacy has become a critical concern in many applications. Various digitalized applications such as online voting systems and the electronic cash systems need authenticity and anonymity. Blind signature is an advanced technique that provides the authenticity and anonymity of the user by obtaining a valid signature for a message without revealing its content to the signer. The message recovery property minimizes the signature size and allows efficient communication in situations where bandwidth is limited. With the advantage of blind signature and message recovery properties, in this paper, we present a new pairing free blind signature scheme with message recovery in Identity-based settings. The proposed scheme is proven to be secure in the random oracle model under the assumption that the Elliptic Curve Discrete Logarithm Problem (ECDLP) is intractable. The proposed scheme meets the security requirements such as blindness, untracebility, and unforgeability. We compare our scheme with the well-known existing schemes in the literature, and the efficiency analysis shows that our scheme is more efficient in terms of computational and communicational point of view. View Full-Text
Share & Cite This Article
James, S.; Gayathri, N.; Reddy, P.V. Pairing Free Identity-Based Blind Signature Scheme with Message Recovery. Cryptography 2018, 2, 29.
James S, Gayathri N, Reddy PV. Pairing Free Identity-Based Blind Signature Scheme with Message Recovery. Cryptography. 2018; 2(4):29.Chicago/Turabian Style
James, Salome; Gayathri, N.B.; Reddy, P. V. 2018. "Pairing Free Identity-Based Blind Signature Scheme with Message Recovery." Cryptography 2, no. 4: 29.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.