All Title Author
Keywords Abstract

PLOS ONE  2013 

Quantum Attack-Resistent Certificateless Multi-Receiver Signcryption Scheme

DOI: 10.1371/journal.pone.0049141

Full-Text   Cite this paper   Add to My Lib


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.


[1]  Zheng Y (1997) Digital signcryption or how to achieve cost (signature & encryption)<
[2]  Luo M, Wen Y, Zhao H (2008) A certificate-based signcryption scheme. In: Proc. International Conference on Computer Science and Information Technology. 17–23.
[3]  Pang LJ, Gao L, Pei QQ, Cui JJ, Wang YM (2013) A new ID-based multi-recipient public-key encryption scheme. Chinese Journal of Electronics 1: 89–92.
[4]  AI-Riyami SS, Paterson KG (2003) Certificateless public key cryptography. In: Proc. 9th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2003): 452–473.
[5]  Barbosa M, Farshim P (2008) Certificateless signcryption. In: Proc. ACM Symposium on Information, Computer and Communications Security. 369–372.
[6]  Barreto PSLM, Deusajute AM, Cruz ES, Pereira GCF, Silva RR (2008) Toward efficient certificateless signcryption from (and without) bilinear pairings.
[7]  Li F, Shirase M, Takagi T (2009) Certificateless hybrid signcryption. In: Proc. 5th International Conference on Information Security Practice and Experience. 112–123.
[8]  Li PC, He MX, Li X, Liu WG (2010) Efficient and provably secure certificateless signcryption from bilinear pairings. Journal of Computational Information Systems 6: 3643–3650.
[9]  Selvi SSD, Vivek S, Rangan CP (2009) Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing. In: Proc. 5th international conference on Information security and cryptology (Inscrypt’ 09): 75–92.
[10]  Jing XF (2011) Provably secure certificateless signcryption scheme without pairing. In: Proc. International Conference on Electronic and Mechanical Engineering and Information Technology. 4753–4756.
[11]  Selvi SSD, Vivek SS, Shukla D, Chandrasekaran PR (2008) Efficient and provably secure certificateless multi-receiver signcryption. In: Proc. 2nd International Conference on Provable Security. 52–67.
[12]  Selvi SSD, Vivek SS, Rangan CP (2009) A note on the certificateless muli-receiver signcryption scheme. IACR Cryptology ePrint Archive. 308–308.
[13]  Miao SQ, Zhang FT, Zhang L (2010) Cryptanalysis of a certificateless multi-receiver signcryption scheme. In: Proc. International Conference on Multimedia Information Networking and Security. 593–597.
[14]  Shor PW (1994) Algorithms for quantum computation: discrete logarithms and factoring. In: Proc. 35th Symposium on Foundations of Computer Science. 124–134.
[15]  Dubois V, Fouque FA, Shamir A, Stern J (2007) Cryptanalysis of the SFLASH signature scheme. In: Proc. 3rd International SKLOIS Conference on Information Security and Cryptology (Inscrypt 2007): 1–4.
[16]  Billet O, Robshaw MJB, Peyrin T (2007) On building hash functions from multivariate quadratic equations. In: Proc. 12th Australasian conference on Information security and privacy (ACISP' 07): 82–95.
[17]  Patarin J, Goubin L (1997) Trapdoor one-way permutations and multivariate polynomials. In: Proc. first International Conference on Information and Communications Security. 356–368.
[18]  Patarin J (1996) Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric. In: Proc. International Conference on the Theory and Application of Cryptographic Techniques. 33–48.
[19]  Bouillaguet C, Faugère JC, Fouque PA, Perret L (2011) Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem. In: Proc.14th International Conference on Practice and Theory in Public Key Cryptography. 473–493.
[20]  Ding JT, Gower JE (2006) Inoculation multivariate schemes against differential attacks. In: Proc. 9th International Conference on Theory and Practice in Public-Key Cryptography. 290–301.
[21]  Hashimoto Y, Takagi T, Sakurai K (2012) General fault attacks on multivariate public key cryptosystems. In: Proc. 4th International Workshop on Post-Quantum Cryptography. 1–18.
[22]  Faugère JC, Perret L (2006) Polynomial equivalence problems: algorithmic and theoretical aspects. In: Proc. 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 30–47.
[23]  Bouillaguet C, Faugère P, Perret L (2009) Differential algorithms for the isomorphism of polynomials problem.
[24]  Tang SH, Xu LL (2012) Proxy signature scheme based on isomorphisms of polynomials. In: Proc. 6th International Conference on Network and System Security. 113–125.
[25]  Ding JT, Schmidt D (2005) Cryptanalysis of HFEv and internal perturbation of HFE. In: Proc. 10th International Conference on Practice and Theory in Public-Key Cryptography (PKC 2005): 288–301.
[26]  Dubois V, Granboulan L, Stern J (2007) Cryptanalysis of HFE with Internal Perturbation. In: Proc. 10th International Conference on Practice and Theory in Public-Key Cryptography (PKC 2007): 249–265.
[27]  Dubois V, Gama N (2010) The degree of regularity of HFE Systems. In: Proc. 16th International Conference on the Theory and Application of Cryptology and Information Security (ASIACRYPT 2010): 557–576.
[28]  Ding JT, Hodges TJ (2011) Inverting HFE systems is quasi-polynomial for all fields. In: Proc. 31th Annual International Cryptology Conference on Advances in Cryptology (CRYPTO 2011): 724–742.
[29]  Ding JT, Kleinjung T (2012) Degree of Regularity of HFE minus. Journal of Math-for-Industry. 2012, Vol 4, 97–104.
[30]  Pang LJ, Li HX, Pei QQ (2012) Improved multicast key management of Chinese wireless local area network security standard. IET Communications 6: 1126–1130.


comments powered by Disqus

Contact Us


微信:OALib Journal