1. Verifiable random functions from identity-based key encapsulation;Abdalla,2009
2. Generating hard instances of the short basis problem;Ajtai,1999
3. Faster bootstrapping with polynomial error;Alperin-Sheriff,2014
4. Generating shorter bases for hard random lattices;Alwen;Theory Comput. Syst.,2011
5. A note on vrfs from verifiable functional encryption;Badrinarayanan,2017