Michael Naehrig
Michael Naehrig
Researcher, Microsoft Research, USA
Verified email at cryptojedi.org - Homepage
Cited by
Cited by
Can homomorphic encryption be practical?
M Naehrig, K Lauter, V Vaikuntanathan
Proceedings of the 3rd ACM workshop on Cloud computing security workshop …, 2011
Pairing-friendly elliptic curves of prime order
PSLM Barreto, M Naehrig
International workshop on selected areas in cryptography, 319-331, 2005
Cryptonets: Applying neural networks to encrypted data with high throughput and accuracy
R Gilad-Bachrach, N Dowlin, K Laine, K Lauter, M Naehrig, J Wernsing
International Conference on Machine Learning, 201-210, 2016
Improved security for a ring-based fully homomorphic encryption scheme
JW Bos, K Lauter, J Loftus, M Naehrig
IMA International Conference on Cryptography and Coding, 45-64, 2013
ML confidential: Machine learning on encrypted data
T Graepel, K Lauter, M Naehrig
International Conference on Information Security and Cryptology, 1-21, 2012
Post-quantum key exchange for the TLS protocol from the ring learning with errors problem
JW Bos, C Costello, M Naehrig, D Stebila
2015 IEEE Symposium on Security and Privacy, 553-570, 2015
Frodo: Take off the ring! practical, quantum-secure key exchange from LWE
J Bos, C Costello, L Ducas, I Mironov, M Naehrig, V Nikolaenko, ...
Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications …, 2016
Elliptic curve cryptography in practice
JW Bos, JA Halderman, N Heninger, J Moore, M Naehrig, E Wustrow
International Conference on Financial Cryptography and Data Security, 157-175, 2014
Private predictive analysis on encrypted medical data
JW Bos, K Lauter, M Naehrig
Journal of biomedical informatics 50, 234-243, 2014
Efficient algorithms for supersingular isogeny Diffie-Hellman
C Costello, P Longa, M Naehrig
Annual International Cryptology Conference, 572-601, 2016
A comparison of the homomorphic encryption schemes FV and YASHE
T Lepoint, M Naehrig
International Conference on Cryptology in Africa, 318-335, 2014
Private computation on encrypted genomic data
K Lauter, A López-Alt, M Naehrig
International Conference on Cryptology and Information Security in Latin …, 2014
Geppetto: Versatile verifiable computation
C Costello, C Fournet, J Howell, M Kohlweiss, B Kreuter, M Naehrig, ...
2015 IEEE Symposium on Security and Privacy, 253-270, 2015
New software speed records for cryptographic pairings
M Naehrig, R Niederhagen, P Schwabe
International Conference on Cryptology and Information Security in Latin …, 2010
A family of implementation-friendly BN elliptic curves
GCCF Pereira, MA Simplício Jr, M Naehrig, PSLM Barreto
Journal of Systems and Software 84 (8), 1319-1326, 2011
Faster pairing computations on curves with high-degree twists
C Costello, T Lange, M Naehrig
International Workshop on Public Key Cryptography, 224-242, 2010
Faster computation of the Tate pairing
C Arene, T Lange, M Naehrig, C Ritzenthaler
Journal of number theory 131 (5), 842-857, 2011
Privately evaluating decision trees and random forests
DJ Wu, T Feng, M Naehrig, K Lauter
Proceedings on Privacy Enhancing Technologies 2016 (4), 335-355, 2016
Speeding up the number theoretic transform for faster ideal lattice-based cryptography
P Longa, M Naehrig
International Conference on Cryptology and Network Security, 124-139, 2016
Selecting elliptic curves for cryptography: An efficiency and security analysis
JW Bos, C Costello, P Longa, M Naehrig
Journal of Cryptographic Engineering 6 (4), 259-286, 2016
The system can't perform the operation now. Try again later.
Articles 1–20