World's Best Scientists 2026 revealed!

D-Index & Metrics

Computer Science

D-Index
50
Citations
23309
World Ranking
5467
National Ranking
2495

Research.com Recognitions

  • 2011 - Fellow of Alfred P. Sloan Foundation

Overview

Chris Peikert is affiliated with the University of Michigan-Ann Arbor in the United States and specializes in the field of Computer Science. Their research focuses primarily on cryptography and related computational theories, with significant contributions in several subfields and topics within the discipline.

The main areas of study for Peikert include:

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Information Systems
  • Computer Vision and Pattern Recognition
  • Computer Networks and Communications

The core topics of Peikert's research work cover:

  • Cryptography and Data Security
  • Complexity and Algorithms in Graphs
  • Cryptographic Implementations and Security
  • Privacy-Preserving Technologies in Data
  • Blockchain Technology Applications and Security
  • Cryptography and Residue Arithmetic
  • Chaos-based Image/Signal Encryption

The scientist has authored multiple papers, some of which are recent and notable for their contributions to cryptographic methods and algorithms. Examples include:

  • F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (Extended Version), 2021, arXiv (Cornell University)
  • Algebraically Structured LWE, Revisited, 2024, Journal of Cryptology
  • Improved Hardness of BDD and SVP Under Gap-(S)ETH, 2021, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes, 2023, Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Lattice (List) Decoding Near Minkowski's Inequality, 2021, IEEE Transactions on Information Theory

Peikert often collaborates with other researchers, with frequent coauthors including:

  • Huck Bennett
  • Nicholas Genise
  • Zachary Pepin
  • Axel Feldmann
  • Nikola Samardzic

Their work has been published across a range of scientific venues, including:

  • Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • arXiv (Cornell University)
  • Journal of Cryptology
  • IEEE Transactions on Information Theory
  • IEEE Micro

Chris Peikert also contributed to a book published by Springer Science+Business Media titled Advances in Cryptology - CRYPTO 2021, reflecting engagement with the academic publishing community beyond journal articles.

In recognition of their contributions, Peikert was awarded the title of Fellow of the Alfred P. Sloan Foundation in 2011.

Best Publications

  • Trapdoors for hard lattices and new cryptographic constructions

    Craig Gentry;Chris Peikert;Vinod Vaikuntanathan

  • On Ideal Lattices and Learning with Errors over Rings

    Vadim Lyubashevsky;Chris Peikert;Oded Regev

  • Lossy Trapdoor Functions and Their Applications

    Chris Peikert;Brent Waters

  • Trapdoors for lattices: simpler, tighter, faster, smaller

    Daniele Micciancio;Chris Peikert

  • Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

    Chris Peikert

  • Bonsai trees, or how to delegate a lattice basis

    David Cash;Dennis Hofheinz;Eike Kiltz;Chris Peikert

  • Better key sizes (and attacks) for LWE-based encryption

    Richard Lindner;Chris Peikert

  • A Framework for Efficient and Composable Oblivious Transfer

    Chris Peikert;Vinod Vaikuntanathan;Brent Waters

  • Classical hardness of learning with errors

    Zvika Brakerski;Adeline Langlois;Chris Peikert;Oded Regev

  • Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems

    Benny Applebaum;David Cash;Chris Peikert;Amit Sahai

  • Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices

    Chris Peikert;Alon Rosen

  • Pseudorandom functions and lattices

    Abhishek Banerjee;Chris Peikert;Alon Rosen

  • A Toolkit for Ring-LWE Cryptography.

    Vadim Lyubashevsky;Chris Peikert;Oded Regev

  • Generating Shorter Bases for Hard Random Lattices

    Joël Alwen;Chris Peikert

  • Lattice Cryptography for the Internet.

    Chris Peikert

  • A Decade of Lattice Cryptography

    Chris Peikert

  • An Efficient and Parallel Gaussian Sampler for Lattices.

    Chris Peikert

  • Hardness of SIS and LWE with Small Parameters.

    Daniele Micciancio;Chris Peikert

  • Faster Bootstrapping with Polynomial Error

    Jacob Alperin-Sheriff;Chris Peikert

  • Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem

    Chris Peikert

Frequent Co-Authors

Oded Regev
Oded Regev Courant Institute of Mathematical Sciences
Alon Rosen
Alon Rosen Bocconi University
Brent Waters
Brent Waters The University of Texas at Austin
Vadim Lyubashevsky
Vadim Lyubashevsky IBM (Switzerland)
Craig Gentry
Craig Gentry TripleBlind
Eike Kiltz
Eike Kiltz Ruhr University Bochum
Daniele Micciancio
Daniele Micciancio University of California, San Diego
Shafi Goldwasser
Shafi Goldwasser University of California, Berkeley

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens diverse options for advancing your education and career. Many students and professionals now consider online programs for their flexibility and affordability. For those aiming for leadership within the tech sector, pursuing an online emba can offer advanced management and business skills built on your technical background.

Beyond computer science, related fields such as information management are accessible through the most affordable online mlis programs. These programs prepare graduates for roles in data management, digital libraries, and organizational knowledge systems.

Finding quality graduate education that fits your budget is possible by exploring affordable graduate schools offering a range of specialized online master’s degrees. If your interests lean toward leading teams or organizations, consider an advanced degree such as a doctorate in organizational leadership online. This doctorate can empower you to drive innovation and strategic change in both tech and non-tech environments.

Best Scientists Citing Chris Peikert

Trending Scientists