Completed
Cryptographic Leakge Resilience Upper Bounds BMN17
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
ITC Conference: P4-Free Partition and Cover Numbers & Applications
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 Distilling Shared Keys & Private Randomness
- 3 Application 1: Cryptographic Complexity Lower Bounds
- 4 Cryptographic Leakge Resilience Upper Bounds BMN17
- 5 Communication Complexity Computation of Boolean function () relative to the EQ-oracle
- 6 PA-free Bipartite Graphs: The Protagonist
- 7 Intuition: P4-free Bipartite Graphs
- 8 Flat Joint Distribution
- 9 Flat Distributions as Bipartite Graphs
- 10 Joint Distributions Needing No Genie Assistance
- 11 P-Graphs have no Leakage Resilience
- 12 Illustrative Example
- 13 Connection to Shared Key & Randomness Extraction
- 14 Existing Information-theoretic & Edge-covering Measures are Imprecise
- 15 Hardness of P-free Partition Number
- 16 Graphs with High PA-free Partition Number
- 17 Connection to Non-deterministic Communication Complexity
- 18 Hardness of P-free Cover Number
- 19 Graphs with High PA-free Cover Number
- 20 Tight Estimations
- 21 Conclusions
