Martin R. Albrecht
Artificial Intelligence · 2015–2019
A researcher in the Science corpus: 5 papers; trusts 14 researchers and is trusted by 23 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 79 citations into it; #8,666 of 35,345 by trust here, #11,072 by citations
- Computational Theory and Mathematics — 44 citations into it
- Information Systems — 17 citations into it
- Privacy & Security — 15 citations into it
Whom Martin R. Albrecht trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Chris Peikert
- Craig Gentry
- Zvika Brakerski
- Nicolas Gama
- Sanjeev Arora
- Richard Lindner
- Daniele Micciancio
- Oded Regev
- Phong Q. Nguyen
- Shai Halevi
Who trusts Martin R. Albrecht overall
- Hao Chen
- Kim Laine
- Joppe W. Bos
- Abbas Acar
- Lorenzo Grassi
- E. Alkım
- M. Sadegh Riazi
- Sujoy Sinha Roy
- Ilaria Chillotti
- Chiraag Shashikant Juvekar
Papers from Martin R. Albrecht's perspective
Ordered by how strongly the researchers Martin R. Albrecht trusts endorse each paper. Same corpus, a different order for every researcher.
- Predicting Lattice Reduction (International Conference on the Theory and Application of Cryptographic Techniques)
- Lossy trapdoor functions and their applications (SIAM journal on computing (Print))
- Generating hard instances of lattice problems (extended abstract)
- Fully homomorphic encryption using ideal lattices
- A fully homomorphic encryption scheme
- Better Key Sizes (and Attacks) for LWE-Based Encryption
- On lattices, learning with errors, random linear codes, and cryptography
- On Ideal Lattices and Learning with Errors over Rings
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
- Trapdoors for hard lattices and new cryptographic constructions
Their papers
- Homomorphic Encryption Standard (2019) — 295 citations
- A Subfield Lattice Attack on Overstretched NTRU Assumptions - Cryptanalysis of Some FHE and Graded Encoding Schemes (2016) — 256 citations
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (2016) — 363 citations
- On the concrete hardness of Learning with Errors (2015) — 1,055 citations
- Ciphers for MPC and FHE (2015) — 441 citations