Proxy signcryption scheme in the standard model

Abstract

Proxy signcryption is a novel cryptographic primitive that combines the functionality of a proxy signature with that of a signcryption. However, the security of all the known proxy signcryption schemes were proven in the random oracle, which has received a lot of criticism that the proofs in the random oracle model are not sound with respect to the standard model. Hence, it is an interesting research problem on how to construct a provably secure proxy signcryption scheme in the standard model. In this paper, motivated by Waters' signature scheme, we propose a new construction of proxy signcryption scheme based on bilinear pairing without using random oracles. Then, we use the techniques from provable security to show that the proposed scheme is indistinguishability under adaptive chosen ciphertext attacks secure under the decisional bilinear Diffie-Hellman assumption and existentially unforgeable under the computational Diffie-Hellman assumptions. Compared with the existing schemes with formal security proof, we show that no pairing computation is required in our proxy signcrypt phase with pre-computations. To the best of our knowledge, our proposed scheme is the first provably secure proxy signcryption scheme in the standard model.

A Lightweight and Secured Certificate-Based Proxy Signcryption (CB-PS) Scheme for E-Prescription Systems

“…In 2015, Ming and Wang [34], a provable secured PS scheme under the theoretical analysis technique called standard model. However, the scheme is anguish from a number flaws that are it required more computing time due bilinear pairing heavy operations, certificate management issue, need more computing power, requires greater bandwidth space, lack of forward secrecy and lack antireplay attack.…”

Cryptanalysis and Improvement of a Proxy Signcryption Scheme in the Standard Computational Model

“…According to Cao et al [39], processing time unit for per PM is 6.38 ms and for unit E is counted 11.20 ms and one bilinear Pairing BP is 20.01 ms. Here we measure the operational cost of the proposed N-PSC scheme and compare it with the already existing schemes found in literature [23]- [27], [32]. The algorithmic complexity comparison is reflected in Table 2.…”

“…In 2017, Bhatia and Verma [26] pointed out the vulnerability of the scheme [25] and presented an improved scheme as well. Ming and Wang [27] proposed a provable proxy signcryption scheme that is vulnerable and compromisable due to its security lapses. Additionally, the flavor of proxy signcryption (like multiproxy and threshold-proxy) having special functional were also proposed and found in literature [28]- [31].…”

“…PSC secure proxy communication scheme is claimed to be secure against Indistinguishable Chosen Ciphertext Attack (IND-CCA) under the Decisional Bilinear Diffie Hellman (DBDH) assumption, as well as secure against Existentially Unforgeable Chosen Message Attack (EUF-CMA) under the Computational Diffie Hellman (CDH) assumption. This paper proposes to analyze the proxy signcryption scheme in the standard computational model presented by Ming and Wang [27] to check and validate the security vulnerabilities of this scheme by launching the security attack over the said scheme. Moreover, we propose a new improved scheme namely New Proxy Signcryption (N-PSC) based on Elliptic Curve Cryptography (ECC) without bilinear pairing secured against IND-CCA and EUF-CMA for Type-1 adversary A 1 under the standard computational model and we prove that the new propose N-PSC scheme outperforms than the said scheme as well as a few other existing states of the art schemes in terms of cost efficiency and achieves an extra third party verification (i.e., Judge verification J V) security property in case of any signature dispute which make the new propose scheme suitable for scarce resources constraint secure proxy communicational environments.…”

A Novel Proxy Signcryption Scheme and its Elliptic Curve Variant

“…However, a proxy signcryption scheme just solves the problem. Many research works on proxy signcryption have been introduced [19][20][21].…”