Randomness Expansion (Math)

This group will meet Tuesday and Thursday, 3-4pm (Room 202) to discuss the mathematics underlying a proof that random numbers can be generated from untrusted devices. (This is a supplement to the Friday 2:10pm talk, which will be an overview of the same topic.)

Topic
Yaoyun Shi and I proved in 2014 that random numbers can be obtained from noisy untrusted devices. The proof (recently simplified, arXiv:1411.6608) ultimately rests on some elegant properties of the Schatten matrix norms. During these meetings I will give a "math talk" about our work, and try to take advantage of the extra time to really build the proof from its foundations. The techniques we used invite generalizations to other cryptographic protocols (indeed, to any protocol that involves the creation of a secret in the presence of an adversary).

Coordinator
Carl Miller, University of Michigan.