Coursera Flash Sale
40% Off Coursera Plus for 3 Months!
Grab it
Explore a Computer Science/Discrete Mathematics Seminar presentation on "Improved Private Information Retrieval Schemes from Matching Vectors and Derivatives" delivered by Swastik Kopparty from the University of Toronto. Delve into the evolution of Private Information Retrieval (PIR) methods, which allow users to access database entries without revealing which information they're retrieving. Learn about significant breakthroughs in the field and discover a new, simplified PIR scheme for t=2 servers that offers superpolynomial improvements over previous approaches. The presentation covers how this scheme achieves 3-server PIR communication of exp((log n)^(1/3)), a substantial improvement over Efremenko's previous exp((log n)^(1/2)) approach. This 79-minute seminar, presented at the Institute for Advanced Study, represents joint work with Fatemeh Ghasemi and Madhu Sudan.
