Pairing-Friendly Elliptic Curves of Prime Order. - Paulo S. L. M. Barreto; Michael Naehrig (IACR Cryptol. ePrint Arch., 2005)

On compressible pairings and their computation. - Michael Naehrig; Paulo S. L. M. Barreto; Peter Schwabe (IACR Cryptol. ePrint Arch., 2007)

A CM construction for curves of genus 2 with p-rank 1. - Laura Hitt O'Connor; Gary McGuire; Michael Naehrig; Marco Streng (IACR Cryptol. ePrint Arch., 2008)

Faster Computation of the Tate Pairing. - Christophe Arene; Tanja Lange 001; Michael Naehrig; Christophe Ritzenthaler (IACR Cryptol. ePrint Arch., 2009)

Faster Pairing Computations on Curves with High-Degree Twists. - Craig Costello; Tanja Lange 001; Michael Naehrig (IACR Cryptol. ePrint Arch., 2009)

An Analysis of Affine Coordinates for Pairing Computation. - Kristin E. Lauter; Peter L. Montgomery; Michael Naehrig (IACR Cryptol. ePrint Arch., 2010)

New software speed records for cryptographic pairings. - Michael Naehrig; Ruben Niederhagen; Peter Schwabe (IACR Cryptol. ePrint Arch., 2010)

Affine Pairings on ARM. - Tolga Acar; Kristin E. Lauter; Michael Naehrig; Daniel Shumow (IACR Cryptol. ePrint Arch., 2011)

Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings. - Craig Costello; Kristin E. Lauter; Michael Naehrig (IACR Cryptol. ePrint Arch., 2011)

Can Homomorphic Encryption be Practical? - Kristin E. Lauter; Michael Naehrig; Vinod Vaikuntanathan (IACR Cryptol. ePrint Arch., 2011)

A family of implementation-friendly BN elliptic curves. - C. C. F. Pereira Geovandro; Marcos A. Simplício Jr.; Michael Naehrig; Paulo S. L. M. Barreto (J. Syst. Softw., 2011)

ML Confidential: Machine Learning on Encrypted Data. - Thore Graepel; Kristin E. Lauter; Michael Naehrig (IACR Cryptol. ePrint Arch., 2012)

PandA: Pairings and Arithmetic. - Chitchanok Chuengsatiansup; Michael Naehrig; Pance Ribarski; Peter Schwabe (Pairing, 2013)

Exponentiating in Pairing Groups. - Joppe W. Bos; Craig Costello; Michael Naehrig (IACR Cryptol. ePrint Arch., 2013)

Elliptic Curve Cryptography in Practice. - Joppe W. Bos; J. Alex Halderman; Nadia Heninger; Jonathan Moore; Michael Naehrig; Eric Wustrow (IACR Cryptol. ePrint Arch., 2013)

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme. - Joppe W. Bos; Kristin E. Lauter; Jake Loftus; Michael Naehrig (IACR Cryptol. ePrint Arch., 2013)

Crypto-Nets: Neural Networks over Encrypted Data. - Pengtao Xie; Misha Bilenko; Tom Finley; Ran Gilad-Bachrach; Kristin E. Lauter; Michael Naehrig (CoRR, 2014)

Post-quantum key exchange for the TLS protocol from the ring learning with errors problem. - Joppe W. Bos; Craig Costello; Michael Naehrig; Douglas Stebila (IACR Cryptol. ePrint Arch., 2014)

Geppetto: Versatile Verifiable Computation. - Craig Costello; Cédric Fournet; Jon Howell; Markulf Kohlweiss; Benjamin Kreuter; Michael Naehrig; Bryan Parno; Samee Zahur (IACR Cryptol. ePrint Arch., 2014)

A Comparison of the Homomorphic Encryption Schemes FV and YASHE. - Tancrède Lepoint; Michael Naehrig (IACR Cryptol. ePrint Arch., 2014)

Private predictive analysis on encrypted medical data. - Joppe W. Bos; Kristin E. Lauter; Michael Naehrig (J. Biomed. Informatics, 2014)

Subgroup security in pairing-based cryptography. - Paulo S. L. M. Barreto; Craig Costello; Rafael Misoczki; Michael Naehrig; C. C. F. Pereira Geovandro; Gustavo H. M. Zanon (IACR Cryptol. ePrint Arch., 2015)

Private Computation on Encrypted Genomic Data. - Kristin E. Lauter; Adriana López-Alt; Michael Naehrig (IACR Cryptol. ePrint Arch., 2015)

Accelerating Homomorphic Evaluation on Reconfigurable Hardware. - Thomas Pöppelmann; Michael Naehrig; Andrew Putnam; Adrián Macías (IACR Cryptol. ePrint Arch., 2015)

CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy. - Ran Gilad-Bachrach; Nathan Dowlin; Kim Laine; Kristin E. Lauter; Michael Naehrig; John Wernsing (ICML, 2016)

Sharper Ring-LWE Signatures. - Paulo S. L. M. Barreto; Patrick Longa; Michael Naehrig; Jefferson E. Ricardini; Gustavo H. M. Zanon (IACR Cryptol. ePrint Arch., 2016)

Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE. - Joppe W. Bos; Craig Costello; Léo Ducas; Ilya Mironov; Michael Naehrig; Valeria Nikolaenko; Ananth Raghunathan; Douglas Stebila (IACR Cryptol. ePrint Arch., 2016)

Efficient compression of SIDH public keys. - Craig Costello; David Jao; Patrick Longa; Michael Naehrig; Joost Renes; David Urbanik (IACR Cryptol. ePrint Arch., 2016)

Efficient algorithms for supersingular isogeny Diffie-Hellman. - Craig Costello; Patrick Longa; Michael Naehrig (IACR Cryptol. ePrint Arch., 2016)

Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. - Patrick Longa; Michael Naehrig (IACR Cryptol. ePrint Arch., 2016)

Selecting elliptic curves for cryptography: an efficiency and security analysis. - Joppe W. Bos; Craig Costello; Patrick Longa; Michael Naehrig (J. Cryptogr. Eng., 2016)

Privately Evaluating Decision Trees and Random Forests. - David J. Wu 001; Tony Feng; Michael Naehrig; Kristin E. Lauter (Proc. Priv. Enhancing Technol., 2016)

Cryptographic Pairings. - Kristin E. Lauter; Michael Naehrig (IACR Cryptol. ePrint Arch., 2017)

Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. - Martin Roetteler; Michael Naehrig; Krysta M. Svore; Kristin E. Lauter (IACR Cryptol. ePrint Arch., 2017)

Sieving for shortest vectors in ideal lattices: a practical perspective. - Joppe W. Bos; Michael Naehrig; Joop van de Pol (Int. J. Appl. Cryptogr., 2017)

Manual for Using Homomorphic Encryption for Bioinformatics. - Nathan Dowlin; Ran Gilad-Bachrach; Kim Laine; Kristin E. Lauter; Michael Naehrig; John Wernsing (Proc. IEEE, 2017)

Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem. - Craig Costello; Patrick Longa; Michael Naehrig; Joost Renes; Fernando Virdia (IACR Cryptol. ePrint Arch., 2019)

Implementing Grover oracles for quantum key search on AES and LowMC. - Samuel Jaques; Michael Naehrig; Martin Roetteler; Fernando Virdia (IACR Cryptol. ePrint Arch., 2019)

Dual Isogenies and Their Application to Public-key Compression for Isogeny-based Cryptography. - Michael Naehrig; Joost Renes (IACR Cryptol. ePrint Arch., 2019)

Improved Classical Cryptanalysis of SIKE in Practice. - Craig Costello; Patrick Longa; Michael Naehrig; Joost Renes; Fernando Virdia (Public Key Cryptography (2), 2020)

Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem. - Craig Costello; Michael Meyer 001; Michael Naehrig (IACR Cryptol. ePrint Arch., 2020)

Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. - Thomas Häner; Samuel Jaques; Michael Naehrig; Martin Roetteler; Mathias Soeken (IACR Cryptol. ePrint Arch., 2020)

Finding twin smooth integers by solving Pell equations. - Jan Buzek; Junaid Hasan; Jason Liu; Michael Naehrig; Anthony Vigil (CoRR, 2022)

Cryptographic Smooth Neighbors. - Giacomo Bruno; Maria Corte-Real Santos; Craig Costello; Jonathan Komada Eriksen; Michael Naehrig; Michael Meyer 001; Bruno Sterner (IACR Cryptol. ePrint Arch., 2022)

REACTIVE: Rethinking Effective Approaches Concerning Trustees in Verifiable Elections. - Josh Benaloh; Michael Naehrig; Olivier Pereira (IACR Cryptol. ePrint Arch., 2024)

ElectionGuard: a Cryptographic Toolkit to Enable Verifiable Elections. - Josh Benaloh; Michael Naehrig; Olivier Pereira; Dan S. Wallach (IACR Cryptol. ePrint Arch., 2024)

On cycles of pairing-friendly abelian varieties. - Maria Corte-Real Santos; Craig Costello; Michael Naehrig (IACR Cryptol. ePrint Arch., 2024)

The DROP Protocol: Dispute Resolution via Observation in Public for Verifiable, In-Person Voting. - Josh Benaloh; Michael Naehrig; Olivier Pereira (IACR Cryptol. ePrint Arch., 2025)