Chris Peikert
Artificial Intelligence · 2006–2021
A researcher in the Science corpus: 21 papers; trusts 90 researchers and is trusted by 177 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 329 citations into it; #1,720 of 36,961 by trust here, #1,874 by citations
- Computational Theory and Mathematics — 205 citations into it; #65 of 12,489 by trust here, #116 by citations
- Information Systems — 86 citations into it; #400 of 9,233 by trust here, #1,805 by citations
- Computer Vision and Pattern Recognition — 53 citations into it; #4,698 of 21,973 by trust here, #7,333 by citations
- Computer Networks and Communications — 46 citations into it; #301 of 9,996 by trust here, #1,018 by citations
- Privacy & Security — 41 citations into it
- Language and Linguistics — 10 citations into it
- Mathematical Optimization — 10 citations into it
Whom Chris Peikert trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Oded Regev
- Daniele Micciancio
- Craig Gentry
- Vadim Lyubashevsky
- Dan Boneh
- Zvika Brakerski
- Oded Goldreich
- Vinod Vaikuntanathan
- Brent Waters
- Joël Alwen
Who trusts Chris Peikert overall
- Vadim Lyubashevsky
- Daniele Micciancio
- Zvika Brakerski
- Damien Stehlé
- Joppe W. Bos
- Vinod Vaikuntanathan
- Oded Regev
- Léo Ducas
- Craig Gentry
- Shai Halevi
Papers from Chris Peikert's perspective
Ordered by how strongly the researchers Chris Peikert trusts endorse each paper. Same corpus, a different order for every researcher.
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Random oracles are practical: a paradigm for designing efficient protocols
- Fully homomorphic encryption using ideal lattices
- On Ideal Lattices and Learning with Errors over Rings
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- New Directions in Cryptography
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
Their papers
- Trapdoors for hard lattices and new cryptographic constructions (2008) — 2,665 citations
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (2009) — 999 citations
- Generating Shorter Bases for Hard Random Lattices (2009) — 570 citations
- On Ideal Lattices and Learning with Errors over Rings (2010) — 2,898 citations
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (2012) — 1,302 citations
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems (2009) — 656 citations
- An Efficient and Parallel Gaussian Sampler for Lattices (2010) — 446 citations
- Better Key Sizes (and Attacks) for LWE-Based Encryption (2011) — 796 citations
- Pseudorandom Functions and Lattices (2012) — 528 citations
- Hardness of SIS and LWE with Small Parameters (2013) — 340 citations
- A Decade of Lattice Cryptography (2016) — 693 citations
- Faster Bootstrapping with Polynomial Error (2014) — 322 citations
- F1: A Fast and Programmable Accelerator for Fully Homomorphic Encryption (2021) — 375 citations
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (2020) — 51 citations
- Lattice Cryptography for the Internet (2014) — 407 citations
- A Toolkit for Ring-LWE Cryptography (2013) — 493 citations
- Classical hardness of learning with errors (2013) — 743 citations
- Bonsai Trees, or How to Delegate a Lattice Basis (2010) — 949 citations
- Lossy trapdoor functions and their applications (2008) — 631 citations
- SWIFFT: A Modest Proposal for FFT Hashing (2008) — 311 citations