An Identity-Based Blind Signature Scheme with Message Recovery from Pairings

2021 ◽  
pp. 42-55
Author(s):  
Yihong Wen ◽  
Cong Peng ◽  
Shicheng Wang ◽  
Li Li ◽  
Min Luo
Keyword(s):  
Blind Signature ◽  
Signature Scheme ◽  
Message Recovery ◽  
Identity Based

scholarly journals Identity-Based Blind Signature Scheme with Message Recovery

2017 ◽  
Vol 7 (5) ◽  
pp. 2674
Author(s):  
Salome James ◽  
T. Gowri ◽  
G.V. Ramesh Babu ◽  
P. Vasudeva Reddy
Keyword(s):  
Bilinear Pairings ◽  
Point Of View ◽  
Blind Signature ◽  
Signature Scheme ◽  
Research Issue ◽  
Important Research ◽  
Diffie Hellman ◽  
Message Recovery ◽  
Real World Applications ◽  
Identity Based

<p>Blind signature allows a user to obtain a signature on a message without revealing anything about the message to the signer. Blind signatures play an important role in many real world applications such as e-voting, e-cash system where anonymity is of great concern. Due to the rapid growth in popularity of both wireless communications and mobile devices, the design of secure schemes with low-bandwidth capability is an important research issue. In this paper, we present a new blind signature scheme with message recovery in the ID-based setting using bilinear pairings over elliptic curves. The proposed scheme is unforgeable with the assumption that the Computational Diffie-Hellman problem is hard. We compare our scheme with the related schemes in terms of computational and communicational point of view.</p>

scholarly journals Pairing Free Identity-Based Blind Signature Scheme with Message Recovery

Cryptography ◽  
2018 ◽  
Vol 2 (4) ◽  
pp. 29 ◽  
Author(s):  
Salome James ◽  
N.B. Gayathri ◽  
P. Vasudeva Reddy
Keyword(s):  
Rapid Development ◽  
Discrete Logarithm ◽  
Modern Technology ◽  
Blind Signature ◽  
Security Requirements ◽  
Signature Scheme ◽  
Personal Privacy ◽  
Advanced Technique ◽  
Message Recovery ◽  
Identity Based

With 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.

scholarly journals An Identity-Based Blind Signature Scheme Using Lattice with Provable Security

2020 ◽  
Vol 2020 ◽  
pp. 1-12
Author(s):  
Quanrun Li ◽  
Chingfang Hsu ◽  
Debiao He ◽  
Kim-Kwang Raymond Choo ◽  
Peng Gong
Keyword(s):  
Quantum Computer ◽  
Rapid Development ◽  
Random Oracle Model ◽  
Random Oracle ◽  
Mean Value ◽  
Blind Signature ◽  
Signature Scheme ◽  
Practical Applications ◽  
Universal Quantum ◽  
Identity Based

With the rapid development of quantum computing and quantum information technology, the universal quantum computer will emerge in the near decades with a very high probability and it could break most of the current public key cryptosystems totally. Due to the ability of withstanding the universal quantum computer’s attack, the lattice-based cryptosystems have received lots of attention from both industry and academia. In this paper, we propose an identity-based blind signature scheme using lattice. We also prove that the proposed scheme is provably secure in the random oracle model. The performance analysis shows that the proposed scheme has less mean value of sampling times and smaller signature size than previous schemes. Thus, the proposed scheme is more suitable for practical applications.

Identity-Based Xtr Blind Signature Scheme

2013 ◽  
Vol 19 (2) ◽  
pp. 143-149
Author(s):  
Qiaoying Tang ◽  
Fengxian Shen
Keyword(s):  
Blind Signature ◽  
Signature Scheme ◽  
Identity Based

scholarly journals Efficient Identity-based Signature Scheme with Message Recovery

2019 ◽  
Vol 1344 ◽  
pp. 012016 ◽  
Author(s):  
Salome James ◽  
P Vasudeva Reddy
Keyword(s):  
Signature Scheme ◽  
Message Recovery ◽  
Identity Based

Secure and Efficient Certificateless Signature and Blind Signature Scheme from Pairings

2013 ◽  
Vol 457-458 ◽  
pp. 1262-1265
Author(s):  
Min Qin Chen ◽  
Qiao Yan Wen ◽  
Zheng Ping Jin ◽  
Hua Zhang
Keyword(s):  
Random Oracle Model ◽  
Public Key Cryptography ◽  
Random Oracle ◽  
Blind Signature ◽  
Public Key ◽  
Signature Scheme ◽  
Signature Schemes ◽  
Diffie Hellman ◽  
Identity Based ◽  
Certificateless Signature

Based an identity-based signature scheme, we givea certificateless signature scheme. And then we propose a certificateless blind signature (CLBS) scheme in this paper. This schemeis more efficient than those of previous schemes by pre-computing the pairing e (P, P)=g. Based on CL-PKC, it eliminates theusing of certificates in the signature scheme with respect to thetraditional public key cryptography (PKC) and solves key escrowproblems in ID-based signature schemes. Meanwhile it retains themerits of BS schemes. The proposed CLBS scheme is existentialunforgeable in the random oracle model under the intractabilityof the q-Strong Diffie-Hellman problem.

Sign in / Sign up

Export Citation Format

Share Document