Chris Peikert

14.8k total citations · 1 hit paper
31 papers, 1.6k citations indexed

About

Chris Peikert is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Information Systems. According to data from OpenAlex, Chris Peikert has authored 31 papers receiving a total of 1.6k indexed citations (citations by other indexed papers that have themselves been cited), including 28 papers in Artificial Intelligence, 17 papers in Computational Theory and Mathematics and 6 papers in Information Systems. Recurrent topics in Chris Peikert's work include Cryptography and Data Security (26 papers), Complexity and Algorithms in Graphs (17 papers) and Cryptographic Implementations and Security (8 papers). Chris Peikert is often cited by papers focused on Cryptography and Data Security (26 papers), Complexity and Algorithms in Graphs (17 papers) and Cryptographic Implementations and Security (8 papers). Chris Peikert collaborates with scholars based in United States, United Kingdom and Israel. Chris Peikert's co-authors include Oded Regev, Vadim Lyubashevsky, Joël Alwen, Eike Kiltz, Dennis Hofheinz, David M. Cash, Craig Gentry, Abhi Shelat, Vinod Vaikuntanathan and Daniel Dadush and has published in prestigious journals such as IEEE Transactions on Information Theory, Journal of the ACM and SIAM Journal on Computing.

In The Last Decade

Chris Peikert

31 papers receiving 1.6k citations

Hit Papers

On Ideal Lattices and Learning with Errors over Rings 2013 2026 2017 2021 2013 100 200 300
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. On Ideal Lattices and Learning with Errors over Rings
    2013 382 citations Vadim Lyubashevsky, Chris Peikert et al. Journal of the ACM profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Chris Peikert United States 17 1.5k 566 461 305 243 31 1.6k
Yuval Ishai Israel 27 2.1k 1.4× 834 1.5× 452 1.0× 178 0.6× 390 1.6× 104 2.3k
Tal Rabin United States 21 1.5k 1.0× 405 0.7× 579 1.3× 195 0.6× 603 2.5× 46 1.8k
Rosario Gennaro United States 27 2.1k 1.4× 389 0.7× 896 1.9× 367 1.2× 657 2.7× 70 2.4k
Gregory Neven Switzerland 17 1.1k 0.7× 220 0.4× 545 1.2× 245 0.8× 296 1.2× 49 1.3k
Zvika Brakerski Israel 13 2.8k 1.9× 919 1.6× 837 1.8× 466 1.5× 307 1.3× 37 3.0k
Fangguo Zhang China 20 1.2k 0.8× 209 0.4× 743 1.6× 227 0.7× 359 1.5× 144 1.5k
Yuliang Zheng Australia 15 849 0.6× 197 0.3× 350 0.8× 222 0.7× 248 1.0× 103 1.1k
Tal Malkin United States 20 1.1k 0.7× 310 0.5× 268 0.6× 134 0.4× 416 1.7× 54 1.4k
Yael Tauman Kalai United States 16 979 0.7× 404 0.7× 232 0.5× 129 0.4× 168 0.7× 52 1.1k
Arjen K. Lenstra United States 21 1.0k 0.7× 329 0.6× 560 1.2× 283 0.9× 293 1.2× 55 1.4k

Countries citing papers authored by Chris Peikert

Since Specialization
Citations

This map shows the geographic impact of Chris Peikert's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Chris Peikert with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Chris Peikert more than expected).

Fields of papers citing papers by Chris Peikert

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Chris Peikert. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Chris Peikert. The network helps show where Chris Peikert may publish in the future.

Co-authorship network of co-authors of Chris Peikert

This figure shows the co-authorship network connecting the top 25 collaborators of Chris Peikert. A scholar is included among the top collaborators of Chris Peikert based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Chris Peikert. Chris Peikert is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Peikert, Chris, et al.. (2024). Algebraically Structured LWE, Revisited. Journal of Cryptology. 37(3). 1 indexed citations
2.
Peikert, Chris, et al.. (2020). Hardness of Bounded Distance Decoding on Lattices in 𝓁_p Norms. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
3.
Peikert, Chris, Oded Regev, & Noah Stephens-Davidowitz. (2017). Pseudorandomness of ring-LWE for any ring and modulus. 461–473. 41 indexed citations
4.
Peikert, Chris, et al.. (2016). Λολ. 993–1005. 5 indexed citations
5.
Peikert, Chris. (2016). A Decade of Lattice Cryptography. now publishers, Inc. eBooks. 88 indexed citations
6.
Gentry, Craig, Jens Groth, Yuval Ishai, et al.. (2014). Using Fully Homomorphic Hybrid Encryption to Minimize Non-interative Zero-Knowledge Proofs. Journal of Cryptology. 28(4). 820–843. 25 indexed citations
7.
Lyubashevsky, Vadim, Chris Peikert, & Oded Regev. (2013). On Ideal Lattices and Learning with Errors over Rings. Journal of the ACM. 60(6). 1–35. 382 indexed citations breakdown →
8.
Chung, Kai-Min, Daniel Dadush, Feng-Hao Liu, & Chris Peikert. (2013). On the Lattice Smoothing Parameter Problem. 230–241. 6 indexed citations
9.
Gentry, Craig, Shai Halevi, Chris Peikert, & Nigel P. Smart. (2012). Security and Cryptography for Networks - SCN 2012. Springer US. 2 indexed citations
10.
Cash, David M., Dennis Hofheinz, Eike Kiltz, & Chris Peikert. (2011). Bonsai Trees, or How to Delegate a Lattice Basis. Journal of Cryptology. 25(4). 601–639. 122 indexed citations
11.
Goldwasser, Shafi, Yael Tauman Kalai, Chris Peikert, & Vinod Vaikuntanathan. (2010). Robustness of the Learning with Errors Assumption. DSpace@MIT (Massachusetts Institute of Technology). 230–240. 29 indexed citations
12.
Dadush, Daniel, Chris Peikert, & Santosh Vempala. (2010). Enumerative Algorithms for the Shortest and Closest Lattice Vector Problems in Any Norm via M-Ellipsoid Coverings. arXiv (Cornell University). 4 indexed citations
13.
Alwen, Joël & Chris Peikert. (2010). Generating Shorter Bases for Hard Random Lattices. Theory of Computing Systems. 48(3). 535–553. 184 indexed citations
14.
Alwen, Joël & Chris Peikert. (2009). Generating Shorter Bases for Hard Random Lattices. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 64 indexed citations
15.
Peikert, Chris. (2009). Public-key cryptosystems from the worst-case shortest vector problem. 333–342. 284 indexed citations
16.
Peikert, Chris. (2009). Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem. IACR Cryptology ePrint Archive. 15. 0. 55 indexed citations
17.
Gentry, Craig, Chris Peikert, & Vinod Vaikuntanathan. (2008). Trapdoors for hard lattices and new cryptographic constructions. 2007. 197–206. 51 indexed citations
18.
Peikert, Chris. (2008). Limits on the Hardness of Lattice Problems in ℓ p Norms. Computational Complexity. 17(2). 300–351. 23 indexed citations
19.
Micali, Silvio, et al.. (2004). Completely fair SFE and coalition-safe cheap talk. 1–10. 38 indexed citations
20.
Peikert, Chris, Abhi Shelat, & Adam Smith. (2003). Lower bounds for collusion-secure fingerprinting. Symposium on Discrete Algorithms. 472–479. 22 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Yuval Ishai Breakdown of academic impact, for papers by Tal Rabin Breakdown of academic impact, for papers by Rosario Gennaro Breakdown of academic impact, for papers by Gregory Neven Breakdown of academic impact, for papers by Zvika Brakerski Breakdown of academic impact, for papers by Fangguo Zhang Breakdown of academic impact, for papers by Yuliang Zheng Breakdown of academic impact, for papers by Tal Malkin Breakdown of academic impact, for papers by Yael Tauman Kalai Breakdown of academic impact, for papers by Arjen K. Lenstra
Rankless by CCL
2026