1. Agrawal S., Boneh D., Boyen X.: Efficient lattice (H)IBE in the standard model. In: Advances in Cryptology—EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Monaco/French Riviera, May 30–June 3, 2010. Proceedings, pp. 553–572 (2010).
2. Ajtai M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-Eighth Annual ACM Symposium on the Theory of Computing, Philadelphia, Pennsylvania, USA, May 22–24, 1996, pp. 99–108 (1996).
3. Banerjee A., Peikert C., Rosen A.: Pseudorandom functions and lattices. In: Pointcheval D., Johansson T. (eds.) Advances in Cryptology—EUROCRYPT 2012—31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7237, pp. 719–737. Springer (2012).
4. Bansarkhani R.E., El Kaafarani A.: Post-quantum attribute-based signatures from lattice assumptions. IACR Cryptol. ePrint Arch. 2016, 823 (2016).
5. Blum M., Santis A.D., Micali S., Persiano G.: Noninteractive zero-knowledge. SIAM J. Comput. 20(6), 1084–1118 (1991).