S. Agrawal, D. Boneh, and X. Boyen, Efficient Lattice (H)IBE in the Standard Model, EURO- CRYPT, pp.553-572, 2010.
DOI : 10.1007/978-3-642-13190-5_28

J. Alwen and C. Peikert, Generating Shorter Bases for Hard Random Lattices, International Symposium on Theoretical Aspects of Computer Science, pp.75-86, 2009.
DOI : 10.1007/s00224-010-9278-3
URL : https://hal.archives-ouvertes.fr/inria-00359718

B. Applebaum, D. Cash, C. Peikert, and A. Sahai, Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems, Crypto, pp.595-618, 2009.
DOI : 10.1007/978-3-642-03356-8_35

M. Bellare and T. Ristenpart, Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters??? IBE Scheme, Eurocrypt, 2009.
DOI : 10.1007/11426639_7

D. Boneh and M. K. Franklin, Identity Based Encryption From the Weil Pairing, CRYPTO, pp.213-229, 2001.

D. Cash, D. Hofheinz, and E. Kiltz, How to Delegate a Lattice Basis, IACR Cryptology ePrint Archive, 2009.

S. Chatterjee and P. Sarkar, Trading Time for Space: Towards an Efficient IBE Scheme with Short(er) Public Parameters in the Standard Model, ICISC, pp.424-440, 2005.
DOI : 10.1007/11734727_33

S. Chatterjee and P. Sarkar, HIBE With Short(er) Public Parameters Without Random Oracle, Asiacrypt, pp.145-160, 2006.

C. Cocks, An Identity Based Encryption Scheme Based on Quadratic Residues, IMA Int. Conf, pp.360-363, 2001.
DOI : 10.1007/3-540-45325-3_32

D. Micciancio and S. Goldwasser, Complexity of Lattice Problems: A Cryptographic Perspective, 2002.
DOI : 10.1007/978-1-4615-0897-7

C. Gentry and A. Silverberg, Hierarchical ID-Based Cryptography, Asiacrypt, pp.548-566, 2002.
DOI : 10.1007/3-540-36178-2_34
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.7270

J. Horwitz and B. Lynn, Toward Hierarchical Identity-Based Encryption, Eurocrypt, pp.466-481, 2002.
DOI : 10.1007/3-540-46035-7_31
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.7591

R. Lindner and C. Peikert, Better Key Sizes (and Attacks) for LWE-Based Encryption, CT-RSA, pp.319-339, 2011.
DOI : 10.1007/3-540-45708-9_19

C. Peikert, Bonsai trees (or, arboriculture in lattice-based cryptography), Cryptology ePrint Archive, 2009.

O. Regev, On lattices, learning with errors, random linear codes, and cryptography, STOC, pp.84-93, 2005.

A. Shamir, How to share a secret, Communications of the ACM, vol.22, issue.11, pp.612-613, 1979.
DOI : 10.1145/359168.359176

K. Singh, C. Pandu-rangan, and A. K. Banerjee, Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme, Journal of Internet Services and Information Security (JISIS), vol.3, issue.34, pp.38-51, 2013.
DOI : 10.1007/978-3-319-12060-7_6

K. Singh, C. Pandu-rangan, and A. K. Banerjee, Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters, Proc. of the 2nd International Conference on Security, Privacy and Applied Cryptography Engineering, pp.153-172, 2012.
DOI : 10.1007/978-3-642-34416-9_11

R. Brent and . Waters, efficient identity-based encryption without random oracles, EUROCRYPT, pp.114-127, 2004.

I. You, Y. Hori, and K. Sakurai, Enhancing svo logic for mobile ipv6 security protocols, Ubiquitous Computing, and Dependable Applications (JoWUA), pp.26-52, 2011.