Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme

Abstract

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.

Robust multiple frequency multiple power localization schemes in the presence of multiple jamming attacks

“…Unfortunately, traditional security services are incapable of militating non-cryptographic attacks, thus the need to investigate the impact of these attacks on localization algorithms with the aim of proposing methods that can be effectively used to detect and eliminate such threats from the network. Despite advances in the domain of secure localization [ 40 – 43 ], there is yet to be any study in the area of robustness of RSS-based localization algorithm generation against physical attacks. The evaluative study in this paper is therefore significant in its contribution to wireless sensor network designs, particularly in the area of protocol decisions drivers, which will enable engineers to make better informed decisions about whether there is a need for a more complicated security localization algorithm.…”

Anonymous Certificateless Multi-Receiver Signcryption Scheme Without Secure Channel

“…At the same year, Pang et al [39] proposed an anonymous CLMS scheme, which is more efficient than schemes [37], [38] and offers receiver anonymity and source verifiability. Besides the aforementioned schemes, there are some other outstanding CLME/CLMS schemes [40]- [43] with various properties proposed for different application scenarios in recent years.…”