BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Information Systems Group - ECPv6.4.0.1//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://isg.ics.uci.edu
X-WR-CALDESC:Events for Information Systems Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230217T130000
DTEND;TZID=America/Los_Angeles:20230217T140000
DTSTAMP:20260422T084829
CREATED:20230217T190636Z
LAST-MODIFIED:20230217T190657Z
UID:1529-1676638800-1676642400@isg.ics.uci.edu
SUMMARY:Shanshan Han: Veil: Storage and Communication Efficient Volume Hiding Algorithms
DESCRIPTION:February 17\, 2023\, Friday\, 1:00 PM – 2 PM\nDonald Bren Hall 4011\, ICS\, UC Irvine\n\n\n\nZoom: https://uci.zoom.us/j/92445274511 (UCI only)\n\n\nAbstract \n\n\nVolume leakage is a major threat to searchable encryption and data outsourcing\, where an adversary can obtain the number of values in response to a query and deduce additional information about the data\, such as the query key. This work deals with the problem of volume leakage in the context of key-value datasets\, and develops solutions\, entitled Veil\, that partition the dataset into buckets and achieve a tradeoff between the storage and communication overheads. We design bucketing approaches that consider two types adversaries\, weak adversaries (i.e.\, passive adversaries) that passively observes the query processing\, and strong adversaries (i.e.\, active adversaries) that knows some keys in the dataset can actively query the encrypted database to gain information about other keys in the dataset. We then propose two strategies to add fake values to buckets\, including a straightforward disjoint strategy\, and an advanced overlapping strategy that further reduces the storage overhead.\n\n\n \n \nBio\n\nShanshan Han is a 4th year PhD student in Prof. Sharad Mehrotra’s group. Her research interests include data security and privacy.
URL:https://isg.ics.uci.edu/event/shanshan-han-veil-storage-and-communication-efficient-volume-hiding-algorithms/
LOCATION:DBH 4011
END:VEVENT
END:VCALENDAR