Unveiling the Complexity of Cryptography: Advisor-Verifier-Prover Games 🔐
Explore how Advisor-Verifier-Prover games impact the hardness of information-theoretic cryptography and what minimal assumptions are needed for secure protocols, presented by Benny Applebaum.
Simons Institute for the Theory of Computing
376 views • May 5, 2023
About this video
Benny Applebaum (Tel-Aviv University)
https://simons.berkeley.edu/talks/benny-applebaum-tel-aviv-university-2023-05-04
Minimal Complexity Assumptions for Cryptography
Note: This talk will be presented virtually. | For most cryptographic tasks the existence of one-way functions is known to be a necessary condition. Still, there are quite a few problems for which we currently cannot rule out the existence of efficient information-theoretic solution. In this talk, I will describe several examples and present a new hypothesis on the existence of certain proof systems that implies, in a unified way, the impossibility of efficient information-theoretic solutions for several important tasks.
https://simons.berkeley.edu/talks/benny-applebaum-tel-aviv-university-2023-05-04
Minimal Complexity Assumptions for Cryptography
Note: This talk will be presented virtually. | For most cryptographic tasks the existence of one-way functions is known to be a necessary condition. Still, there are quite a few problems for which we currently cannot rule out the existence of efficient information-theoretic solution. In this talk, I will describe several examples and present a new hypothesis on the existence of certain proof systems that implies, in a unified way, the impossibility of efficient information-theoretic solutions for several important tasks.
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
376
Likes
6
Duration
37:31
Published
May 5, 2023
Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.