Research on Identity-based Encryptions from Large Integer Factorization

doi:10.3969/j.issn.1671-1122.2015.10.005

Abstract

Abstract:

Recently, research on identity-based encryption (IBE) has received extensive attentions. Different from the traditional public-key cryptosystem, IBE applies the user’s identity directly as a public key rather than the digital certificate, and the key management is simple, which makes the IBE become a research hotspot in the field of public-key encryption. Nowadays, IBE is often constructed using bilinear pairing on elliptic curve. But the multiplication and exponential operations based on bilinear group are slow and inefficient, and the parameters selection is too complicated. Therefore, the IBE constructed based on bilinear pairing is not practical. The standard large integer factorization of the traditional public-key cryptosystem is better, which is the other direction for the construction of a safe and practical IBE. This paper describes the research progress of the IBE based on large integer factorization, introduces the definition and the security model of the IBE, and summarizes current research achievements on the IBE. This paper also compares and analyzes several typical IBE algorithms based on large integer factorization, and summarizes the advantages and disadvantages of each algorithm. In addition, this paper analyzes the hot issues of IBE, and puts forward some valuable problems for further research.

Key words: public-key cryptosystem, identity-based encryption, large integer factorization, discrete logarithm problem, integer residuosity

CLC Number:

TP309

LIU Jin-gang, DONG Jun-wu. Research on Identity-based Encryptions from Large Integer Factorization[J]. Netinfo Security, 2015, 15(10): 32-39.

Figures/Tables 2

References 50

[1]	Diffie W, Hellman M E.New directions in cryptography[J]. IEEE Transactions on Information Theory, 1976, 22(6): 644-654.
[2]	Rivest R L, Shamir A, Adleman L.A method for obtaining digital signatures and public-key cryptosystems[J]. Communications of the ACM, 1978, 21(2): 120-126.
[3]	Rabin M O.Digitalized signatures and public-key functions as intractable as factorization[R].MASSACHUSETTS INST OF TECH CAMBRIDGE LAB FOR COMPUTER SCIENCE, 1979.
[4]	ElGamal T. A public key cryptosystem and a signature scheme based on discrete logarithms[C]//Advances in Cryptology. Springer Berlin Heidelberg, 1985: 10-18.
[5]	Miller V.Use of elliptic curves in cryptography[C]//Advances in Cryptology—CRYPTO’85 Proceedings. Springer Berlin Heidelberg, 1986: 417-426.
[6]	徐权佐,蔡庆军. 一种基于编码的公钥密码体制的参数选择研究[J]. 信息网络安全,2014,(10):54-58.
[7]	Shamir A.Identity-based cryptosystems and signature schemes[C]//Advances in cryptology. Springer Berlin Heidelberg, 1985: 47-53.
[8]	Boneh D, Franklin M. Identity-based encryption from the Weil pairing[C]//Kilian J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213-229. Springer, Berlin.
[9]	Bellare M, Rogaway P.Random oracles are practical: A paradigm for designing efficient protocols[C]//Proceedings of the 1st ACM conference on Computer and communications security. ACM, 1993: 62-73.
[10]	Boneh D, Boyen X.Efficient selective-ID secure identity-based encryption without random oracles[C]//Advances in Cryptology-EUROCRYPT 2004. Springer Berlin Heidelberg, 2004: 223-238.
[11]	Boneh D, Boyen X.Secure identity based encryption without random oracles[C]//Advances in Cryptology-Crypto 2004. Springer Berlin Heidelberg, 2004: 443-459.
[12]	Sakai R, Kasahara M.ID based Cryptosystems with Pairing on Elliptic Curve[J]. IACR Cryptology ePrint Archive, 2003: 54.
[13]	Waters B.Efficient identity-based encryption without random oracles[C]// Advances in Cryptology-EUROCRYPT 2005. Springer Berlin Heidelberg, 2005: 114-127.
[14]	Gentry C.Practical identity-based encryption without random oracles[C]//Advances in Cryptology-EUROCRYPT 2006. Springer Berlin Heidelberg, 2006: 445-464.
[15]	Cocks C.An identity based encryption scheme based on quadratic residues[C]//Cryptography and coding. Springer Berlin Heidelberg, 2001: 360-363.
[16]	Goldwasser S, Micali S.Probabilistic encryption[J]. Journal of computer and system sciences, 1984, 28(2): 270-299.
[17]	Rosen K H.Elementary number theory and its applications[M]. New Jersey: Addison Wesley, 1993.
[18]	Yan S Y.Number theory for computing[M]. Berlin: Springer Science & Business Media, 2002.
[19]	裴定一,祝跃飞.算法数论[M]. 北京:科学出版社, 2002.
[20]	Katz J, Lindell Y.Introduction to modern cryptography[M]. Boca Raton, FL:CRC Press, 2014.
[21]	Delfs H, Knebl H.Introduction to cryptography: principles and applications[M]. Berlin:Springer Science & Business Media, 2007.
[22]	Goldreich O.Foundations of cryptography: volume 2, basic applications[M]. Cambridge:Cambridge university press, 2004.
[23]	Pohlig S C, Hellman M E.An Improved Algorithm for Computing Logarithms over GF (p) and its Cryptographic Significance[J]. IEEE Transactions on Information Theory, 1978, (24): 106-110.
[24]	Bellare M, Desai A, Pointcheval D, et al.Relations among notions of security for public-key encryption schemes[C]//Advances in Cryptology—CRYPTO'98. Springer Berlin Heidelberg, 1998: 26-45.
[25]	Kiltz E, Malone-Lee J.A general construction of IND-CCA2 secure public key encryption[C]//IMA Conference on Cryptography and Coding. Springer Berlin Heidelberg, 2003: 152-166.
[26]	Cramer R, Shoup V.A practical public key cryptosystem provably secure against adaptive chosen ciphertext attack[C]//Advances in Cryptology—CRYPTO'98. Springer Berlin Heidelberg, 1998: 13-25.
[27]	冯登国. 密码学原理与实践[J].(第二版). 北京:电子工业出版社, 2003.
[28]	Mao W.Modern cryptography: theory and practice[M]. New Jersey:Prentice Hall Professional Technical Reference, 2003.
[29]	Fujisaki E,Okamoto T.How to enhance the security of public-key encryption at minimum cost[C]//Public Key Cryptography - PKC ’99, volume 1560 of LNCS, pages 53-68. Springer, 1999.
[30]	Boneh D, Gentry C, Hamburg M.Space-efficient identity based encryption without pairings[C]//Foundations of Computer Science, 2007. FOCS'07. 48th Annual IEEE Symposium on. IEEE, 2007: 647-657.
[31]	Boneh D, LaVigne R, Sabin M. Identity-Based Encryption with eth Residuosity and its Incompressibility[C]//Autumn 2013 TRUST Conference, Washington DC. 2013.
[32]	Paterson K G, Srinivasan S.On the relations between non-interactive key distribution, identity-based encryption and trapdoor discrete log groups[J]. Designs, Codes and Cryptography, 2009, 52(2): 219-241.
[33]	Meshram C.An efficient ID-based cryptographic encryption based on discrete logarithm problem and integer factorization problem[J]. Information Processing Letters, 2015, 115(2): 351-358.
[34]	Gentry C, Peikert C, Vaikuntanathan V.Trapdoors for hard lattices and new cryptographic constructions[C]//Proceedings of the fortieth annual ACM symposium on Theory of computing. ACM, 2008: 197-206.
[35]	Gentry C, Silverberg A.Hierarchical ID-based cryptography[C]//Advances in cryptology—ASIACRYPT 2002. Springer Berlin Heidelberg, 2002: 548-566.
[36]	Boneh D, Boyen X, Goh E J.Hierarchical identity based encryption with constant size ciphertext[C]//Advances in Cryptology-EUROCRYPT 2005. Springer Berlin Heidelberg, 2005: 440-456.
[37]	Shamir A.How to share a secret[J]. Communications of the ACM, 1979, 22(11): 612-613.
[38]	Chen L, Harrison K, Soldera D, et al.Applications of multiple trust authorities in pairing based cryptosystems[C]//Infrastructure Security. Springer Berlin Heidelberg, 2002: 260-275.
[39]	Al-Riyami S S, Paterson K G. Certificateless public key cryptography[C]//Advances in Cryptology-ASIACRYPT 2003. Springer Berlin Heidelberg, 2003: 452-473.
[40]	Goyal V.Reducing trust in the PKG in identity based cryptosystems[C]//Advances in Cryptology-CRYPTO 2007. Springer Berlin Heidelberg, 2007: 430-447.
[41]	Bellare M, Boldyreva A, Desai A, et al.Key-privacy in public-key encryption[C]//Advances in Cryptology—ASIACRYPT 2001. Springer Berlin Heidelberg, 2001: 566-582.
[42]	Boneh D, Di Crescenzo G, Ostrovsky R, et al.Public key encryption with keyword search[C]//Advances in Cryptology-Eurocrypt 2004. Springer Berlin Heidelberg, 2004: 506-522.
[43]	Ateniese G, Gasti P.Universally anonymous IBE based on the quadratic residuosity assumption[C]//Topics in Cryptology-CT-RSA 2009. Springer Berlin Heidelberg, 2009: 32-47.
[44]	Aouinatou R, Belkasmi M.Efficient anonymity for Cock's scheme[C]//2010 5th International Symposium On I/V Communications and Mobile Network. 2010.
[45]	Clear M, Tewari H, McGoldrick C. Anonymous IBE from quadratic residuosity with improved performance[C]//Progress in Cryptology-AFRICACRYPT 2014. Springer International Publishing, 2014: 377-397.
[46]	连科,赵泽茂,王丽君,等 . 一种支持属性重用的DCP-ABE方案研究[J]. 信息网络安全,2015,(6):41-46.
[47]	Gentry C.A fully homomorphic encryption scheme[D]. California:Stanford University, 2009.
[48]	杨晨,游林. 可计算密文加密体制研究[J]. 信息网络安全,2014,(5):78-81.
[49]	Clear M, Hughes A, Tewari H.Homomorphic Encryption with Access Policies: Characterization and New Constructions[C]//AFRICACRYPT,2013: 61-87.
[50]	Van Dijk M, Gentry C, Halevi S, et al.Fully homomorphic encryption over the integers[C]//Advances in Cryptology-EUROCRYPT 2010. Springer Berlin Heidelberg, 2010: 24-43.