Talks
Fall 2015

Getting Harder All the Time?
Tuesday, September 29th, 2015, 11:45 am–12:00 pm
I will briefly describe a couple of widely open research directions in Cryptography that are closely related to fine-grained Complexity. First, we will demonstrate the importance of exact hardness bounds through the notion of “proof of work.” Then we will wonder how Cryptographic hardness can be formed.
Attachment | Size |
---|---|
![]() | 393.17 KB |