Identity-based Signcryption Scheme Research Articles

Identity‐based schemes for a secured big data and cloud ICT framework in smart grid system

AbstractSmart grid is an intelligent cyber physical system (CPS). The CPS generates a massive amount of data for efficient grid operation. In this paper, a big data‐driven, cloud‐based information and communication technology (ICT) framework for smart grid CPS is proposed. The proposed ICT framework deploys hybrid cloud servers to enhance scalability and reliability of smart grid communication infrastructure. Because the data in the ICT framework contains much privacy of customers and important data for automated controlling, the security of data transmission must be ensured. In order to secure the communications over the Internet in the system, identity‐based schemes are proposed especially because of their advantage in key management. Specifically, an identity‐based signcryption (IBSC) scheme is proposed to provide confidentiality, non‐repudiation, and data integrity. For practical purposes, an identity‐based signature scheme is relaxed from the proposed IBSC to provide non‐repudiation only. Moreover, identity‐based schemes are also proposed to achieve signature delegation within the ICT framework. Security of the proposed IBSC scheme is rigorously analyzed in this work. Efficiency of the proposed IBSC scheme is demonstrated with an implementation using modified Weil pairing over an elliptic curve. Copyright © 2016 John Wiley & Sons, Ltd.

A Computational Review of Identity-based Signcryption Schemes

Since 2002, several identity based signcryption schemes have been proposed. The purpose of designing a signcryption scheme is to perform signature and encryption both in one step but at lesser cost than performing signature and then encryption separately. In this paper, we present a literature survey on signcryption schemes for identity based setup. Our primary focus is on the schemes recently developed in standard model as the schemes in random oracle model are not actually practical. We present de- tailed comparison among the schemes based on computation cost, security features and suggest some final recommendation based on some future perspectives.

A novel ID-based multi-domain handover protocol for mesh points in WMNs

Wireless mesh networks (WMNs) provide an efficient and flexible method to the field of wireless networking, but also bring many security issues. A mesh point may lose all of its available links during its movement. Thus, the mesh point needs to handover to a new mesh point in order to obtain access to the network again. For multi-domain WMNs, we proposed a new ID-based signcryption scheme and accordingly present a novel ID-based handover protocol for mesh points. The mutual authentication and key establishment of two mesh points which belong to different trust domains can be achieved by using a single one-round message exchange during the authentication phase. The authentication server is not involved in our handover authentication protocol so that mutual authentication can be completed directly by the mesh points. Meanwhile, the data transmitted between the two mesh points can be carried by the authentication messages. Moreover, there are no restrictions on the PKG system parameters in our proposed multi-domain ID-based signcryption scheme so our handover scheme can be easily applied to real WMNs circumstances. Security of the signcryption scheme is proved in the random oracle model. It shows that our protocol satisfies the basic security requirements and is resistant to existing attacks based on the security of the signcryption. The analysis of the performance demonstrates that the protocol is efficient and suitable for the multi-domain WMNs environment.

A Fuzzy Identity-Based Signcryption Scheme from Lattices

Fuzzy identity-based cryptography introduces the threshold structure into identity-based cryptography, changes the receiver of a ciphertext from exact one to dynamic many, makes a cryptographic scheme more efficient and flexible. In this paper, we propose the first fuzzy identity-based signcryption scheme in lattice-based cryptography. Firstly, we give a fuzzy identity-based signcryption scheme that is indistinguishable against chosen plaintext attack under selective identity model. Then we apply Fujisaki-Okamoto method to obtain a fuzzy identity-based signcryption scheme that is indistinguishable against adaptive chosen ciphertext attack under selective identity model. Thirdly, we prove our scheme is existentially unforgeable against chosen message attack under selective identity model. As far as we know, our scheme is the first fuzzy identity-based signcryption scheme that is secure even in the quantum environment.

A New ID-based Threshold Ring Signcryption without Random Oracles

Signcryption is a cryptographic primitive which could provide authentication and confidentiality simultaneously with a computational cost lower than signing and encryption respectively, while the ring signcryption has anonymity in addition to authentication and confidentiality. In order to design an identity-based threshold ring signcryption, this paper presented an efficient identity-based threshold ring signcryption scheme without random oracles by means of secret sharing and bilinear pairing technique, and gave security analysis of the scheme. In the last, we proved this scheme satisfied indistinguishability against adaptive chosen ciphertext attacks and existential unforgeability against adaptive chosen message and identity attacks in terms of the hardness of DBDH problem and CDH problem.

An ID-based signcryption scheme with compartmented secret sharing for unsigncryption

In this paper the ID-based signcryption scheme of Li, Xin, and Hu is extended to a compartmented scheme. If an organization is partitioned into different compartments, this scheme allows any member of a specific compartment to participate in the unsigncryption; moreover, each member of a compartment has information unique to that individual. This construction is the first (to the authors' knowledge) to combine identity-based encryption, Shamir's threshold scheme, and signcryption into an implementable compartmented sharing scheme.

The Scheme of Identity-Based Aggregation Signcryption in Smart Grid

Smart grid puts forward high requirements for the equipment to access authentication, which achieves openness and real-time performance in mart grid. The users’ identities need to protect, in the meanwhile, identity authentication and data encryption should be efficient. According to the characteristics of smart grid, this paper proposed an identity-based aggregation signcryption scheme which combined pseudonymous ID with batch verification. The scheme adopted the pseudonym technology to achieve the user identity anonymity, and adopted the signcryption to complete digital signature and encryption in one time. This paper presented the aggregation signcryption for different multiple users by dynamic equation, which can compromise the security and computation overhead to meet the requirements of smart grid. This scheme can reduce the computational burden of aggregators with security of communication data. Moreover, this scheme solved the difficult problem of the management of pseudonymous ID, and improved the efficiency of the whole system. Therefore, this scheme meets the requirement of real time and high efficiency in smart grid.

An Efficient Identity-based Signcryption from Lattice

Signcryption is a cryptographic primitive that can provide valid solution for authentication and confidentiality. In this paper, an efficient identity-based signcryption scheme from lattice was proposed. Our scheme based on Macciancio and Piekert’s trapdoor generation method and delegate algorithm for lattice. Our main idea is that establish the identity-based system master key via trapdoor generation method for lattice, and extract user’s key by trapdoor delegate algorithm. With the aid of random oracle, we prove that the proposed scheme has CCA security under the learning with errors (LWE) assumption and unforgeability against adaptive chosen messages attacks under the small integer solution (SIS) assumption. Comparison with signature-then-encryption approach shows that our scheme is efficient.

A NEW CONSTRUCTION OF IDENTITY-BASED SIGNCRYPTION WITHOUT RANDOM ORACLES

Identity-based signcryption is a primitive that combines the functions of identity-based encryption and identity-based signature. In this paper, we first attack two of the existing identity-based signcryption schemes which are claimed to be provably secure without random oracles. Then we construct a new identity-based signcryption scheme and proves its security without random oracles.

Identity-based threshold ring signcryption from pairing

This paper presents an identity-based threshold ring signcryption scheme. With this technique, any group of t entities can choose n - t entities to generate a t-out-of-n signcryption on behalf of the group of n members, yet the actual signcrypters remain anonymous. The scheme is proven to be indistinguishable against adaptive chosen ciphertext attacks, existentially unforgeable against adaptive chosen message and identity attacks, and unconditional signcrypter ambiguity under the random oracle model. To the best of authors' knowledge, the scheme is the first security ID-based threshold ring signcryption scheme.

A Practical Identity-based Signcryption Scheme

In this paper, we construct a new identity-based signcryption scheme from bilinear pairings, which can process arbitrary length plaintexts. The scheme produces shorter ciphertext than the Libert-Quisquater signcryption scheme for the same plaintext and adapts to the bandwidth-constrained scenario very well. It is proved secure against adaptive chosen ciphertext and identity attack based on a variant of the Bilinear Diffie-Hellman problem in the random oracle model.

Certificateless proxy identity-based signcryption scheme without bilinear pairings

Signcryption, which was introduced by ZHENG, is a cryptographic primitive that fulfils the functions of both digital signature and encryption and guarantees confidentiality, integrity and non-repudiation in a more efficient way. Certificateless signcryption and proxy signcryption in identity-based cryptography were proposed for different applications. Most of these schemes are constructed by bilinear pairings from elliptic curves. However, some schemes were recently presented without pairings. In this paper, we present a certificateless proxy identity-based signcryption scheme without bilinear pairings, which is efficient and secure.

Effective and secure identity-based hybrid signcryption scheme

The existing identity-based hybrid signcryption schemes have either known security flaws or higher computational costs.With the vBNN-IBS signature algorithm,a new identity-based hybrid signcryption scheme was proposed.The new scheme,based on the Discrete Logarithm Problem(DLP) and the Computational Diffie-Hellman(CDH) problem on elliptic curve,did not use bilinear operation.So,the total computational costs of the new scheme were effectively reduced,and had only 7 scalar multiplication operations on elliptic curve,which were much lower than the other silimar schemes.In the random oracle model,the new scheme was verified safe enough to achieve the unforgeability and confidentiality.In addition,the paper also pointed out that the Sun et al's scheme(Sun Y X,Li H.Efficient certificateless hybrid signcryption.Journal of Software,2011,22(7):1690-1698) did not satisfy the unforgeability.

Strong Forward Security in Identity-Based Signcryption

Due to the possibility of key exposure, forward security in encryption and signing has been well studied, especially in the identity-based setting where an entity's public key is that entity's name. From an efficiency point of view, one would like to use the signcryption primitive and have the best of both worlds. However, strong forward security, where the adversary cannot signcrypt in sender's name nor designcrypt in receiver's name for past time periods even if it has the secrets of both, requires periodic updating of the secret keys of the users. This is an improvement over signcryption schemes that only protect against designcrypting in the past. In this paper, we propose the first ever strong forward secure identity-based signcryption scheme which has public ciphertext verifiability and a third-party verification protocol.

Identity-Based Proxy Signcryption Schemes

Identity-based encryption and signature schemes that allow any pair of users to communicate securely and to verify each other's signatures without verifying certificate. A signcryption is a primitive that provides the properties of both digital signatures and encryption schemes in a way that is more efficient than signing and encrypting separately. Proxy signature schemes are a variation of ordinary digital signature scheme that allow a proxy signer to sign messages on behalf of the original singer which proxy signcryption simultaneously fulfill both the functions of signature and encryption in a single step with a lower computational cost than that required by the traditional signature-then-encryption. In this paper, we present identity-based proxy signcryption schemes with lower efficient..

An ID-Based Ring Signcryption Scheme for Multiple receivers

An ID-Based Ring Signcryption Scheme for Multiple receivers

Simultaneous authentication and secrecy in identity-based data upload to cloud

Most existing works to secure cloud devote to remote integrity check, search and computing on encrypted data. In this paper, we deal with simultaneous authentication and secrecy when data are uploaded to cloud. Observing that cloud is most interesting to companies in which multiple authorized employees are allowed to upload data, we propose a general framework for secure data upload in an identity-based setting. We present and employ identity-based signcryption (IBSC) to meet this goal. As it is shown that it is challenging to construct IBSC scheme in the standard model and most IBSC schemes are realized in the random oracle model which is regarded weak to capture the realistic adversaries, we propose a new IBSC scheme simultaneously performing encryption and signature with cost less than the signature-then-encryption approach. The identity based feature eliminates the complicated certificates management in signcryption schemes in the traditional public-key infrastructure (PKI) setting. Our IBSC scheme exploits Boneh et al.'s strongly unforgeable signature and Paterson et al.'s identity-based signature. The scheme is shown to satisfy semantic security and strong unforgeability. The security relies on the well-defined bilinear decision Diffie-Hellman (BDDH) assumption and the proof is given in the standard model. With our IBSC proposal, a secure data upload scheme is instantiated with simultaneous authentication and secrecy in a multi-user setting.

Efficient Identity-based Ring Signcryption Scheme in the Standard Model

According to most existing identity-based ring signcryption schemes are based on random oracle model and have too many pairings, a new efficient identity-based ring signcryption scheme is proposed. It can satisfy the unconditional anonymity of the sender by using symmetric encryption algorithm and reduce the pairings by skillfully setting public parameters. Its indistinguishability under adaptive chosen ciphertext attack is proofed by the intractability of the DBDH problem and the unforgeability under adaptive chosen message attack is proved by the intractability of the CDH problem.

An Efficient Identity-based Signcryption Scheme for Ad Hoc Networks

An Efficient Identity-based Signcryption Scheme for Ad Hoc Networks

An Improved Identity-Based Ring Signcryption Scheme

ABSTRACT In this paper, we show that the identity-based ring signcryption scheme suggested by Zhu, Zhang, and Wang (2009) does not reach the security as they claimed it does. To make up for this defect, we propose a rescue scheme and prove the revised scheme is secure under the random oracle model.