Unlocking Secure Secrets: Minimal Complexity Assumptions in Cryptography 🔐
Discover how recent advances in cryptography leverage minimal complexity assumptions to enhance security. Join Marshall Ball from NYU as he explores the cutting-edge of fine-grained cryptographic techniques and their practical implications.
Simons Institute for the Theory of Computing
569 views • May 4, 2023
About this video
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.
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.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
569
Likes
7
Duration
53:50
Published
May 4, 2023
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.