.. .. , SK ID h ) · t (A ?1 ) (by quering the Extract algorithm on the h identities ID j for j ? {1, recover the secret key vector (r 1

D. Boneh and M. Franklin, Identity-Based Encryption from the Weil Pairing, SIAM J. Comput, vol.32, issue.3, pp.586-615, 2003.

N. H. Bshouty and H. Mazzawi, On Parity Check (0, 1)-Matrix over Z p, Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, pp.1383-1394, 2011.

M. Bellare and P. Rogaway, Random Oracles are Practical: A Paradigm for Designing Efficient Protocols, Proceedings of the First ACM Conference on Computer and Communications, pp.62-73, 1993.

C. Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, Cryptography and Coding, 8th IMA International Conference, vol.2260, pp.360-363, 2001.

C. Gentry, C. Peikert, and V. Vaikuntanathan, Trapdoors for hard lattices and new cryptographic constructions, Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp.197-206, 2008.

G. Landsberg, Über eine Anzahlbestimmung und eine damit zusammenhängende Reihe, J. Reine und Angewandte Math, vol.111, pp.87-88, 1893.

A. Shamir, Identity-Based Cryptosystems and Signature Schemes, Advances in Cryptology -Crypto, Lect. Notes Comput. Sci, vol.84, pp.47-53, 1985.

M. Zheng, Y. Xiang, and H. Zhou, A strong provably secure IBE scheme without bilinear map, J. Comput. Syst. Sci, vol.81, pp.125-131, 2015.