BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20260329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20251026T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260414T234459Z
UID:69941a4daa95e421953637@ist.ac.at
DTSTART:20260323T110000
DTEND:20260323T120000
DESCRIPTION:Speaker: Aaradhya Pandey\nhosted by Marco Mondelli\nAbstract: I
 n this talk\, I introduce a hypothesis-testing-based formulation of differ
 ential privacy in classical computation. The Gaussian Differential Privacy
  framework of Dong--Roth--Su (2022) established a central limit theorem fo
 r the composition of multiple private mechanisms. Building on this work\, 
 I present a Poisson extension of their result and show that both the Gauss
 ian and Poisson limits are unified under a broader framework of infinitely
  divisible privacy. This perspective reveals structural connections betwee
 n differential privacy\, probability theory\, statistics\, and discrete ma
 thematics. I conclude by discussing computational differential privacy and
  its connections to cryptographic constructions such as pseudorandom gener
 ators\, as well as a step toward quantizing privacy in quantum computation
 \, outlining a framework for both computational and quantum differential p
 rivacy.
LOCATION:Office Bldg West / Ground floor / Heinzel Seminar Room (I21.EG.101
 )\, ISTA
ORGANIZER:jdeanton@ist.ac.at
SUMMARY:Aaradhya Pandey: Information\, Computation\, &amp\; Quantization: I
 nfinitely divisible privacy and beyond
URL:https://talks-calendar.ista.ac.at/events/6299
END:VEVENT
END:VCALENDAR