Certifying Randomness or its Lack Thereof for General Network Scenarios
The episode discusses a paper titled "Certifying Randomness or its Lack Thereof for General Network Scenarios." The hosts explore how this research extends randomness certification from simple two-party setups to complex networks, specifically Directed Acyclic Graphs (DAGs). They detail the use of an inflation technique to certify intrinsic randomness against powerful adversaries and discuss methods for proving its absence.