Unlocking Secure Secrets: Minimal Complexity Assumptions in Cryptography 🔐

Marshall Ball (NYU) https://simons.berkeley.edu/talks/marshall-ball-nyu-2023-05-03 Minimal Complexity Assumptions for Cryptography In a classical cryptographic setting, one is considered with adversaries running in arbitrary polynomial time (or even subexponential time). In many situations, this adversarial class may be overkill. For example, running in time n^100 is already infeasible for small values of n. In other cases (such as with proofs of work), it may be necessary to consider restricted adversarial classes. Fine-grained cryptography focuses on achieving strong guarantees against such restricted adversarial classes.