@techreport{TR-IC-14-18,
   number = {IC-14-18},
   author = {Karina Mochetti and Ricardo Dahab},
   title = {{Ideal Lattice-based (H)IBE Scheme}},
   month = {November},
   year = {2014},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 21 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       In an Identity-Based Encryption Scheme, the public key is based
       on  unique  user's information, such as an email address, so it
       is  possible  to  perform  the  decryption  without  public-key 
       certification.  Ideal  lattices  are a generalization of cyclic
       lattices, in which the lattice corresponds to ideals in a ring.
       They  allow  some  improvements  in  the  parameters  size  and 
       multiplication  complexity. In this paper, we present a version
       of  the  lattice-based  (H)IBE  scheme by Agrawal, Boneh, Boyen
       (Eurocrypt'10)  for  ideal  lattices.  As the underlying (H)IBE
       scheme,  our  scheme is shown to be weak selective secure based
       on  the  difficulty  of the Learning With Errors Problem (LWE),
       but our new primitive has smaller public keys.
  }
}