BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Halıcıoğlu Data Science Institute - UC San Diego - ECPv6.16.3//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Halıcıoğlu Data Science Institute - UC San Diego
X-ORIGINAL-URL:https://datascience.ucsd.edu
X-WR-CALDESC:Events for Halıcıoğlu Data Science Institute - UC San Diego
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:20220313T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20221106T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20230312T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20231105T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20240310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20241103T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20230307T140000
DTEND;TZID=America/Los_Angeles:20230307T140000
DTSTAMP:20260608T134308
CREATED:20230302T000627Z
LAST-MODIFIED:20230306T234948Z
UID:10000348-1678197600-1678197600@datascience.ucsd.edu
SUMMARY:Cryptographic Advances in Reasoning about Adversaries
DESCRIPTION:A key challenge in cryptography is to ensure that a protocol resists all computationally feasible attacks\, even when an adversary decides to follow a completely arbitrary and unpredictable strategy. This often turns out to be notoriously difficult — for example\, proofs of security must typically extract an adversary’s implicit input\, but this is at odds with other goals like privacy\, which require that inputs be hidden and difficult to extract. In this talk\, I will describe my work that reimagines how we reason about adversaries\, thereby making progress on foundational questions in classical and quantum protocol design. On the classical front\, these insights have helped understand the mathematical assumptions required to immunize protocols against coordinated attacks on the internet\, and verify computations while preserving privacy. On the quantum front\, these methods help exploit the “destructive” nature of measurements and open up fundamentally new possibilities for cryptography. I will discuss examples that leverage quantum information to (1) weaken the assumptions needed for core tasks like secure computation on distributed data\, and (2) allow outsourcing computations on sensitive data while also verifying that data was deleted after processing.
URL:https://datascience.ucsd.edu/event/dakshita-khurana/
LOCATION:SDSC\, The Synthesis Center\, 9500 Gilman Drive\, La Jolla\, CA\, 92093\, United States
CATEGORIES:Seminar
END:VEVENT
END:VCALENDAR