References
- S. Agrawal, D. Boneh, and X. Boyen, Efficient lattice (H)IBE in the standard model, Proceedings of Eurocrypt 2010, LNCS 6110, Springer, Berlin, 2010. pp, 553–572.
- S. Agrawal, D. Boneh, and X. Boyen, Lattice basis delegation in fixed dimension and shorter-ciphertext hierarchical IBE, Proceedings of Crypto 2010, LNCS 6223, Springer, Berlin, 2010. pp. 98–115.
- S. Agrawal, X. Boyen, V. Vaikunthanathan, P. Voulgaris, and H. Wee, Functional encryption for threshold functions (or, fuzzy ibe) from lattices, Public Key Cryptography PKC 2012, LNCS 7293, Springer, Berlin, 2012. pp. 280–297.
- J. Alwen and C. Peikert, Generating shorter bases for hard random lattices, Proceedings of 26th International Symposium on Theoretical Aspects of Computer Science Vol. 09001, Freiburg, Germany, 2009. pp. 75–86.
- D. Boneh and X. Boyen, Efficient selective-id secure identity based encryption without random oracles, Proceedings of the International Conference on Advances in Cryptology (EUROCRYPT 04), LNCS 3027, Springer, Berlin, 2004. pp. 223–238.
- D. Boneh and X. Boyen, Secure identity based encryption without random oracles, Proceedings of the Advances in Cryptology (CRYPTO 04), LNCS 3152, Springer, Berlin, 2004. pp. 443–456.
- D. Boneh and M. Franklin, Identity-based encryption from the weil pairing, Proceedings of Crypto'01, LNCS 2139, Springer, Berlin, 2001. pp. 213–229.
- D. Boneh and D.M. Freeman, Linearly homomorphic signatures over binary fields and new tools for lattice-based signatures, Proceedings of PKC 2011, LNCS 6571, Springer, Berlin, 2011. pp. 1–16.
- R. Canetti, S. Halevi, and J. Katz, A forward-secure public-key encryption scheme, Proceedings of Eurocrypt 2003, LNCS 2656, Springer, Berlin, 2003. pp. 255–271.
- D. Cash, D. Hofheinz, E. Kiltz, and C. Peikert, Bonsai trees, or how to delegate a lattice basis, Proceedings of Eurocrypt 2010, LNCS 6110, Springer, Berlin, 2010. pp. 523–552.
- 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 STOC'08, British Columbia, Canada, 2008. pp. 197–206.
- Y. Hu, H. Lei, F. Wang, and W. Zhang, Gaussian sampling of lattices for cryptographic applications, Sci. China Inf. Sci. 57 (2014), pp. 072112:1–072112:8.
- D. Micciancio and O. Regev, Worst-case to average-case reductions based on Gaussian measures, Proceedings of 45th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Rome, Italy, 2004. pp. 372–381.
- O. Regev, On lattice, learning with errors, random linear codes, and cryptography, Proceedings of STOC 2005, Baltimore, 2005. pp. 84–93.
- A. Shamir, Identity-based cryptosystems and signature schemes, Proceedings of Crypto 1984, LNCS 196, Springer, Berlin, 1984. pp. 47–53.
- F. Wang, Y. Hu, and B. Wang, Lattice-based linearly homomorphic signature scheme over binary field, Sci. China Inf. Sci. 56 (2013), pp. 112108:1–112108:9.
- B. Waters, Efficient identity-based encryption without random oracles, Proceedings of Eurocrypt 2005, LNCS, 3494, Springer, Berlin, 2005. pp. 114–127.
- X. Xie, R. Xue, and R. Zhang, Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input, Proceedings of Security and Cryptography for Network 2012, LNCS 7485, Springer, Berlin, 2011. pp. 1–18.