BEGIN:VCALENDAR
PRODID:-//eluceo/ical//2.0/EN
VERSION:2.0
CALSCALE:GREGORIAN
BEGIN:VEVENT
UID:www.tcs.tifr.res.in/event/1075
DTSTAMP:20230914T125949Z
SUMMARY:Coordination Over Networks: Shared Randomness\, Security\, and Inte
 raction
DESCRIPTION:Speaker: Gowtham Kuri (TIFR)\n\nAbstract: \nAbstract-In a coord
 ination problem\, users in a network observing correlated inputs collabora
 te to evaluate possibly randomized functions of the inputs. Problems of th
 is kind have been widely studied in the information theory literature. It 
 finds applications in several diverse areas such as in parallel processing
 \, cooperative game theory\, distributed control\, function computation in
  networks. The focus of many of the works in the literature has been on th
 e amount of communication needed to achieve coordination. In practice\, se
 veral other aspects are also of interest such as the amount and form of sh
 ared/correlated randomness available\, topology of the network used\, and 
 security.  \nIn this talk\, we present a systematic study of various suc
 h aspects\, namely\, shared randomness\, security\, and interaction in add
 ition to the amount of communication needed. To this end\, the first probl
 em we study is a distributed sampling problem where a set of processors wa
 nt to output correlated sequences of random variables with the help of a c
 oordinator which has access to several independent sources of randomness a
 nd each processor has access to a subset of these sources. We characterize
  optimal communication and/or shared randomness rates in various cases of 
 this setting.\nIn the second problem\, we study interactive secure functio
 n computation. The privacy requirement is that the communication should no
 t reveal to either user any extra information about the other user’s inp
 ut and output other than what can be inferred from the user’s own input 
 and output. We give single-letter expressions for the asymptotic rate regi
 ons. Further\, we analyse the role of common randomness and interaction. I
 n secure function computation\, in some settings\, it might be reasonable 
 to give away a certain amount of information about the inputs but not abou
 t some specific functions of the inputs which the users want to keep priva
 te. We study such settings also.\n
URL:https://www.tcs.tifr.res.in/web/events/1075
DTSTART;TZID=Asia/Kolkata:20200810T103000
DTEND;TZID=Asia/Kolkata:20200810T113000
LOCATION:Join Zoom Meeting https://zoom.us/j/98083276706?pwd=cm85dHNQU0tSKz
 c1SndzYlZKL3ZxZz09  Meeting ID: 980 8327 6706 Passcode: 468237
END:VEVENT
END:VCALENDAR