Return to Colloquia & Seminar listing
Oblivious card shuffling
Faculty Research Seminar| Speaker: | Ben Morris, UC Davis |
| Location: | 2112 MSB |
| Start time: | Tue, Apr 16 2024, 12:10PM |
Suppose that the seating assignment for a wedding is a random permutation. You're the wedding planner. You want to broadcast instructions to the guests so that 1) if each guest follows the instructions, they find their seat. 2) you minimize the guests' computational cost. I will discuss how this problem relates to cryptography and describe a solution that involves card shuffling. Then I will describe the main open problem in the area.