Peter Schwabe
Artificial Intelligence · 2009–2019
A researcher in the Science corpus: 10 papers; trusts 38 researchers and is trusted by 14 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 107 citations into it; #11,657 of 35,345 by trust here, #10,667 by citations
- Computational Theory and Mathematics — 38 citations into it
- Information Systems — 30 citations into it
- Computer Vision and Pattern Recognition — 26 citations into it; #16,556 of 21,575 by trust here, #14,822 by citations
- Computer Networks and Communications — 13 citations into it; #7,236 of 9,886 by trust here, #8,191 by citations
- Geometry and Topology — 6 citations into it
- Privacy & Security — 5 citations into it
Whom Peter Schwabe trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Daniel J. Bernstein
- Vadim Lyubashevsky
- Chris Peikert
- Oded Regev
- David Canright
- David A. McGrew
- Frederik Vercauteren
- Tim Erhan Güneysu
- Paulo L. Barreto
- Michael Naehrig
Who trusts Peter Schwabe overall
- Daniel J. Bernstein
- Patrick Longa
- Léo Ducas
- Michael Schwarz
- Joppe W. Bos
- Daniel Gruss
- Tiago M. Fernández-Caramés
- Tanja Lange
Papers from Peter Schwabe's perspective
Ordered by how strongly the researchers Peter Schwabe trusts endorse each paper. Same corpus, a different order for every researcher.
- On Ideal Lattices and Learning with Errors over Rings
- On lattices, learning with errors, random linear codes, and cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Lattice Signatures Without Trapdoors (IACR Cryptology ePrint Archive)
- Lattice Signatures and Bimodal Gaussians (IACR Cryptology ePrint Archive)
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- Random oracles are practical: a paradigm for designing efficient protocols
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Bonsai Trees, or How to Delegate a Lattice Basis (Journal of Cryptology)
- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (Theory of Cryptography Conference)
Their papers
- CRYSTALS - Kyber: A CCA-Secure Module-Lattice-Based KEM (2017) — 1,190 citations
- The SPHINCS+ Signature Framework (2019) — 401 citations
- CRYSTALS-Dilithium: A Lattice-Based Digital Signature Scheme (2018) — 826 citations
- Post-quantum Key Exchange - A New Hope (2016) — 992 citations
- SPHINCS: Practical Stateless Hash-Based Signatures (2015) — 430 citations
- Software Speed Records for Lattice-Based Signatures (2013) — 87 citations
- The Security Impact of a New Cryptographic Library (2012) — 272 citations
- High-speed high-security signatures (2011) — 831 citations
- New Software Speed Records for Cryptographic Pairings (2010) — 126 citations
- Faster and Timing-Attack Resistant AES-GCM (2009) — 303 citations