Title: Computing on Encrypted Data; Extremely Fast and Simple Abstract:  Consider the following setting for computing on private data. A client uploads an encryption of a big input X to an untrusted server, and then wishes to make an unbounded number of queries f(X) while hiding f and X from the server and using only its secret […]

Title: Robustly Guarding Polygons Abstract: A fundamental set cover problem that arises in geometric domains is the classic Art Gallery Problem: given a geometric domain (e.g., a polygon), place a set of points within the domain, such that every point in it is seen by at least one of the guards. This problem has many variants […]

Title: From Learning Theory to Cryptography: Provable Guarantees for AI Abstract: Ensuring that AI systems behave as intended is a central challenge in contemporary AI. This talk offers an exposition of provable mathematical guarantees for learning and security in AI systems. Starting with a classic learning-theoretic perspective on generalization guarantees, we present two results quantifying […]