BEGIN:VCALENDAR
VERSION:2.0
PRODID:IEEE vTools.Events//EN
CALSCALE:GREGORIAN
BEGIN:VTIMEZONE
TZID:America/Chicago
BEGIN:DAYLIGHT
DTSTART:20200308T030000
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:CDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20201101T010000
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:CST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200918T210338Z
UID:26751B55-5641-432F-9D97-6863B5ACB95F
DTSTART;TZID=America/Chicago:20200918T110000
DTEND;TZID=America/Chicago:20200918T120000
DESCRIPTION:Abstract: Caching is known to significantly reduce the communic
 ation load over bottleneck links by jointly designing the cache content of
  the users and the signal transmitted by the server so as to guarantee mul
 ticasting opportunities regardless of the requested content. In this talk 
 we focus on two practically motivated constraints: (i) the content of the 
 library must be kept secure from a wiretapper who obtains the signal sent 
 by the server\, and (ii) any subset of users together cannot obtain any in
 formation about the demands of the remaining users. We first revisit coded
  caching without privacy or security constraints [arxiv:1209.5807]. We the
 n discuss how the linear function retrieval framework [arXiv:2001.03577] c
 an be used as a building block in demand-private schemes as a means to pro
 tect the delivered content with locally cached privacy keys [arXiv:2008.03
 642]. Finally\, we introduce the notion of key superposition\, of privacy 
 and security keys\, to also guarantee content security [arXiv:2009.06000].
  Remarkably\, we show that the tradeoff between memory and communication l
 oad does not increase compared to the best-known schemes that only guarant
 ee content security [arXiv: 1312.3961] or demand privacy [arXiv: 1908.1082
 1].\n\nSpeaker(s): Daniela Tuninetti\, \n\nVirtual: https://events.vtools.
 ieee.org/m/239972
LOCATION:Virtual: https://events.vtools.ieee.org/m/239972
ORGANIZER:danielat@uic.edu
SEQUENCE:5
SUMMARY:IEEE Information Theory Chicago Chapter - DL Talk - Demand-private 
 and Content-secure Caching Networks
URL;VALUE=URI:https://events.vtools.ieee.org/m/239972
X-ALT-DESC:Description: <br /><p><strong>Abstract</strong>: Caching is know
 n to significantly reduce the communication load over bottleneck links by 
 jointly designing the cache content of the users and the signal transmitte
 d by the server so as to guarantee multicasting opportunities regardless o
 f the requested content. In this talk we focus on two practically motivate
 d constraints: (i) the content of the library must be kept secure from a w
 iretapper who obtains the signal sent by the server\, and (ii) any subset 
 of users together cannot obtain any information about the demands of the r
 emaining users. We first revisit <em>coded caching</em> without privacy or
  security constraints [arxiv:1209.5807]. We then discuss how the <em>linea
 r function retrieval</em> framework [arXiv:2001.03577] can be used as a bu
 ilding block in demand-private schemes as a means to protect the delivered
  content with locally cached privacy keys [arXiv:2008.03642]. Finally\, we
  introduce the notion of <em>key superposition</em>\, of privacy and secur
 ity keys\, to also guarantee content security [arXiv:2009.06000]. Remarkab
 ly\, we show that the tradeoff between memory and communication load does 
 not increase compared to the best-known schemes that only guarantee conten
 t security [arXiv: 1312.3961] or demand privacy [arXiv: 1908.10821].</p>\n
 <p>&nbsp\;</p>
END:VEVENT
END:VCALENDAR