An Untraceable Identity-Based Blind Signature Scheme without Pairing for E-Cash Payment System

Kumar, Mahender; Katti, C. P.; Saxena, P. C.

doi:10.1007/978-3-319-73423-1_7

Cited by 10 publications

(6 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We can conclude thanks to our study that the most computationally efficient IDBS scheme using EC is [54]. But schemes can be chosen from other kind of feature such as number of communications, number of blinding factors or the size of the signature.…”

Section: Discussionmentioning

confidence: 80%

“…And again, the best pairing free scheme is 5 times faster than the best pairing based scheme. The complexity of [54] and [35] is close, and the difference might be negligible regarding time needed for cache affectation during the execution of properly implemented scheme. The only advantage is for [35], it uses less random values, but it might be compensated by the lowest complexity of the former scheme.…”

Section: Id-based Blind Signature -Idbsmentioning

confidence: 98%

“…Most schemes rely on pairing function and the CDH problem. Some such as [35,54] are pairing free and consequently faster to execute. Due to the increasing development of post-quantum cryptography, new IDBS schemes have been designed based on the SIS problem.…”

Section: Id-based Blind Signature -Idbsmentioning

confidence: 99%

See 2 more Smart Citations

A Survey on Identity-Based Blind Signature

Koscina¹,

Lafourcade

Marcadet

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Blind signatures are well-studied building blocks of cryptography, originally designed to enable anonymity in electronic voting and digital banking. Identity-based signature were introduced by Shamir in 1984 and gave an alternative to prominent Public Key Infrastructure. An identity-based blind signature (IDBS) allows any user to interact directly with the signer without any prior interaction with a trusted authority. The first IDBS has been proposed in 2002 and several schemes were proposed since then. Seeking for a full comparison of these primitives, we propose a survey on IDBS and list all such primitives that seems to maintain some security. We also classify their security assumptions based on the existing security expectation that have not been formalized yet in the literature. Moreover, we empirically evaluate the complexity of all the operations used in those schemes with modern cryptographic libraries. This allows us to perform a realistic evaluation of their practical complexities. Hence, we can compare all schemes in terms of complexity and signature size.

show abstract

Section: Discussionmentioning

confidence: 80%

Section: Id-based Blind Signature -Idbsmentioning

confidence: 98%

See 1 more Smart Citation

A Survey on Identity-Based Blind Signature

Koscina¹,

Lafourcade

Marcadet

et al. 2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…We take the following cryptographic operations for analysis of the execution cost of the proposed IBS-secPKG system: modular multiplication, bilinear pairing operations, scalar multiplication in ECC, addition in ECC, modular inversion, modular exponentiation, and map-to-point hash function represented as 𝑇 𝑀 , 𝑇 𝐵𝑃 , 𝑇 𝑆𝑀 , 𝑇 𝐴 , 𝑇 𝐼 , 𝑇 𝐸 , and 𝑇 𝐻 respectively. According to the methodology given in [49], [50], we compute the average execution time (in ms) of these operations, summarized in Table 1. In Table 2, we compare the signing and verifying cost of our proposed IBS-secPKG scheme with related schemes such as Karati et al [29], Chen et al [32], Chen et al [33], Sahana et al [36], Shim et al [39], Tseng et al [38], Yang et al [40], Hussain et al [42] and Du et al [43] schemes.…”

Section: Performance Evaluationmentioning

confidence: 99%

Provable Secure Escrow-Free Identity-Based Signature Scheme for Smart City Environment

Kumar

Chand

2022

Preprint

Self Cite

View full text Add to dashboard Cite

Smart city is a concept of digitalizing the ecosystem to solve many urban area issues such as crime reduction, transportation, waste management, and governance. However, the security and threat-related issues are still neglected. This paper presents a secure smart city framework using an identity-based signature (IBS) scheme. It is challenging to employ IBS for a smart city (a large network size) due to its key escrow nature. So, we first proposed an identity-based signature scheme that mitigates the trust on a single private key generator (PKG) by employing multiple authorities to preserve the privacy of user’s private key via threshold cryptography. The system also offloads the key protection overhead to the multiple edge gateway, making the system as efficient as the generic IBS. We demonstrate the proposed scheme is secured against the following required attacks: forgeable attack, user slander attacks, and key abusing attacks assuming the computational Diffie-Hellman problem (CDHP) in the random oracle model (ROM). Additionally, the proposed system allows the recipient to verify multiple message-signature pairs at the least cost. The performance analysis determines the optimal signature size and least computational cost compared to related systems making the proposed system suitable for implementing a secure smart city.

show abstract

“…Besides, this scheme was provably secure in the random oracle model. In 2017, an untraceable ID-based blind signature scheme without pairing for e-cash payment system was proposed by Kumar et al [30]. en, James et al [31] proposed an efficient pairing-free ID-based blind signature scheme with message recovery in 2018.…”

Section: Related Workmentioning

confidence: 99%

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

Hsu

et al. 2020

Mathematical Problems in Engineering

View full text Add to dashboard Cite

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.

show abstract

An Untraceable Identity-Based Blind Signature Scheme without Pairing for E-Cash Payment System

Cited by 10 publications

References 25 publications

A Survey on Identity-Based Blind Signature

A Survey on Identity-Based Blind Signature

Provable Secure Escrow-Free Identity-Based Signature Scheme for Smart City Environment

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

Contact Info

Product

Resources

About