An Efficient Multi Recipient Signcryption Scheme Offering Non Repudiation

Signcryption is a cryptographic technique that provides both confidentiality and authenticity of data during public transmission in many modern applications like Internet -of -Things (IoT), Wireless Sensor Networks (WSNs) etc. The functionalities of encryption and Signature can achieve simultaneously through the signcryption with lower computational cost and communication overheads than those of traditional sign-then-encrypt approach. Many signcryption schemes have been constructed by various researchers in different cryptographic frameworks. Certificateless cryptography is one of the recent public key cryptography which eliminates the key escrow problem and complex certificate management problemsin identity based cryptography and traditional public key cryptography respectively. Providing the security and efficiency in many modern applications including IoT and WSNs is a crucial task. In this paper, we proposed new signcryption scheme in certificateless cryptography. This scheme supports the property of public verifiability and is secure against various types of adversaries in the random oracle model with the assumption that the Computational Diffie-Hellman Problem (CDHP) and the Elliptic Curve Discrete Logarithmic Problems (ECDLP) are hard. Due to pairing-free environment the proposed scheme is computationally more efficient than the existing public verifiable signcryption schemes.

Boyen [7] gave the first identity-based (ID-based) signcryption scheme that is forward secure, publicly verifiable as well as provably secure. However, his scheme aims at providing ciphertext unlinkability and anonymity which is not a desirable property in applications such as authentication of encrypted messages by firewalls [11], where any third party should be able to verify the origin of the ciphertext without knowing the content of the message and getting any help from the intended recipient. This requirement is referred as public ciphertext authenticity. In this paper, we give another ID-based signcryption scheme that can provide public ciphertext authenticity and is forward and provably secure as well as publicly verifiable. Our scheme is modified from Libert and Quisquater’s ID-based signcryption scheme [16] and the efficiency of our scheme is comparable to other previous ID-based signcryption schemes.KeywordsIdentity-based signcryptionforward securitypublic verifiabilityprovable securitysemantical securitypublic ciphertext authenticitynetwork securityfirewallspublic key cryptosystemselliptic curve cryptosystemscryptographic primitives

Signcryption is a cryptographic primitive that performs encryption and signature in a single logical step, at lower computational cost and communication over heads than the signature-then-encryption. Proxy signcryption schemes are variations of ordinary signcryption schemes and have been useful in many applications where the delegation of rights is quite common. By combining the functionalities of proxy signature scheme and signcryption scheme, in this paper, we proposed a new ID-based proxy signcryption scheme which offers both public verifiability and forward security. The security requirements and performance of the proposed scheme are analyzed.

With the pervasiveness of the Internet of Things (IoT) and the rapid progress of wireless communications, Wireless Body Area Networks (WBANs) have attracted significant interest from the research community in recent years. As a promising networking paradigm, it is adopted to improve the healthcare services and create a highly reliable ubiquitous healthcare system. However, the flourish of WBANs still faces many challenges related to security and privacy preserving. In such pervasive environment where the context conditions dynamically and frequently change, context-aware solutions are needed to satisfy the users' changing needs. Therefore, it is essential to design an adaptive access control scheme that can simultaneously authorize and authenticate users while considering the dynamic context changes. In this paper, we propose a context-aware access control and anonymous authentication approach based on a secure and efficient Hybrid Certificateless Signcryption (H-CLSC) scheme. The proposed scheme combines the merits of Ciphertext-Policy Attribute-Based Signcryption (CP-ABSC) and Identity-Based Broadcast Signcryption (IBBSC) in order to satisfy the security requirements and provide an adaptive contextual privacy. From a security perspective, it achieves confidentiality, integrity, anonymity, context-aware privacy, public verifiability, and ciphertext authenticity. Moreover, the key escrow and public key certificate problems are solved through this mechanism. Performance analysis demonstrates the efficiency and the effectiveness of the proposed scheme compared to benchmark schemes in terms of functional security, storage, communication and computational cost.

With ever growing popularity, wireless communication system also vulnerable to various security attacks. To provide high level security, many cryptographic solutions have been proposed. One such solution is signcryption, where authenticity and confidentiality provided by single logical step. Therefore, signcryption scheme helps to reduce computational cost, but it is not feasible for resource constraint environments. Because, most of the existing approaches were based on El-Gamal, bilinear pairing, Rivest-Shamir-Adleman (RSA), and Elliptic curve Cryptography (ECC). They consume more energy due to their increased key size. Hence, the new signcryption approach is proposed based on Hyper Elliptic Curve Cryptosystem (HECC) whose key size is much lesser than ECC. It significantly reduces the cost of computation and communication overhead by half the amount of ECC which suits well for resource constraint environments. Further, the proposed scheme attains necessary security features along with forward secrecy and public verifiability. On the other hand, the security of the approach is validated through an automated protocol validation tool – AVISPA.

In recent years, secure communication and privacy‐preserving are gaining popularity because of the advent of wireless network. Certificateless cryptography (CLC) and identity‐based cryptography (IBC) have already been widely applied in the area of wireless network. Hence, to achieve secure communication from CLC to IBC, we present a heterogeneous signcryption scheme that enables a sender in the CLC to transmit a message to multi‐receiver in the IBC. Our scheme has no restrictions on the system parameters and master keys; private key generator and key generating center generate their own system parameters and master key for the IBC users and the CLC user, separately. Considering privacy‐preserving in heterogeneous communication, we show that our scheme can realize the anonymity of all receivers. Compared with other schemes, our scheme has more advantages, such as public verification and decryption fairness, which are attractive for wireless network applications. Moreover, our scheme has the indistinguishability against adaptive chosen ciphertext attacks, the existential unforgeability against adaptive chosen messages attacks, and anonymous indistinguishability of encryptions under selective‐ID, chosen ciphertext attack in the random oracle model. Copyright © 2016 John Wiley & Sons, Ltd.

In this paper, we propose an elliptic curve-based signcryption scheme derived from the standardized signature KCDSA (Korean Certificate-based Digital Signature Algorithm) in the context of the Internet of Things. Our solution has several advantages. First, the scheme is provably secure in the random oracle model. Second, it provides the following security properties: outsider/insider confidentiality and unforgeability, non-repudiation and public verifiability, while being efficient in terms of communication and computation costs. Third, the scheme offers the certificateless feature, so certificates are not needed to verify the user's public keys. For illustration, we conducted experimental evaluation based on a sensor Wismote platform and compared the performance of the proposed scheme to concurrent schemes. We wish these experimental results be helpful at a larger extent to the scientific community usually prone to work with realistic performance figures.

Generalized signcryption is a new cryptographic primitive which is more useful than the common signcryption in some applications. In this paper, based on a short ECDSA, a sescure and efficient generalized signcryption scheme is proposed. It can work as the same with the original generalized signcryption scheme ECGSC and provides message confidentiality, unforgeability, non-repudiation. The notable property of our scheme is its additional secure properties and its high efficiency. It can provide forward secrecy and public verification which is important in many cases. Its computation cost and communication cost are all less than that of ECGSC due to the use of a short ECDSA and the short transmitted message in our scheme.

Anonymous and linkable ring signcryption scheme for location-based services in VANETs

The signcryption is a relatively new cryptographic technique that is supposed to fulfill the functionalities of encryption and digital signature in a single logical step. Several signcryption schemes are proposed throughout the years, each of them having its own problems and limitations. In this paper, the security of a recent signcryption scheme, i.e. Hwang et al.'s scheme is analyzed, and it is proved that it involves several security flaws and shortcomings. Several devastating attacks are also introduced to the mentioned scheme whereby it fails all the desired and essential security attributes of a signcryption scheme.

Signcryption schemes are compact and specially suited for efficiency-critical applications such as smart card dependent systems. Several researchers have performed a large number of significant applications of signcryption such as authenticated key recovery and key establishment in one mall data packet, secure ATM networks as well as light weight electronic transaction protocols and multi-casting over the internet. In this paper we have proposed an efficient and efficient scheme of signcryption symmetric key solutions, using elliptic curves by reducing senders computational cost. It needs two elliptic curve point multiplication for sender and comparative study of computational cost for sender and recipient as well as there is no any inverse computation for sender and recipient. This makes it more crucial than others.

With the rapid development of cloud computing, an increasing number of data owners are willing to employ cloud storage service. In cloud storage, the resource-constraint data owners can outsource their large-scale data to the remote cloud server, by which they can greatly reduce local storage overhead and computation cost. Despite plenty of attractive advantages, cloud storage inevitably suffers from some new security challenges due to the separation of outsourced data ownership and its management, such as secure data insertion and deletion. The cloud server may maliciously reserve some data copies and return a wrong deletion result to cheat the data owner. Moreover, it is very difficult for the data owner to securely insert some new data blocks into the outsourced data set. To solve the above two problems, we adopt the primitive of Merkle sum hash tree to design a novel publicly verifiable cloud data deletion scheme, which can also simultaneously achieve provable data storage and dynamic data insertion. Moreover, an interesting property of our proposed scheme is that it can satisfy private and public verifiability without requiring any trusted third party. Furthermore, we formally prove that our proposed scheme not only can achieve the desired security properties, but also can realize the high efficiency and practicality.

The research on aggregate signcryption is mostly based on identity-based encryption to provide confidentiality and authentication,thus improving efficiency.But aggregate signcryption has the problem in certificate management and key escrow.Therefore,it needs to design new aggregate signcryption schemes,which not only solve the problem of certificate management and key escrow,but also guarantee the confidentiality and authentication of the scheme.This paper analyzed the main stream aggregate signcryption schemes and their development.Combined with the scheme of Zhang et al.(ZHANG L,ZHANG F T.A new certificateless aggregate signature scheme.Computer Communications,2009,32(6):1079-1085) and the needs mentioned above,this article designed a certificateless aggregate signcryption scheme,and proved its confidentiality and unforgeability based on the Bilinear Diffie-Hellman(BDH) problem and Computational Diffie-Hellman(CDH) problem.The experimental results show that the proposed scheme is more efficient and the amount of computation is equal or lower in comparison with the other schemes.What's more,the new scheme is publicly verifiable,and it eliminates the use of public key certificate and solves the problem in key escrow.

A Signcryption proposed by Yuliang Zheng in 1997 is a hybrid public key primitive that combines a digital signature and an encryption. It provides more efficient method than a straightforward composition of a signature scheme with an encryption scheme. In a mobile communication environment, the authenticated key agreement protocol should be designed to have lower computational complexity and memory requirements. Therefore, in this paper, our proposed method that efficient authenticated key exchange protocol using Signcryption scheme and based on EC using Signcryption in mobile and wireless network. And we analyze computational cost and security requirements of proposed protocol.

Edge computing is an emerging computing paradigm, which extends the functions of cloud center to the edge of the networks, and brings great convenience to solving problems of delay and bandwidth in the traditional cloud computing paradigm. In edge computing architecture, one-to-many communication is a important communication mode that supports the edge nodes to send one message to multiple terminal devices in one broadcast report. To build a secure one-to-many communication, several multi-receiver signcryption (MRSC) schemes have been brought forward to ensure the security of broadcast messages. However, the existing MRSC schemes need the heavy computation and communication cost, and is not suitable for IoT terminal devices with limited resources. Besides, most of the existing MRSC schemes are vulnerable to the security and privacy leakage, and fail in achieving the decryption fairness. To solve these problems, based on the implicit certificate (IC) cryptosystem and polynomial interpolation evaluation, this paper proposes an provably secure multi-receiver IC-based signcryption (MRICSC) scheme for one-to-many communication in edge computing. The security analysis evidences the proposed MRICSC scheme can ensure the security. With the experimental results indicating that the proposed MRICSC scheme achieves the better performance than existing schemes.