Title: Storage Constrained Private Information Retrieval – Interplay Between Privacy, Storage and Caching

Description: Speaker: Prof. Ravi Tandon

Time: Monday, 14 January 2019, 4:00pm
Venue: Dept. of Computer Science and Engineering, Room no. 109, 01st Floor, New CSE/CC Building

Private Information Retrieval (PIR) is a fundamental security primitive, in which a user is interested in retrieving information privately from untrustworthy databases. Over the past few years, significant progress has been made in our understanding of fundamental limits of information-theoretic PIR, starting from the recent work of Sun and Jafar. Henceforth, several variations of the basic PIR problem have been studied, such as when databases (DBs) can collude, when DBs store coded data, when DBs are Byzantine or faulty, cache-aided PIR, symmetric PIR, and so on. In this talk, I will present recent results on two variations of the PIR problem: a) in the first variation, the user may have side information available (for instance through prior requests or other mechanisms), which we call as the cache-aided PIR problem. We will present recent results for cache-aided PIR, and discuss several variations that can arise depending on the amount and quality of knowledge about the side-information available at various parties; b) in the second variation, we will present our recent work on storage constrained PIR, where the DBs have limited storage. In this setting, there are two design problems: how to store data at the DBs, and then how to design communication efficient PIR schemes. We will show how to leverage recent work on "coded caching" to this problem, and show that there is an interesting tradeoff between storage, and communication efficiency of PIR. We will also briefly discuss the new tools that are necessary to devise information-theoretic converse proofs, which allow us to prove optimality of the schemes under certain conditions. Open problems will also be discussed.

Speaker Profile:
Ravi Tandon is an Assistant Professor in the Department of ECE at the University of Arizona. Prior to joining the University of Arizona in Fall 2015, he was a Research Assistant Professor at Virginia Tech with positions in the Bradley Department of ECE, Hume Center for National Security and Technology and at the Discovery Analytics Center in the Department of Computer Science. He received the B.Tech. degree in Electrical Engineering from the Indian Institute of Technology, Kanpur (IIT Kanpur) in 2004 and the Ph.D. degree in Electrical and Computer Engineering from the University of Maryland, College Park (UMCP) in 2010. From 2010 to 2012, he was a post-doctoral research associate at Princeton University. He is a recipient of NSF CAREER Award in 2017, the 2018 Keysight Early Career Professor Award, and a Best Paper Award at IEEE GLOBECOM 2011. He currently serves as an Editor for IEEE Transactions on Wireless Communications, and is a senior member of IEEE. His current research interests include information theory and its applications to wireless networks, communications, security, privacy, and machine learning.

University of Arizona

Prof. Ashutosh Gupta

Date: Monday, 14 January, 2019
Time: 4:00pm IST
Access: Public
Category: Talk*
Created by: Department Calendar
Updated: Tuesday, 17 December, 2019 5:51pm IST
Send Reminder: Yes  -  285 hours 59 minutes before start
Participants: Department Calendar
<office@cse.iitb.ac.in> (External User)
_NUC_department <all@cse.iitb.ac.in> (External User)