Daniel Apon
Bio. I am a postdoctoral researcher at the University of California, Berkeley. I received my PhD in computer science/cryptography from the Univ of Maryland in August 2017, advised by Jonathan Katz. [Past: HRL Laboratories and Univ of Arkansas.]
My Research Interests:
- Cryptographic Program Obfuscation from Standard Assumptions
- Practical Efficiency of Lattice-Based Cryptography
- Computational Hardness of Finding Nash Equilibria
A popular, "unrelated" CSTheory question from my early (2011) work:
http://cstheory.stackexchange.com/questions/791/grid-k-coloring-without-monochromatic-rectangles
7
answers
0
questions
~6k
people reached
-
Berkeley, CA, United States
-
Member for 10 years, 6 months
-
58 profile views
-
Last seen Jun 12 '17 at 16:16
Communities (5)
Top network posts
- 61 What papers should everyone read?
- 56 Major unsolved problems in theoretical computer science?
- 41 What are good references to understanding the proof of the PCP theorem?
- 37 Grid $k$-coloring without monochromatic rectangles
- 30 Hierarchies in NP (under the assumption that P != NP)
- 25 Ways for a mathematician to stay informed of current research in complexity theory
- 24 Advice on good research practices
- View more network posts →
Top tags (8)
Score
8
Posts
6
Posts %
86
Score
4
Posts
2
Score
4
Posts
2
Badges (18)
Gold
—
Silver
10
Rarest
Bronze
8
Rarest
-
Sep 30 '14
-
Sep 5 '10
-
Aug 17 '10