Michael Naehrig
Artificial Intelligence · 2005–2016
A researcher in the Science corpus: 16 papers; trusts 74 researchers and is trusted by 140 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 247 citations into it; #2,457 of 36,961 by trust here, #2,508 by citations
- Computational Theory and Mathematics — 110 citations into it; #697 of 12,489 by trust here, #788 by citations
- Information Systems — 100 citations into it; #385 of 9,233 by trust here, #373 by citations
- Privacy & Security — 53 citations into it; #257 of 710 by trust here, #217 by citations
- Computer Networks and Communications — 36 citations into it; #5,428 of 9,996 by trust here, #707 by citations
- Computer Vision and Pattern Recognition — 32 citations into it; #7,992 of 21,973 by trust here, #9,458 by citations
- Geometry and Topology — 18 citations into it
- Hardware and Architecture — 10 citations into it
Whom Michael Naehrig trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Craig Gentry
- Zvika Brakerski
- Chris Peikert
- Vadim Lyubashevsky
- Frederik Vercauteren
- Paulo L. Barreto
- Daniel J. Bernstein
- Dan Boneh
- Oded Regev
- Vinod Vaikuntanathan
Who trusts Michael Naehrig overall
- Miran Kim
- Dan Boneh
- Kristin E. Lauter
- Craig Gentry
- M. Sadegh Riazi
- David Mandell Freeman
- Sujoy Sinha Roy
- Bryan Parno
- Joppe W. Bos
- Frederik Vercauteren
Papers from Michael Naehrig's perspective
Ordered by how strongly the researchers Michael Naehrig trusts endorse each paper. Same corpus, a different order for every researcher.
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Trapdoors for hard lattices and new cryptographic constructions
- Random oracles are practical: a paradigm for designing efficient protocols
- A fully homomorphic encryption scheme
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- New Directions in Cryptography
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
Their papers
- CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy (2016) — 1,950 citations
- ML Confidential: Machine Learning on Encrypted Data (2012) — 502 citations
- Crypto-Nets: Neural Networks over Encrypted Data (2014) — 160 citations
- Can homomorphic encryption be practical? (2011) — 1,184 citations
- Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme (2013) — 476 citations
- Private Predictive Analysis on Encrypted Medical Data (2014) — 317 citations
- Private Computation on Encrypted Genomic Data (2014) — 195 citations
- Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography (2016) — 295 citations
- Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE (2016) — 440 citations
- Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem (2015) — 391 citations
- Accelerating Homomorphic Evaluation on Reconfigurable Hardware (2015) — 70 citations
- Geppetto: Versatile Verifiable Computation (2015) — 241 citations
- Elliptic Curve Cryptography in Practice (2014) — 303 citations
- New Software Speed Records for Cryptographic Pairings (2010) — 126 citations
- Constructive and computational aspects of cryptographic pairings (2009) — 26 citations
- Pairing-Friendly Elliptic Curves of Prime Order (2005) — 1,116 citations