A short ID‐based proxy signature scheme

Abstract

Abstract. The notion of identity-based proxy signature with message recovery feature has been proposed to shorten identity-based proxy signatures and improve their communication overhead since signed messages are not transmitted with these kinds of signatures. There are a few schemes for this notion: Singh and Verma's scheme and Yoon et al.'s scheme. Unfortunately, Tian et al. by presenting two forgery attacks show that Singh and Verma's scheme is not secure, and also Yoon et al.'s scheme does not support provable security. The contributions of this paper are twofold. First, we review Yoon et al.'s scheme and discuss why it does not have message recovery property, and consequently it is not short. Second, we propose a short identity-based proxy signature scheme with the help of message recovery property, and show that it is secure under CDH assumption in the random oracle model. Furthermore, our scheme is more efficient than (as efficient as) previous identity-based proxy signatures.Keywords: identity-based signature, identity-based signature with message recovery, identity-based proxy signature, CDH assumption, random oracle model.

Short certificate‐based proxy signature scheme from pairings

“…To compute the costs in miliseconds (ms), we follow the work of Tsai, where the cost of modular multiplication is M =0.1 ms. Thus, from Table the total computation costs of schemes in are 4 e +5 S m +3 H ≈58.0 ms, 4 e +5 S m +5 H ≈60.9 ms, 7 e +7 S m +7 H ≈101.5 ms, 5 e +5 S m +5 H ≈72.5 ms, 4 e +6 S m +1 E ≈76.2 ms and 7 e +3 S m +4 E ≈165.6 ms, respectively. While our scheme consumes 4 e +3 S m +3 H +1 I n v ≈53.36 ms and thus, from Figure , it is obvious that our proposal is more efficient than schemes in the works of Asaar et al, Kang et al, Li et al, Seo et al, Hu et al, and Islam and Biswas …”

“…From Table , it is clear that our scheme presents the shortest signature size 256 bits and resists both the key escrow and public key replacement attacks. However, the schemes by Asaar et al is message recovery PS scheme but with fixed size message. Thus, as far as arbitrary size message is considered our scheme is the shortest.…”

“…Since the work of Shamir, Boneh and Franklin, firstly designed an ID‐based encryption from Weil pairing over super singular elliptic curves and secure under bilinear Diffie‐Hellman (BDH) assumption in the random oracle model (ROM) . In the literature, several ID‐based PS schemes toward various applications were introduced by the research community, but the existence of malicious KGC threw up the challenge of the key escrow problem . In ID‐PKC, KGC knows the secret key of every user, and thus, KGC can use the secret key to decrypt a cipher text or to sign a document.…”

An efficient EAP‐based proxy signature handover authentication scheme for WRANs over TV white space

“…Because the proxy key pair is produced by applying the original signer's signature on the delegation information, any verifier can verify the original signer's agreement from the proxy signature. Since the proposed EPS scheme has integrated the technique of proxy signature, we will introduce the proxy signature's techniques in the literature as follows. Generating Original Parameter Phase: Firstly, let p and q be 2 primes such that q ∣ p − 1.…”

“…This large bandwidth with good propagation characteristics and favorable path loss features can be developed much for unlicensed usage specified by standardization, while the major result is IEEE 802. 22 standard, 3 which can provide protections from harmful interference for PUs operating in TV broadcast bands. By the standard, the SUs need sensing the spectrum temporally and spatially to decide whether it is occupied by the PUs, and vacating the used spectrum once the PUs reclaim the spectrum.…”