Fine-Grained Cryptography

Explore fine-grained cryptography in this 54-minute lecture by Marshall Ball from NYU. Delve into minimal complexity assumptions for cryptography, examining the classical setting where adversaries run in arbitrary polynomial or subexponential time. Discover why this adversarial class may be excessive in certain situations, such as when n^100 runtime is already infeasible for small n values. Learn about the necessity of considering restricted adversarial classes, particularly in proofs of work. Gain insights into how fine-grained cryptography aims to achieve strong guarantees against these restricted adversarial classes, offering a more nuanced approach to cryptographic security.