Siebel School Speakers Calendar
Thursday, April 2, 2026
Friday, April 3, 2026
-
2:30 - 3:30 pmSiebel Center Room 0220Abstract: Boolean circuits are perhaps our simplest complete model of computation. A circuit is a combinatorial object composed of simple, fan-in two gates whose interconnections (wires) are fixed in advance. This structural simplicity makes circuits convenient in many settings; in this talk, I will discuss how it enables powerful cryptographic constructions.
Thursday, April 9, 2026
-
11:00 am - 12:15 pm4045 School of Information Sciences
