Proxy Signcryption Scheme Research Articles

An efficient online/offline heterogeneous proxy signcryption for secure communication in UAV networks

The rapid growth of the Internet of Things (IoT) has led to an increased deployment of unmanned aerial vehicles (UAVs) across various sectors. However, efficiency and security issues are persistently among the primary challenges in UAV networks. In addition, significant communication delays can occur when UAVs perform remote tasks far from a command center (CC); in some cases, they may be unable to communicate with the CC. To address these challenges, in this paper, an efficient online/offline heterogeneous proxy signcryption scheme for secure communication in UAV networks (HOOPSC) is proposed. This scheme enables the CC in a certificateless cryptosystem (CLC) environment to delegate a nearby ground control station (GCS) to act as an agent, and directly send commands to the UAV within an identity-based cryptosystem (IBC) when the UAV undertakes remote tasks far from the CC. The UAV then decrypts and verifies commands for authenticity and confidentiality. In the proposed scheme, the signcryption process is split into offline and online phases, with most of the heavy computations conducted without the availability of the messages during the offline phase. Only light computations are performed in the online phase when a message is available. Moreover, a formal security proof is given in a random oracle model. Finally, a performance analysis reveals that HOOPSC outperforms existing relevant schemes, making it ideal for long-range operations in UAV networks.

A Resource-Friendly Certificateless Proxy Signcryption Scheme for Drones in Networks beyond 5G

Security and privacy issues were long a subject of concern with drones from the past few years. This is due to the lack of security and privacy considerations in the design of the drone, which includes unsecured wireless channels and insufficient computing capability to perform complex cryptographic algorithms. Owing to the extensive real-time applications of drones and the ubiquitous wireless connection of beyond 5G (B5G) networks, efficient security measures are required to prevent unauthorized access to sensitive data. In this article, we proposed a resource-friendly proxy signcryption scheme in certificateless settings. The proposed scheme was based on elliptic curve cryptography (ECC), which has a reduced key size, i.e., 80 bits, and is, therefore, suitable for drones. Using the random oracle model (ROM), the security analysis of the proposed scheme was performed and shown to be secure against well-known attacks. The performance analysis of the proposed scheme was also compared to relevant existing schemes in terms of computation and communication costs. The findings validate the practicability of the proposed scheme.

A proxy signcryption scheme for secure sharing of industrial IoT data in fog environment

A proxy signcryption scheme for secure sharing of industrial IoT data in fog environment

Certificateless Proxy Signcryption in the Standard Model for a UAV Network

As we all know, the random oracle model (ROM) is a simulation of the hash function and cannot replace the actual computation of hash function and the public-key cryptography scheme, which was proved to be secure in ROM may be insecure when instantiating random oracles with concrete hash functions in practical applications. So far as we know, certificateless proxy signcryption (CLPSC) scheme’s security is only proved by applying ROM. Therefore, it is quite important to construct a CLPSC scheme in the standard model (SM). In this article, we propose the first CLPSC scheme in SM, which can achieve public verifiability and we prove that this scheme is EUF-CMA-CLPSC security and IND-CCA-CLPSC security against type I adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {A}_{I}$ </tex-math></inline-formula> and Type II adversary <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$\mathcal {A}_{II}$ </tex-math></inline-formula> . Additionally, we compare our scheme’s performance with several previous schemes’ performance in terms of calculation, communication, and security. The results show that our CLPSC scheme has better security performance, which is suitable for a unmanned aerial vehicle network.

A proxy signcryption scheme for secure sharing of industrial IoT data in fog environment

A proxy signcryption scheme for secure sharing of industrial IoT data in fog environment

A Secure and Efficient Identity based Proxy Signcryption Scheme for Smart Grid Network

A Secure and Efficient Identity based Proxy Signcryption Scheme for Smart Grid Network

Support Outsourcing Unsigncryption and Member Revocation Identity-based Proxy Signcryption Scheme with Drone Environment

The identity-based signcryption scheme combines the advantages of the signcryption scheme and the identity-based cryption scheme, which has high calculation and communication efficiency and easy key management. In order to effectively solve the problems of high latency and data information privacy during the secure transmission of drone data to cloud servers, we propose an identity-based proxy signcryption scheme that supports outsourcing decryption and member revocation. The complex bilinear pairing calculation is outsourced to the cloud server to reduce the user’s computing overhead. When an illegal user wants to access the data, the illegal user’s identity value ID will be put into the revocation list and the update private key algorithm is executed to generate an update password for the unrevoked user Key, revoked users lose the ability to decrypt because they cannot obtain the updated key that matches them. The identity-based signcryption scheme protected by the proxy can satisfy unforgeability and forward security. Finally, the comparison results show that this solution is superior to previous work in terms of function and calculation time.

A lightweight and provable secure identity-based generalized proxy signcryption (IBGPS) scheme for Industrial Internet of Things (IIoT)

Recently, the Industrial Internet of Things (IIoT) has become increasingly important for applications in the industry. IIoT has essentially become a prime security focus for implementing secure communication. Among the available cryptographic tools, identity-based signcryption provide a sound solution to fulfill the security requirement of IIoT. On the other hand a generalized proxy signcryption can work adaptively as proxy signature and proxy signcryption using a single algorithm. In order to accomplish effective and on-time communication whenever the manager of the company went out for a usual business trip or an IIoT device which has lack of resources, then it must need to delegate her/his signcryption rights to their subordinates (proxy agents/device). For this purpose, to make the delegation procedure more efficient and reliable, we proposed a lightweight identity-based generalized proxy signcryption (IBGPS) scheme for IIoT. The IBGPS scheme is provably secure in terms of indistinguishability against adaptive chosen ciphertext attack (IND − IBGPS − CCA) and existential unforgeable against a possible adaptive chosen message attack (EUF − IBGPS − CMA) under Hyperelliptic Curve Decisional Diffie-Hellman problem (HEDHP) and Hyperelliptic Curve Discrete Logarithm problem (HECDLP) in the random oracle model. Furthermore the performance evaluation in terms of computation and communication costs shows that the IBGPS scheme is more effective than the existing schemes.

Securing Internet of Drones With Identity-Based Proxy Signcryption

Internet of Drones (IoD) is a decentralized networking architecture that makes use of the internet for uniting drones to enter controlled airspace in a coordinated manner. On the one hand, this new clan of interconnected drones has ushered in a new era of real-world applications; Small drones, on the other hand, are generally not designed with security in mind, making them exposed to fundamental security and privacy concerns. Limited computing capabilities, along with communication over an open wireless channel, exacerbate these challenges, making the IoD unfeasible for secure operations. In this article, we propose an identity-based proxy signcryption scheme to address these issues. During data transfer between drones and to the cloud server, the proposed scheme supports outsourcing decryption and member revocation. The proposed scheme is based on the notion of Hyper Elliptic Curve Cryptography (HECC), which improves network computation efficiency. We use formal security analysis with the Random Oracle Model (ROM) to evaluate security toughness. The performance analysis of the proposed scheme has also been reviewed in terms of computation and communication costs with the relevant existing schemes. The results obtained from both the security and performance analyses affirm the superiority of the proposed scheme.

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

Proxy signcryption is essential security primitive for emerging secure communication such as e-business, mobile agents, online voting, contract signing, and online auction. It combines the functionality of a proxy signature and encryption to achieve basic security features maintaining a low computational and communicational cost. Ming proposed Proxy Signcryption (PSC) scheme in the standard computational model, claimed it to be secured against: (1) Indistinguishable Chosen Ciphertext Attack (IND-CCA) under the Decisional Bi-linear Diffie-Hellman (DBDH) assumption (2) Existentially Unforgeable Chosen Message Attack (EUF-CMA) under the Computational Diffie Hellman (CDH) assumption. This paper first provides a security analysis to check the correctness and validity of the said PSC scheme. Furthermore, it proves PSC is vulnerable to the launched cryptanalysis attacks. It is established that the PSC is neither semantically secured against IND-CCA nor existentially secured against EUF-CMA in its defined security model. Secondly, we propose an improved new proxy signcryption scheme (N-PSC) based on Elliptic Curve Cryptosystem (ECC) without bi-linear pairing secure against IND-CCA and EUF-CMA for Type-1 adversary A 1 in the standard computational model. It is also proved that the new proposed N-PSC scheme achieves an extra security property of judge verification in case of signature dispute between the proxy correspondents, as well as it outperforms the existing states of the art schemes including the Ming scheme in terms of cost efficiency which makes the new proposed scheme suitable for scarce resources constraint proxy enabled communication applications.

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

Electronic prescription (E-prescription) is an emerging technology that allows health practitioners (doctors, physicians, pharmacists, or nurses) to electronically transmit prescriptions to pharmacies. E-prescription systems allow doctors to avoid traditional medical practices in which prescriptions are sent manually in handwritten form. Additionally, in cases in which a patient may not be able to collect the medication in person due to physical disabilities, the medications can be delivered to the patient's home directly. Furthermore, payments can also be made online (e.g., using credit cards or bank transfers). However, these distinctive features require a series of guidelines for the successful deployment of the E-prescription system due to stringent legal requirements and privacy regulations. Two major security requirements i.e. confidentiality and authentication need to be addressed. In general, the solution to ensuring confidentiality and authentication lies in the combination of both the encryption and digital signature functions in a single logic step called signcryption. Therefore, in this article, we present a lightweight and provable secured certificate-based proxy signcryption (CB-PS) scheme for e-prescription systems. The formal security verification uses the Automated Validation of Internet Security Protocols and Applications (AVISPA) tool along with informal security analysis, which authenticates that the proposed CB-PS scheme can potentially be implemented in resource-constrained low-computing electronic devices in E-prescription systems.

MPKC-based Threshold Proxy Signcryption Scheme

The threshold proxy signcryption can implement signature and encryption simultaneously in one logical step, and can be used to realize the decentralized protection of the group signature key, so it is an efficient technology for network security. Currently, most of the existing threshold proxy signcryption schemes are designed based on the traditional public key cryptosystems, and their security mainly depends on the difficulty of the large integer decomposition and the discrete logarithm. However, the traditional public key cryptosystems cannot resist the quantum computer attack, which makes the existing threshold proxy signcryption schemes based on traditional public key cryptosystems insecure against quantum attacks. Motivated by these concerns, we proposed a threshold proxy signcryption scheme based on Multivariate Public Key Cryptosystem (MPKC) which is one of the quantum attack-resistent public key algorithms. Under the premise of satisfying the threshold signcryption requirements of the threshold proxy, our scheme can not only realize the flexible participation of the proxy signcrypters but also resist the quantum computing attack. Finally, based on the assumption of Multivariate Quadratic (MQ) problem and Isomorphism Polynomial (IP) problem, the proof of the confidentiality and the unforgeability of the proposed scheme under the random oracle model is given.

Construction of Certificateless Proxy Signcryption Scheme From CMGs

As a cryptography primitive for secure data transmission, certificateless proxy signcryption (CLPS) allows an original signcrypter to entrust his signing authority to a proxy signcrypter for signing specified message on his behalf. In this paper, we combine CLPS with cyclic multiplication groups (CMGs) to construct a new certificateless proxy signcryption scheme from CMGs (CMGs-CLPSS). CMGs-CLPSS will receive significant attention because it simplifies the traditional public key cryptosystem (PKC) and solves the key escrow issue suffered by identity-based public key cryptosystem (IB-PKC). In CMGs-CLPSS, an encrypted message can only be decrypted by a designated receiver who is also responsible for verifying the message; moreover, if a later dispute over repudiation occurs, the designated receiver can readily announce ordinary CLPS for public verification without any extra computation effort. CMGs-CLPSS is proved to have the indistinguishability under adaptive chosen-ciphertext attacks (IND-CCA2 security) and existential unforgeability under adaptive chosen-message attacks (UF-CMA security) in the random oracle model. CMGs-CLPSS outperforms the existing schemes on the basis of computational complexity and is suitable for applications in digital contract signing and online proxy auction, and so on.

An Efficient and Provably-Secure Certificateless Proxy-Signcryption Scheme for Electronic Prescription System

Electronic prescription is increasingly popular in our society, particularly in technologically advanced countries. Due to strict legal requirements and privacy regulations, authorization and data confidentiality are two important features in electronic prescription system. By combining signature and encryption functions, signcryption is an efficient cryptographic primitive that can be used to provide these two features. While signcryption is a fairly established research area, most signcryption schemes proposed recently have several limitations (e.g., high communication costs, limited bandwidth, and insecurity), and designing secure and practical signcryption schemes remains challenging. In this paper, we propose an improved certificateless proxy signcryption (CLPSC) scheme, based on elliptic curve cryptography (ECC). We also demonstrate that the proposed CLPSC scheme is secure in the random oracle model and evaluate its performance with related schemes. The security and performance evaluations show that the proposed CLPSC scheme can potentially be implemented on resource-constrained low-computing mobile devices in an electronic prescription system.

Cryptanalysis and improvement of certificateless proxy signcryption scheme for e-prescription system in mobile cloud computing

Certificateless proxy signcryption (CLPSc) is one of the most efficient security primitives for secure data transmission. The entrustment of signing rights to a proxy signcrypter at the behest of an original signcrypter imparts its utility in various fields such as an online proxy auction, healthcare industry, cloud computing, mobile-agents, ubiquitous computing, etc. Unlike the traditional sign-then-encrypt approach, signcryption primitive saves computational costs and bandwidth load. Recently, a pairing-free CLPSc scheme has been proposed which claims to be secure against forgery under adaptive chosen-message attacks. This paper unveils that the aforementioned scheme has failed to provide unforgeability. As an improvement of their scheme, a novel pairing-free certificateless proxy signcryption scheme using elliptic curve cryptography (ECC) has been proposed for e-prescription system in mobile cloud computing. The proposed scheme is proven to be secure against indistinguishability under adaptive chosen-ciphertext attack and existential forgery under adaptive chosen-message attack in the random oracle model against Type 1 and Type 2 adversaries through formal analysis. The proposed scheme outperforms the existing schemes in terms of computational efficiency making it suitable for futuristic mobile cloud computing applications.

A Novel Proxy Signcryption Scheme and its Elliptic Curve Variant

A Novel Proxy Signcryption Scheme and its Elliptic Curve Variant

A secure anonymous proxy signcryption scheme

Abstract We introduce a new cryptographic primitive identity-based anonymous proxy signcryption which provides anonymity to the proxy sender while also providing a mechanism to the original sender to expose the identity of the proxy sender in case of misuse. We introduce a formal definition of an identity-based anonymous proxy signcryption (IBAPS) scheme and give a security model for it. We also construct an IBAPS scheme and prove its security under the discrete logarithm assumption and computational Diffie–Hellman assumption. Moreover, we do an efficiency comparison with the existing identity-based signcryption schemes and anonymous signcryption schemes and show that our scheme is much more efficient than those schemes, we also compare the efficiency of our scheme with the available proxy signcryption schemes and show that our scheme provides anonymity to the proxy sender at cost less than those of existing proxy signcryption schemes.

Notes on Proxy Signcryption and Multi-proxy Signature Schemes

Proxy signcrytipn scheme allows an original signer to dele- gate his signing power to a proxy such that the latter can signcrypt a message on behalf of the former. Recently, Lin et al. [10, 11] proposed a proxy signcryption with CCA and CMA security. Jin and Wen et al. [8, 12, 13] proposed a multi-proxy signature scheme in certificate-less setting. In this work, we indicate that the Lin et al.'s proxy signcryption scheme does not hold the security of indistinguishability against adaptive chosen-ciphertext attacks and existential unforgeability against adaptive chosen-message attacks. Also, we show that the Jin-Wen's certificateless multi-proxy signature scheme does not hold the security of existential unforgeability against adaptive chosen-message attacks.

A post-quantum communication secure identity-based proxy-signcryption scheme

Proxy-signcryption is a variation of an ordinary signcryption scheme and has been used in many applications where the delegation of rights is quite common. In a proxy-signcryption scheme, an original signcrypter needs to delegate his signcryption capability to a proxy signcrypter to signcrypt messages on behalf of the original signcrypter. By combining the functionalities of proxy signature with identity-based signcryption, in this paper, we propose a novel identity-based proxy-signcryption scheme IBPSC from lattice assumptions in the random oracle model. Meanwhile, the security requirements of our IBPSC scheme have been analysed, and our scheme can even resist quantum computer attacks. Compared with existing IBPSC schemes, our scheme is more secure and more efficient. To the best of our knowledge, there is still no relevant IBPSC scheme based on lattice, which is an interesting stepping stone in the post-quantum cryptographic communication.

A New Certificateless Forward Secure Proxy Signcryption Scheme

This paper proposes a new certificateless forward secure proxy signcryption scheme based on DLP. Compared with other similar schemes, the scheme has overcome key escrow problem in the id-based cryptography and saving certificate problem in PKI cryptography. The scheme has some good nature, such as unforgeability, non-repudiation, strong identifiability, at the same time, it has forward security and verification. Even the adversaries grab the proxy key in the present phase, they can't forge valid previous signcryption.