Single-Server Private Information Retrieval with Sublinear Amortized Time

Channel:

Subscribers:

68,700

Published on June 17, 2022 12:20:05 PM ● Video Link: https://www.youtube.com/watch?v=dmUgkoKZT2I

Category:

Guide

Duration: 43:00

728 views

Other Videos By Simons Institute for the Theory of Computing

2022-06-29	Explanation: A(N Abridged) Survey
2022-06-29	Conceptual Challenges In Connecting Interpretability And Causality
2022-06-29	Panel on Societal Dimensions of Explanation
2022-06-29	Accuracy and Interpretability Through the Lens of Human-AI Teaming
2022-06-28	Goals And Interpretable Variables In Neuroscience
2022-06-18	Continuous LWE is as Hard as LWE
2022-06-18	Batch Arguments for NP and SNARGs for P from LWE
2022-06-18	Lattice-based Zero-knowledge Proofs
2022-06-18	Candidate Witness Encryption from Lattice Techniques
2022-06-17	Optimal Broadcast Encryption and More from Evasive LWE
2022-06-17	Single-Server Private Information Retrieval with Sublinear Amortized Time
2022-06-17	Doubly Efficient Private Information Retrieval
2022-06-17	Some Recent Results Showing that Lattice Problems Are (sort of) Equivalent in All Norms
2022-06-17	Bourgain’s Slicing Problem and KLS Isoperimetry up to Polylog
2022-06-16	Hardness of the Shortest Vector Problem: A Simplified Proof and a Survey
2022-06-16	Quantum Rewinding Tutorial, Part 3: Zero Knowledge Simulation Beyond Watrous
2022-06-16	Quantum Rewinding Tutorial, Part 2: How to Run a Quantum Attacker Many Times
2022-06-15	Quantum Rewinding Tutorial, Part 1: Motivation and Early Rewinding Techniques
2022-06-15	Quantum Benchmarking
2022-06-15	New Quantum Cryptographic Primitives II
2022-06-15	New Quantum Cryptographic Primitives I

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Quantum and Lattices Joint Reunion Workshop

Alexandra Henzinger