A HIBE Scheme of Differentiates the Number of Identity Layers

doi:10.3969/j.issn.1671-1122.2019.11.003

Abstract

Abstract:

In order to identify the internal attack threat of the encryption system, this paper divides the encryption process based on the hierarchical identity encryption structure into two cases: odd and even. By dividing the ciphertext into two forms, the system can distinguish the identity layer of the internal adversary. Decryption requires only one bilinear pair computation, which improves the decryption efficiency to a certain extent. The method of security proof is the double system encryption technology, which proves that the scheme is secure and anonymous under the adaptive ID model. Compared with the original scheme, the scheme uses fewer parameters and the encryption efficiency is improved. The scheme can resist the external attack, and can effectively identify the threat from the internal information leakage of the system, so that the security of the encryption scheme has been improved.

Key words: encryption system, hierarchical identity-based encryption, pairing computation, dual system encryption, adaptive ID model

CLC Number:

TP309

Quanming LIU, Jie FENG, Yinnan LI, Shasha SU. A HIBE Scheme of Differentiates the Number of Identity Layers[J]. Netinfo Security, 2019, 19(11): 14-23.

Figures/Tables 2

References 24

[1]	SHAMIR A.Identity-based Cryptosystems and Signature Schemes[C]//Springer. CRYPTO 84, August 19-22, 1984, Santa Barbara, California, USA. Berlin, Heidelberg: Springer, 1984: 47-53.
[2]	BONEH D, FRANKLIN M.Identity-based Encryption from the Weil Pairing[C]//Springer. 21st Annual International Cryptology Conference, August 19-23, 2001, Santa Barbara, California, USA. Berlin, Heidelberg: Springer, 2001: 213-229.
[3]	GENTRY C and SILVERBERG A. Hierarchical Id-based Cryptography[C]//Springer. 8th International Conference on the Theory and Application of Cryptology and Information Security, December 1-5, 2002, Queenstown, New Zealand. Berlin, Heidelberg: Springer, 2002: 548-566.
[4]	HORWITZ J and LYNN B. Toward Hierarchical Identity-based Encryption[C]//Springer. International Conference on the Theory and Applications of Cryptographic Techniques, April 28-May 2, 2002, Amsterdam, The Netherlands. Berlin, Heidelberg: Springer, 2002: 466-481.
[5]	BOYEN X, WATERS B.Anonymous Hierarchical Identity-based Encryption(without Random Oracles)[C]//Springer. 26th Annual International Cryptology Conference, August 20-24, 2006, Santa Barbara, California, USA. Berlin, Heidelberg: Springer, 2006: 290-307.
[6]	SEOJ H., KOBAYASHI T, OHKUBO M, et al. Anonymous Hierarchical Identity-based Encryption with Constant Size Ciphertexts[C]//Springer. 12th International Conference on Practice and Theory in Public Key Cryptography Irvine, March 18-20, 2009, CA, USA. Berlin, Heidelberg: Springer, 2009: 215-234.
[7]	GENTRYC. Fully Homomorphic Encryption Using Ideal Lattices[C]//ACM. 41st ACM Symposium on Theory of Computing, May 31-June 2, 2009, Bethesda, MD, USA. New York, NY, USA: ACM, 2009: 169-178.
[8]	AGRAWAL S, BONEH D, BOYEN X. EfficientLattice(H)IBE in the Standard Model[C]//Springer.29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 30-June 3, 2010, French Riviera. Berlin, Heidelberg: Springer, 2010: 553-572.
[9]	SINGH K, RANGAN C P, BANERJEE A K.Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters[J]. Information and Communication, 2014, 84(7): 542-553.
[10]	SEOJ H, EMURAK. Efficient Delegation of Key Generation and Revocation Functionalities in Identity-based Encryption[C]//Springer. The Cryptographers’ Track at the RSA Conference, February 25-March 1, 2013, San Francisco, CA, USA. Berlin, Heidelberg: Springer, 2013: 343-358.
[11]	LEE K, PARK S.Revocable Hierarchical Identity-based Encryption with Shorter Private Keys and Update Keys[J]. Designs, Codes and Cryptography, 2018, 86(10): 2407-2440.
[12]	SEO J H, EMURA K.Revocable Hierarchical Identity-based Encryption: History-free Update, Security against Insiders, and Short Ciphertexts[C]//Springer. CT-RSA 2015, April 20-24, 2015, San Francisco, California, USA. Berlin, Heidelberg: Springer, 2015: 106-123.
[13]	SUSILO W and MU Y. Hierarchical Identity-Based Broadcast Encryption[C]//Springer. 19th Australasian Conference, July 7-9, 2014, Wollongong, NSW, Australia. Berlin, Heidelberg: Springer, 2014: 242-257.
[14]	BLAZY O, KILTZ E, PAN J.(Hierarchical) Identity-based Encryption from Affine Message Authentication[C]//Springer. 34th Annual Cryptology Conference, August 17-21, 2014, Santa Barbara, CA, USA. Berlin, Heidelberg: Springer, 2014: 408-425.
[15]	JOUX A.A One Round Protocol for Tripartite Diffie-Hellman, in Algorithmic Number Theory(ANTS-IV)[C]//Springer. 4th International Algorithmic Number Theory Symposium, July 2-7, 2000, The Netherlands. Berlin, Heidelberg: Springer, 2000: 385-394.
[16]	WATERS B.Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions[C]//Springer. 29th Annual International Cryptology Conference, August 16-20, 2009, Santa Barbara, CA, USA. Berlin, Heidelberg: Springer, 2009: 619-636.
[17]	WEE H.Déjà Q: Encore!Un Petit IBE[C]//Springer. 13th International Conference, TCC 2016-A, January 10-13, 2016, Tel Aviv, Israel. Berlin, Heidelberg: Springer, 2016: 237-258.
[18]	LEWKO A, WATERS B.New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts[C]//Springer. 7th Theory of Cryptography Conference, February 9-11, 2010, Zurich, Switzerland. Berlin, Heidelberg: Springer, 2010: 455-479.
[19]	BONEH D, GOH E, NISSIM K.Evaluating 2-DNF Formulas on Ciphertexts[C]//Springer. Second Theory of Cryptography Conference, February 10-12, 2005, Cambridge, MA, USA. Berlin, Heidelberg: Springer, 2005: 325-341.
[20]	WATERS B.Efficient Identity-based Encryption without Random Oracles[C]//Springer. 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 22-26, 2005, Aarhus, Denmark. Berlin, Heidelberg: Springer, 2005: 114-127.
[21]	YANG Bo.The Provable Security of Cryptography[M]. Beijing: Tsinghua University Press, 2017: 36-38.
	杨波. 密码学中的可证明安全性[M]. 北京:清华大学出版社,2017:36-38.
[22]	RAMANNASC, SARKARP. Efficient(Anonymous) Compact HIBE from Standard Assumptions[C]//Springer. 8th International Conference on Provable Security, October 9-10, 2014, Hong Kong, China. Berlin, Heidelberg: Springer, 2014: 243-258.
[23]	SEO J H, KOBAYASHI T, OHKUBO M, et al.Anonymous Hierarchical Identity-based Encryption with Constant Size Ciphertexts[C]//Springer. 12th International Conference on Practice and Theory in Public Key Cryptography, March 18-20, 2009, Irvine, CA, USA. Berlin, Heidelberg: Springer, 2009: 215-234.
[24]	CARO D A, IOVINO V, PERSIANO G.Fully Secure Anonymous HIBE and Secret-key Anonymous IBE with Short Ciphertexts.[C]//Springer. 4th International Conference on Pairing-Based Cryptography, December 13-15, 2010, Yamanaka Hot Spring, Japan. Berlin, Heidelberg: Springer, 2010: 347-366.

结构	文献[18] 方案	文献[23] 方案	文献[24] 方案	本文方案
安全模型	适应性ID	选择性ID	适应性ID	适应性ID
假设模型	子群判定	h-wBDH?,h-cDH	子群判定	子群判定
安全退化	O(q)	O(1)	O(q)	O(q)
公钥数量	(l+3,1)	(l+6,1)	(l+4,1)	(?l∕2?+3,2)
主密钥数	1	l+4	2	3
密文数量	2	3	2	1
私钥数量	l-k+2	3(l-k+3)	2(l-k+2)	l-k+1
加密算法	h+2	h+6	h+4	h+1
解密对数	2	4	2	1
密钥生成	2l-k+4	3l-2k+2	4(l+2-3k)	2l-k+2
委派算法	2l-k+6	6(l-k)+2	4(l-k)+11	l-k+1
是否匿名	否	是	是	是