Alon Rosen
Artificial Intelligence · 2006–2017
A researcher in the Science corpus: 5 papers; trusts 34 researchers and is trusted by 27 researchers here, as inferred from the citation graph.
Subfields
- Artificial Intelligence — 75 citations into it; #5,118 of 35,345 by trust here, #10,798 by citations
- Computational Theory and Mathematics — 44 citations into it; #6,105 of 12,182 by trust here, #5,954 by citations
- Computer Vision and Pattern Recognition — 21 citations into it; #9,161 of 21,575 by trust here, #14,478 by citations
- Privacy & Security — 11 citations into it
- Computer Networks and Communications — 8 citations into it
- Information Systems — 8 citations into it
Whom Alon Rosen trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
- Chris Peikert
- Oded Goldreich
- Oded Regev
- Daniele Micciancio
- Vadim Lyubashevsky
- Mihir Bellare
- Craig Gentry
- Dan Boneh
- Moni Naor
- Rafail M. Ostrovsky
Who trusts Alon Rosen overall
- Vadim Lyubashevsky
- Chris Peikert
- Zvika Brakerski
- Oded Regev
- Léo Ducas
- Damien Stehlé
- Daniele Micciancio
- Adeline Langlois
- Vinod Vaikuntanathan
- Mark Zhandry
Papers from Alon Rosen's perspective
Ordered by how strongly the researchers Alon Rosen trusts endorse each paper. Same corpus, a different order for every researcher.
- On lattices, learning with errors, random linear codes, and cryptography
- Random oracles are practical: a paradigm for designing efficient protocols
- Fully homomorphic encryption using ideal lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Noise-tolerant learning, the parity problem, and the statistical query model (Symposium on the Theory of Computing)
- Collision-Free Hashing from Lattice Problems
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (IACR Cryptology ePrint Archive)
- On Ideal Lattices and Learning with Errors over Rings
- Computationally Sound Proofs
- Public-key cryptosystems from the worst-case shortest vector problem: extended abstract (Symposium on the Theory of Computing)
Their papers
- Pseudorandom Functions and Lattices (2012) — 528 citations
- Efficient Collision-Resistant Hashing from Worst-Case Assumptions on Cyclic Lattices (2006) — 331 citations
- On the existence of extractable one-way functions (2014) — 137 citations
- Pseudorandom Functions: Three Decades Later (2017) — 63 citations
- SWIFFT: A Modest Proposal for FFT Hashing (2008) — 311 citations