Overview

Classically, a cryptographic construction is considered secure if and only if there is no polynomial-time attack. This definition is quite convenient and has proven to be extremely useful. However, the distinction between polynomial time and super-polynomial time can seem artificial at times. E.g., in many settings a, say, 2^n1/10-time attack would be devastating. In other settings, we cannot hope to (or might not even want to!) rule out, say, n¹⁰-time attacks, but we do still want to rule out, say, n²-time attacks.

This leads to the concept of fine-grained cryptography, an off-shoot of the exciting area of fine-grained complexity. At a high level, fine-grained cryptography dispenses with the coarse distinction between polynomial-time attacks and super-polynomial-time attacks and instead focuses on understanding more precisely the exact complexity of attacking certain cryptographic schemes and of related problems.

This workshop will focus on exciting developments in the (still quite new) field of fine-grained cryptography, such as fine-grained cryptographic constructions, fine-grained hardness proofs for computational problems relevant to cryptography, fine-grained worst-case to average-case reductions, and more. The workshop will be accessible to a broad theoretical computer science audience, and no prior knowledge in fine-grained cryptography will be assumed.

Participation

Registration Fees:

For registration and other information please click here.