ID Based Signcryption Scheme in Standard Model

Abstract

Abstract. Designing an ID based signcryption scheme in the standard model is among the most interesting and important problems in cryptography. However, all the existing systems in the ID based setting, in the standard model, do not have either the unforgeability property or the indistinguishability property or both of them. In this paper, we present the first provably secure ID based signcryption scheme in the standard model with both these properties. The unforgeability property of this scheme is based on the hardness of Computational Diffie-Hellman problem and the indistinguishability property of this scheme is based on the hardness of Decisional Bilinear Diffie-Hellman problem. Our scheme is strongly unforgeable in the strong attack mode called insider security. Moreover, our scheme possess an interesting property called public verifiability of the ciphertext. Our scheme integrates cleverly, a modified version of Waters' IBE and a suitably modified version of the ID based signature scheme in the standard model proposed by Paterson et al. However, our security reductions are more efficient. Specifically, while the security reductions for indistinguishability is similar to the bounds of Waters' scheme, the unforgeability reductions are way better than the bounds for Paterson et al.'s scheme.

PSSCC: Provably secure communication framework for crowdsourced industrial Internet of Things environments

“…Therefore, Yu et al 38 scheme costs 7 t p +1 t i +4 t e ≈18.648 milliseconds, Jin et al 49 scheme costs 6 t p +4 t e +1 t i ≈16.163 milliseconds, Selvi et al 50 scheme costs 7 t p +8 t e +1 t i ≈19.892 milliseconds, Li et al 39 scheme costs 7 t p +8 t e + t i ≈19.892 milliseconds, Wei et al 40 scheme costs 6 t e +4 t p +1 t i ≈11.735 milliseconds, Luo and Wan 42 scheme costs 5 t p +5 t e +1 t i ≈13.984 milliseconds, Zhou et al 41 scheme costs 6 t e +4 t p + t i ≈11.735 milliseconds, Karati et al 43 scheme costs 6 t e +2 t p +2 t i + t h ≈6.858 milliseconds, and proposed scheme costs 4 t e +2 t p +1 t i +1 t h ≈6.127 milliseconds (see Figure 5), respectively.…”

“…Moreover, Yu et al scheme 38 takes 4 t e + t p cost during signcryption and 6 t p +1 t i costs during unsigncryption, Jin et al scheme 49 costs during signcryption 4 t e and costs during unsigncryption 6 t p +1 t i , Selvi et al scheme 50 costs during signcryption 6 t e + t p and costs during unsigncryption 2 t e +6 t p +1 t i , Li et al scheme 39 costs during signcryption and costs during unsigncryption 6 t e + t p , Wei et al scheme 40 costs during signcryption 6 t e and costs during unsigncryption 4 t p +1 t i , Luo and Wan's scheme 42 costs during signcryption 3 t e + t p and costs during unsigncryption 2 t e +4 t p +1 t i , Zhou et al scheme 41 costs during signcryption 5 t e and costs during unsigncryption 1 t e +4 t p + t i , Karati et al scheme 43 costs during signcryption 4 t e + t h and costs during unsigncryption 2 t e +2 t p +2 t i + t h , and proposed PSSCC scheme costs during signcryption 3 t e + t h and costs during unsigncryption 1 t e +2 t p +1 t i + t h , respectively.…”

Secure sharing of Personal Health Records in cloud computing: Ciphertext-Policy Attribute-Based Signcryption

“…Our model is motivated by the notion of selective-ID game in [11,32,33,34,35]. We modify their definitions slightly to CP-ABSC.…”

A provably secure, shortest, and efficient identity based signcryption technique in the standard model

“…where hashing size is 160 bits, Z * q size is 1024 bits, E sym usually takes 128 bits, message takes 128 bits,  2 size is 1024 bits, and  1 160 bits. Moreover, we have compared the cost of related protocols 2,7,9,10,[12][13][14] with the proposed design shown in Figure 3.…”

“…The number of operations used in different phases is discussed in Table 1. Yu et al's 2 costs 4t e + t p signcryption phase and it costs 6t p + 1t i unsigncryption phase, Jin et al's 13 costs 4t e signcryption phase, and costs 6t p + 1t i unsigncryption phase, Selvi et al's 14 costs 6t e + t p signcryption phase, and costs 2t e + 6t p + 1t i unsigncryption phase, Li and Takagi's 7 costs 6t e + t p unsigncryption phase, Wei et al's 12 costs 6t e signcryption phase, and costs 4t p + 1t i unsigncryption phase, Karati et al 9 costs 4t e + t h and 2t e + 2t p + 2t i + t h and proposed design costs 3t e + t h and 1t e + 2t p + 1t i + t h in signcryption and unsigncryption phases (see Figure 4), respectively. In this section, we use the widely used NS-3 simulator to test the proposed system in order to compute various network performance parameters.…”