BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Date iCal//NONSGML kigkonsult.se iCalcreator 2.20.2//
METHOD:PUBLISH
X-WR-CALNAME;VALUE=TEXT:Eventi DIAG
BEGIN:VTIMEZONE
TZID:Europe/Paris
BEGIN:STANDARD
DTSTART:20181028T030000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
END:STANDARD
BEGIN:DAYLIGHT
DTSTART:20180325T020000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RDATE:20190331T020000
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
BEGIN:VEVENT
UID:calendar.13520.field_data.0@www.u-gov-ricerca.uniroma1.it
DTSTAMP:20260407T200601Z
CREATED:20180919T063455Z
DESCRIPTION:We study Symmetric Searchable Encryption (SSE) in a multi-user 
 setting in which each user dynamically shares its documents with selected 
 other users\, allowing shares also to perform searches. We introduce the c
 oncept of an SSE with Sharing and Unsharing\, an extension of Multi-Key Se
 archable Encryption [NSDI '14]\, that supports dynamic sharing and unshari
 ng of documents amongst users. We also strengthen the security notion by c
 onsidering a simulation-based notion that does not restrict sharing betwee
 n honest and compromised users.We present the notion of cross-user leakage
 \, the information leaked about a user's documents and/or queries from the
  queries of other users\, and introduce a novel technique to quantify cros
 s-user leakage. Specifically\, we model cross-user leakage by using a grap
 h where nodes correspond to users and the presence of edges between two no
 des indicates the existence of cross-user leakage between the two adjacent
  users. The statistics on the connected components of the cross-user leaka
 ge graph provide a quantifiable way to compare the leakage of multi-user s
 chemes which has eluded previous works.The main technical contribution is 
  an efficient scheme with small cross-user leakage\, whose security is bas
 ed on the decisional Diffie-Hellman assumption. We prove a tight bound on 
 the leakage of our construction in the presence of an honest-but-curious a
 dversary that colludes with a non-adaptively chosen subset of users. We re
 port on experiments showing that our proposal is efficient and that cross-
 user leakage grows slowly as queries are performed.Joint work with S. Pate
 l and K. Yeo (Google Inc.) 
DTSTART;TZID=Europe/Paris:20180921T153000
DTEND;TZID=Europe/Paris:20180921T153000
LAST-MODIFIED:20191008T082735Z
LOCATION:Aula Magna\, DIAG
SUMMARY:Symmetric Searchable Encryption with Sharing and Unsharing - Giusep
 pe Persiano (Università di Salerno)
URL;TYPE=URI:http://www.u-gov-ricerca.uniroma1.it/node/13520
END:VEVENT
END:VCALENDAR