Multi-receiver Signcryption Research Articles

Efficient Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Bilinear Pairings

Certificateless multi-receiver encryption/signcryption (CLME/CLMS) has become a research hotspot in the field of information security. Almost all of the existing CLME/CLMS schemes are constructed based on the bilinear pairing computation, a time-consuming operation, which makes their computational efficiency relatively low. Although there are some CLME schemes constructed on scalar point multiplications on elliptic curve cryptography (ECC) instead of the bilinear pairing computation, too many scalar point multiplications involved still lead to the low computational efficiency. Therefore, there is still room for the CLME/CLMS schemes in efficiency. Motivated by these concerns, an efficient anonymous certificateless multi-receiver signcryption scheme is proposed with its security proved under the random oracle model. The proposed scheme is improved largely in computational efficiency by the idea that it is designed based on scalar point multiplications on ECC instead of the bilinear pairing and the number of scalar point multiplications on ECC is reduced as small as possible.

Multi-message and multi-receiver heterogeneous signcryption scheme for ad-hoc networks

ABSTRACTSecurity is a significant issue for ad-hoc networks. Heterogeneous signcryption schemes proposed in recent years satisfy privacy and authentication of messages and reduce cost of computation and communication in a logical step. In this article, we present a new efficient heterogeneous signcryption scheme that shifts between the public key infrastructure (PKI) and the identity-based cryptosystem (IBC). The proposed scheme is suitable for broadcast communication conditions in which senders can signcrypt multiple messages for multiple receivers simultaneously in the ad-hoc networks. This scheme is proved to satisfy confidentiality and unforgeability on the basis of the assumptions of bilinear Diffie-Hellman problem (BDHP), q-Diffie-Hellman inversion problem (q-DHIP), q-bilinear Diffie-Hellman inversion problem (q-BDHIP), and computational Diffie-Hellman problem (CDHP) in the random oracle model. We discuss the efficiency of our scheme theoretically. In the efficiency analysis phase, we show that our scheme is practical and efficient. In the performance analysis phase, we present additional tests, data, and explanations to prove that our scheme can be applied in ad-hoc networks. Finally, we apply our scheme to a simulated ad-hoc network.

ID-based multi-receiver signcryption scheme in the standard model

ID-based multi-receiver signcryption scheme in the standard model

ID-based multi-receiver signcryption scheme in the standard model

Currently, the network multicast in network and internet services are widely used, and how to ensure secure data transmission and non-repudiation has been a hot issue. In order to ensure data confidentiality and non-repudiation in multicast that has lower cost of data transmission and computing, we propose an ID-based multi-receiver signcryption scheme in the standard model based on multilinear maps. In our construction, the number of recipients is unlimited and each receiver decrypts ciphertext using his private key and verifies the identity of the sender. At the same time, the identity-based design has important advantages in that it eliminates the large overhead of having to store and verify a set of verification keys. Based on the hardness assumption of the graded Diffie-Hellman problem, we prove that the proposed scheme can achieve the message confidentiality under selective multi-ID, chosen message attack and the signcryption is unforgeable under selective ID, chosen message attack.

A Novel Multi-Receiver Signcryption Scheme with Complete Anonymity.

Anonymity, which is more and more important to multi-receiver schemes, has been taken into consideration by many researchers recently. To protect the receiver anonymity, in 2010, the first multi-receiver scheme based on the Lagrange interpolating polynomial was proposed. To ensure the sender’s anonymity, the concept of the ring signature was proposed in 2005, but afterwards, this scheme was proven to has some weakness and at the same time, a completely anonymous multi-receiver signcryption scheme is proposed. In this completely anonymous scheme, the sender anonymity is achieved by improving the ring signature, and the receiver anonymity is achieved by also using the Lagrange interpolating polynomial. Unfortunately, the Lagrange interpolation method was proven a failure to protect the anonymity of receivers, because each authorized receiver could judge whether anyone else is authorized or not. Therefore, the completely anonymous multi-receiver signcryption mentioned above can only protect the sender anonymity. In this paper, we propose a new completely anonymous multi-receiver signcryption scheme with a new polynomial technology used to replace the Lagrange interpolating polynomial, which can mix the identity information of receivers to save it as a ciphertext element and prevent the authorized receivers from verifying others. With the receiver anonymity, the proposed scheme also owns the anonymity of the sender at the same time. Meanwhile, the decryption fairness and public verification are also provided.

Anonymous multi‐receiver ID‐based signcryption scheme

In earlier multi-receiver signcryption schemes, in order to help the authorised receivers to find the corresponding information for decryption from the ciphertext, the list of identities of all authorised receivers should be included in the ciphertext as a necessary element. However, this method has directly led to the privacy leakage problem of receivers. Later, several anonymous multi-receiver signcryption schemes use the Lagrange interpolation method to mix and hide the real identities of all receivers, so that the ciphertext does not expose identities of the receivers any longer. Therefore the Lagrange interpolation method is considered to be a perfect solution to the receiver anonymity problem, and multiple anonymous multi-receiver signcryption schemes have been proposed based on it. However, recently, this method has been proven to be insecure because it cannot assure the anonymity of receivers either. In fact, in any of the existing anonymous schemes based on the Lagrange interpolation method, it is easy for one authorised receiver to judge whether anyone is an authorised receiver or not, which badly violates the receiver anonymity. Motivated by these concerns, the authors propose a new multi-receiver signcryption scheme to solve this problem. Analyses show that the proposed scheme meets confidentiality, unforgeablity and the sender and receivers’ anonymity.

Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme

The existing certificateless signcryption schemes were designed mainly based on the traditional public key cryptography, in which the security relies on the hard problems, such as factor decomposition and discrete logarithm. However, these problems will be easily solved by the quantum computing. So the existing certificateless signcryption schemes are vulnerable to the quantum attack. Multivariate public key cryptography (MPKC), which can resist the quantum attack, is one of the alternative solutions to guarantee the security of communications in the post-quantum age. Motivated by these concerns, we proposed a new construction of the certificateless multi-receiver signcryption scheme (CLMSC) based on MPKC. The new scheme inherits the security of MPKC, which can withstand the quantum attack. Multivariate quadratic polynomial operations, which have lower computation complexity than bilinear pairing operations, are employed in signcrypting a message for a certain number of receivers in our scheme. Security analysis shows that our scheme is a secure MPKC-based scheme. We proved its security under the hardness of the Multivariate Quadratic (MQ) problem and its unforgeability under the Isomorphism of Polynomials (IP) assumption in the random oracle model. The analysis results show that our scheme also has the security properties of non-repudiation, perfect forward secrecy, perfect backward secrecy and public verifiability. Compared with the existing schemes in terms of computation complexity and ciphertext length, our scheme is more efficient, which makes it suitable for terminals with low computation capacity like smart cards.

Certificateless Mult-i receiver Signcryption Scheme Based on Multivariate Public Key Cryptography

Certificateless Mult-i receiver Signcryption Scheme Based on Multivariate Public Key Cryptography

Threshold rekeying protocol based on multi-receiver signcryption algorithm

An ID-based multi-message and multi-receiver signcryption algorithm was proposed,which could simultaneously signcrypt lots of messages for lots of receivers.Based on it,a threshold rekeying protocol was proposed to be applied in Ad Hoc networks,and the new algorithm and protocol were analyzed.The analysis indicates that the algorithm achieves authenticity and confidentiality while being of high efficiency,and that the rekeying protocol not only possesses the characteristics of the mentioned algorithm,but also can resist collusion attacks.

Security Pitfalls of the Certificateless Signature and Multi-Receiver Signcryption Schemes

Recently, Xiong et al. and Selvi et al. proposed a certificateless signature scheme secure in the standard model and a certificateless multi-receiver signcryption scheme secure in the random oracle model, respectively. In this paper, we show that they are insecure against malicious-butpassive KGC attacks. More specifically, the former does not achieve unforgeability and the latter does not satisfy confidentiality against type II adversaries.