default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Naehrig
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c33]Maria Corte-Real Santos, Craig Costello, Michael Naehrig:
On Cycles of Pairing-Friendly Abelian Varieties. CRYPTO (9) 2024: 221-253- [c32]Josh Benaloh, Michael Naehrig, Olivier Pereira, Dan S. Wallach:
ElectionGuard: a Cryptographic Toolkit to Enable Verifiable Elections. USENIX Security Symposium 2024 - [i46]Maria Corte-Real Santos, Craig Costello, Michael Naehrig:
On cycles of pairing-friendly abelian varieties. IACR Cryptol. ePrint Arch. 2024: 869 (2024) - [i45]Josh Benaloh, Michael Naehrig, Olivier Pereira:
REACTIVE: Rethinking Effective Approaches Concerning Trustees in Verifiable Elections. IACR Cryptol. ePrint Arch. 2024: 915 (2024) - [i44]Josh Benaloh, Michael Naehrig, Olivier Pereira, Dan S. Wallach:
ElectionGuard: a Cryptographic Toolkit to Enable Verifiable Elections. IACR Cryptol. ePrint Arch. 2024: 955 (2024) - 2023
- [c31]Giacomo Bruno, Maria Corte-Real Santos
, Craig Costello, Jonathan Komada Eriksen, Michael Meyer, Michael Naehrig, Bruno Sterner:
Cryptographic Smooth Neighbors. ASIACRYPT (7) 2023: 190-221 - 2022
- [i43]Jan Buzek, Junaid Hasan, Jason Liu, Michael Naehrig, Anthony Vigil:
Finding twin smooth integers by solving Pell equations. CoRR abs/2211.04315 (2022) - [i42]Giacomo Bruno, Maria Corte-Real Santos, Craig Costello, Jonathan Komada Eriksen, Michael Naehrig, Michael Meyer, Bruno Sterner:
Cryptographic Smooth Neighbors. IACR Cryptol. ePrint Arch. 2022: 1439 (2022) - 2021
- [c30]Craig Costello, Michael Meyer, Michael Naehrig:
Sieving for Twin Smooth Integers with Solutions to the Prouhet-Tarry-Escott Problem. EUROCRYPT (1) 2021: 272-301 - 2020
- [c29]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover Oracles for Quantum Key Search on AES and LowMC. EUROCRYPT (2) 2020: 280-310 - [c28]Craig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia:
Improved Classical Cryptanalysis of SIKE in Practice. Public Key Cryptography (2) 2020: 505-534 - [c27]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. PQCrypto 2020: 425-444 - [i41]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved quantum circuits for elliptic curve discrete logarithms. CoRR abs/2001.09580 (2020) - [i40]Thomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken:
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms. IACR Cryptol. ePrint Arch. 2020: 77 (2020) - [i39]Craig Costello, Michael Meyer, Michael Naehrig:
Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem. IACR Cryptol. ePrint Arch. 2020: 1283 (2020)
2010 – 2019
- 2019
- [c26]Michael Naehrig, Joost Renes:
Dual Isogenies and Their Application to Public-Key Compression for Isogeny-Based Cryptography. ASIACRYPT (2) 2019: 243-272 - [i38]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover oracles for quantum key search on AES and LowMC. CoRR abs/1910.01700 (2019) - [i37]Craig Costello, Patrick Longa, Michael Naehrig, Joost Renes, Fernando Virdia:
Improved Classical Cryptanalysis of the Computational Supersingular Isogeny Problem. IACR Cryptol. ePrint Arch. 2019: 298 (2019) - [i36]Michael Naehrig, Joost Renes:
Dual Isogenies and Their Application to Public-key Compression for Isogeny-based Cryptography. IACR Cryptol. ePrint Arch. 2019: 499 (2019) - [i35]Samuel Jaques, Michael Naehrig, Martin Roetteler, Fernando Virdia:
Implementing Grover oracles for quantum key search on AES and LowMC. IACR Cryptol. ePrint Arch. 2019: 1146 (2019) - 2017
- [j6]Joppe W. Bos, Michael Naehrig, Joop van de Pol:
Sieving for shortest vectors in ideal lattices: a practical perspective. Int. J. Appl. Cryptogr. 3(4): 313-329 (2017) - [j5]Nathan Dowlin, Ran Gilad-Bachrach, Kim Laine, Kristin E. Lauter, Michael Naehrig, John Wernsing:
Manual for Using Homomorphic Encryption for Bioinformatics. Proc. IEEE 105(3): 552-567 (2017) - [c25]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. ASIACRYPT (2) 2017: 241-270 - [c24]Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient Compression of SIDH Public Keys. EUROCRYPT (1) 2017: 679-706 - [i34]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum resource estimates for computing elliptic curve discrete logarithms. CoRR abs/1706.06752 (2017) - [i33]Martin Roetteler, Michael Naehrig, Krysta M. Svore, Kristin E. Lauter:
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms. IACR Cryptol. ePrint Arch. 2017: 598 (2017) - [i32]Kristin E. Lauter, Michael Naehrig:
Cryptographic Pairings. IACR Cryptol. ePrint Arch. 2017: 1108 (2017) - 2016
- [j4]Joppe W. Bos, Craig Costello, Patrick Longa, Michael Naehrig:
Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptogr. Eng. 6(4): 259-286 (2016) - [j3]David J. Wu, Tony Feng, Michael Naehrig, Kristin E. Lauter:
Privately Evaluating Decision Trees and Random Forests. Proc. Priv. Enhancing Technol. 2016(4): 335-355 (2016) - [c23]Patrick Longa, Michael Naehrig:
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. CANS 2016: 124-139 - [c22]Joppe W. Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, Douglas Stebila:
Frodo: Take off the Ring! Practical, Quantum-Secure Key Exchange from LWE. CCS 2016: 1006-1018 - [c21]Craig Costello, Patrick Longa, Michael Naehrig:
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman. CRYPTO (1) 2016: 572-601 - [c20]Ran Gilad-Bachrach, Nathan Dowlin, Kim Laine, Kristin E. Lauter, Michael Naehrig, John Wernsing:
CryptoNets: Applying Neural Networks to Encrypted Data with High Throughput and Accuracy. ICML 2016: 201-210 - [i31]Craig Costello, Patrick Longa, Michael Naehrig:
Efficient algorithms for supersingular isogeny Diffie-Hellman. IACR Cryptol. ePrint Arch. 2016: 413 (2016) - [i30]Patrick Longa, Michael Naehrig:
Speeding up the Number Theoretic Transform for Faster Ideal Lattice-Based Cryptography. IACR Cryptol. ePrint Arch. 2016: 504 (2016) - [i29]Joppe W. Bos, Craig Costello, Léo Ducas, Ilya Mironov, Michael Naehrig, Valeria Nikolaenko, Ananth Raghunathan, Douglas Stebila:
Frodo: Take off the ring! Practical, Quantum-Secure Key Exchange from LWE. IACR Cryptol. ePrint Arch. 2016: 659 (2016) - [i28]Craig Costello, David Jao, Patrick Longa, Michael Naehrig, Joost Renes, David Urbanik:
Efficient compression of SIDH public keys. IACR Cryptol. ePrint Arch. 2016: 963 (2016) - [i27]Paulo S. L. M. Barreto, Patrick Longa, Michael Naehrig, Jefferson E. Ricardini, Gustavo H. M. Zanon:
Sharper Ring-LWE Signatures. IACR Cryptol. ePrint Arch. 2016: 1026 (2016) - 2015
- [c19]Thomas Pöppelmann, Michael Naehrig, Andrew Putnam, Adrián Macías:
Accelerating Homomorphic Evaluation on Reconfigurable Hardware. CHES 2015: 143-163 - [c18]Paulo S. L. M. Barreto, Craig Costello, Rafael Misoczki, Michael Naehrig, Geovandro C. C. F. Pereira, Gustavo H. M. Zanon:
Subgroup Security in Pairing-Based Cryptography. LATINCRYPT 2015: 245-265 - [c17]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IEEE Symposium on Security and Privacy 2015: 253-270 - [c16]Joppe W. Bos, Craig Costello, Michael Naehrig, Douglas Stebila:
Post-Quantum Key Exchange for the TLS Protocol from the Ring Learning with Errors Problem. IEEE Symposium on Security and Privacy 2015: 553-570 - [i26]Kristin E. Lauter, Adriana López-Alt, Michael Naehrig:
Private Computation on Encrypted Genomic Data. IACR Cryptol. ePrint Arch. 2015: 133 (2015) - [i25]Paulo S. L. M. Barreto, Craig Costello, Rafael Misoczki, Michael Naehrig, C. C. F. Pereira Geovandro, Gustavo H. M. Zanon:
Subgroup security in pairing-based cryptography. IACR Cryptol. ePrint Arch. 2015: 247 (2015) - [i24]David J. Wu, Tony Feng, Michael Naehrig, Kristin E. Lauter:
Privately Evaluating Decision Trees and Random Forests. IACR Cryptol. ePrint Arch. 2015: 386 (2015) - [i23]Thomas Pöppelmann, Michael Naehrig, Andrew Putnam, Adrián Macías:
Accelerating Homomorphic Evaluation on Reconfigurable Hardware. IACR Cryptol. ePrint Arch. 2015: 631 (2015) - 2014
- [j2]Joppe W. Bos, Kristin E. Lauter, Michael Naehrig:
Private predictive analysis on encrypted medical data. J. Biomed. Informatics 50: 234-243 (2014) - [c15]Tancrède Lepoint, Michael Naehrig:
A Comparison of the Homomorphic Encryption Schemes FV and YASHE. AFRICACRYPT 2014: 318-335 - [c14]Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, Eric Wustrow:
Elliptic Curve Cryptography in Practice. Financial Cryptography 2014: 157-175 - [c13]Kristin E. Lauter, Adriana López-Alt, Michael Naehrig:
Private Computation on Encrypted Genomic Data. LATINCRYPT 2014: 3-27 - [i22]Pengtao Xie, Misha Bilenko, Tom Finley, Ran Gilad-Bachrach, Kristin E. Lauter, Michael Naehrig:
Crypto-Nets: Neural Networks over Encrypted Data. CoRR abs/1412.6181 (2014) - [i21]Tancrède Lepoint, Michael Naehrig:
A Comparison of the Homomorphic Encryption Schemes FV and YASHE. IACR Cryptol. ePrint Arch. 2014: 62 (2014) - [i20]Joppe W. Bos, Craig Costello, Patrick Longa, Michael Naehrig:
Selecting Elliptic Curves for Cryptography: An Efficiency and Security Analysis. IACR Cryptol. ePrint Arch. 2014: 130 (2014) - [i19]Joppe W. Bos, Kristin E. Lauter, Michael Naehrig:
Private Predictive Analysis on Encrypted Medical Data. IACR Cryptol. ePrint Arch. 2014: 336 (2014) - [i18]Joppe W. Bos, Craig Costello, Michael Naehrig, Douglas Stebila:
Post-quantum key exchange for the TLS protocol from the ring learning with errors problem. IACR Cryptol. ePrint Arch. 2014: 599 (2014) - [i17]Joppe W. Bos, Michael Naehrig, Joop van de Pol:
Sieving for Shortest Vectors in Ideal Lattices: a Practical Perspective. IACR Cryptol. ePrint Arch. 2014: 880 (2014) - [i16]Craig Costello, Cédric Fournet, Jon Howell, Markulf Kohlweiss, Benjamin Kreuter, Michael Naehrig, Bryan Parno, Samee Zahur:
Geppetto: Versatile Verifiable Computation. IACR Cryptol. ePrint Arch. 2014: 976 (2014) - 2013
- [c12]Joppe W. Bos, Kristin E. Lauter, Jake Loftus, Michael Naehrig:
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme. IMACC 2013: 45-64 - [c11]Chitchanok Chuengsatiansup, Michael Naehrig, Pance Ribarski, Peter Schwabe:
PandA: Pairings and Arithmetic. Pairing 2013: 229-250 - [c10]Joppe W. Bos, Craig Costello, Michael Naehrig:
Exponentiating in Pairing Groups. Selected Areas in Cryptography 2013: 438-455 - [i15]Joppe W. Bos, Kristin E. Lauter, Jake Loftus, Michael Naehrig:
Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme. IACR Cryptol. ePrint Arch. 2013: 75 (2013) - [i14]Joppe W. Bos, Craig Costello, Michael Naehrig:
Exponentiating in Pairing Groups. IACR Cryptol. ePrint Arch. 2013: 458 (2013) - [i13]Joppe W. Bos, J. Alex Halderman, Nadia Heninger, Jonathan Moore, Michael Naehrig, Eric Wustrow:
Elliptic Curve Cryptography in Practice. IACR Cryptol. ePrint Arch. 2013: 734 (2013) - 2012
- [c9]Thore Graepel, Kristin E. Lauter, Michael Naehrig:
ML Confidential: Machine Learning on Encrypted Data. ICISC 2012: 1-21 - [c8]Tolga Acar, Kristin E. Lauter, Michael Naehrig, Daniel Shumow:
Affine Pairings on ARM. Pairing 2012: 203-209 - [i12]Thore Graepel, Kristin E. Lauter, Michael Naehrig:
ML Confidential: Machine Learning on Encrypted Data. IACR Cryptol. ePrint Arch. 2012: 323 (2012) - 2011
- [j1]C. C. F. Pereira Geovandro, Marcos A. Simplício Jr., Michael Naehrig, Paulo S. L. M. Barreto:
A family of implementation-friendly BN elliptic curves. J. Syst. Softw. 84(8): 1319-1326 (2011) - [c7]Michael Naehrig, Kristin E. Lauter, Vinod Vaikuntanathan:
Can homomorphic encryption be practical? CCSW 2011: 113-124 - [c6]Craig Costello, Kristin E. Lauter, Michael Naehrig:
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings. INDOCRYPT 2011: 320-342 - [i11]Tolga Acar, Kristin E. Lauter, Michael Naehrig, Daniel Shumow:
Affine Pairings on ARM. IACR Cryptol. ePrint Arch. 2011: 243 (2011) - [i10]Kristin E. Lauter, Michael Naehrig, Vinod Vaikuntanathan:
Can Homomorphic Encryption be Practical? IACR Cryptol. ePrint Arch. 2011: 405 (2011) - [i9]Craig Costello, Kristin E. Lauter, Michael Naehrig:
Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings. IACR Cryptol. ePrint Arch. 2011: 465 (2011) - 2010
- [c5]Michael Naehrig, Ruben Niederhagen, Peter Schwabe:
New Software Speed Records for Cryptographic Pairings. LATINCRYPT 2010: 109-123 - [c4]Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig:
An Analysis of Affine Coordinates for Pairing Computation. Pairing 2010: 1-20 - [c3]Craig Costello, Tanja Lange, Michael Naehrig:
Faster Pairing Computations on Curves with High-Degree Twists. Public Key Cryptography 2010: 224-242 - [i8]Michael Naehrig, Ruben Niederhagen, Peter Schwabe:
New software speed records for cryptographic pairings. IACR Cryptol. ePrint Arch. 2010: 186 (2010) - [i7]Kristin E. Lauter, Peter L. Montgomery, Michael Naehrig:
An Analysis of Affine Coordinates for Pairing Computation. IACR Cryptol. ePrint Arch. 2010: 363 (2010) - [i6]C. C. F. Pereira Geovandro, Marcos A. Simplício Jr., Michael Naehrig, Paulo S. L. M. Barreto:
A Family of Implementation-Friendly BN Elliptic Curves. IACR Cryptol. ePrint Arch. 2010: 429 (2010)
2000 – 2009
- 2009
- [i5]Christophe Arene, Tanja Lange, Michael Naehrig, Christophe Ritzenthaler:
Faster Computation of the Tate Pairing. IACR Cryptol. ePrint Arch. 2009: 155 (2009) - [i4]Craig Costello, Tanja Lange, Michael Naehrig:
Faster Pairing Computations on Curves with High-Degree Twists. IACR Cryptol. ePrint Arch. 2009: 615 (2009) - 2008
- [c2]Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe:
On Compressible Pairings and Their Computation. AFRICACRYPT 2008: 371-388 - [i3]Laura Hitt O'Connor, Gary McGuire, Michael Naehrig, Marco Streng:
A CM construction for curves of genus 2 with p-rank 1. IACR Cryptol. ePrint Arch. 2008: 491 (2008) - 2007
- [i2]Michael Naehrig, Paulo S. L. M. Barreto, Peter Schwabe:
On compressible pairings and their computation. IACR Cryptol. ePrint Arch. 2007: 429 (2007) - 2005
- [c1]Paulo S. L. M. Barreto, Michael Naehrig:
Pairing-Friendly Elliptic Curves of Prime Order. Selected Areas in Cryptography 2005: 319-331 - [i1]Paulo S. L. M. Barreto, Michael Naehrig:
Pairing-Friendly Elliptic Curves of Prime Order. IACR Cryptol. ePrint Arch. 2005: 133 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-21 21:32 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
