1. Abdalla M., Bellare M., Catalano D., Kiltz E., Kohno T., Lange T., Malone-Lee J., Neven G., Paillier P., Shi H.: Searchable encryption revisited: consistency properties, relation to anonymous ibe, and extensions. In: Shoup V. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 3621, pp. 205–222. Springer, Heidelberg (2005).
2. Abdalla M., Bellare M., Neven G.: Robust encryption. In: Micciancio D. (ed.) TCC. Lecture Notes in Computer Science, vol. 5978, pp. 480–497. Springer, Heidelberg (2010).
3. Agrawal S., Boneh D., Boyen X.: Efficient lattice (h)ibe in the standard model. In: Gilbert H. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 6110, pp. 553–572. Springer, Heidelberg (2010).
4. Agrawal s Boneh D., Boyen X.: Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical ibe. In: Rabin T. (ed.) CRYPTO. Lecture Notes in Computer Science, vol. 6223, pp. 98–115. Springer, Heidelberg (2010).
5. Boneh D., Boyen X.: Efficient selective-id secure identity-based encryption without random oracles. In: Cachin C., Camenisch J. (eds.) EUROCRYPT. Lecture Notes in Computer Science, vol. 3027, pp. 223–238. Springer, Heidelberg (2004).