Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Software
Reference78 articles.
1. Ajtai, M.: Generating hard instances of lattice problems (extended abstract). In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, STOC ’96, pp. 99–108. ACM, New York (1996). https://doi.org/10.1145/237814.237838
2. Archer, D.W., Rohloff, K.: Computing with data privacy: steps toward realization. IEEE Secur. Privacy 13(1), 22–29 (2015)
3. Armknecht, F., Boyd, C., Carr, C., Gjøsteen, K., Jäschke, A., Reuter, C.A., Strand, M.: A guide to fully homomorphic encryption. Cryptology ePrint Archive, Report 2015/1192. http://eprint.iacr.org/2015/1192 (2015)
4. Babai, L.: On Lovász’ lattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986). https://doi.org/10.1007/BF02579403
5. Bajard, J., Didier, L.S., Kornerup, P.: An RNS Montgomery modular multiplication algorithm. IEEE Trans. Comput. 47(7), 766–776 (1998)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献