Author:
Coron Jean-Sébastien,Mandal Avradip,Naccache David,Tibouchi Mehdi
Publisher
Springer Berlin Heidelberg
Reference19 articles.
1. Bach, E.: How to generate factored random numbers. SIAM J. Comput. 17, 179–193 (1988)
2. Boyar, J., Peralta, R., Pochuev, D.: On the multiplicative complexity of boolean functions over the basis ( ∧ , ⊕ , 1). Theor. Comput. Sci. 235(1), 43–57 (2000)
3. Coron, J.S., Mandal, A., Naccache, D., Tibouchi, M.: Fully Homomorphic Encryption over the Integers with Shorter Public Keys,
http://eprint.iacr.org
4. Lecture Notes in Computer Science;M. Dijk van,2010
5. Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009),
http://crypto.stanford.edu/craig
Cited by
270 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献