BEGIN:VCALENDAR
PRODID:-//planitpurple.northwestern.edu//iCalendar Event//EN
VERSION:2.0
CALSCALE:GREGORIAN
METHOD:PUBLISH
CLASS:PUBLIC
BEGIN:VTIMEZONE
TZID:America/Chicago
TZURL:http://tzurl.org/zoneinfo-outlook/America/Chicago
X-LIC-LOCATION:America/Chicago
BEGIN:DAYLIGHT
TZOFFSETFROM:-0600
TZOFFSETTO:-0500
TZNAME:CDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0500
TZOFFSETTO:-0600
TZNAME:CST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
SEQUENCE:0
DTSTART;TZID=America/Chicago:20260505T130000
DTEND;TZID=America/Chicago:20260505T143000
DTSTAMP:20260426T084941Z
SUMMARY:Radhika Garg PhD Prospectus May 5: Efficient and Scalable Secure Computation: With Real World Applications
UID:641846@northwestern.edu
TZID:America/Chicago
DESCRIPTION:Secure multi-party computation (MPC) enables multiple parties to jointly evaluate a function on their private inputs without revealing any information beyond the output. It is a foundational tool for privacy-preserving applications\, including federated analytics\, private machine learning\, distributed credential issuance\, and differentially private data release. Despite decades of progress\, a persistent gap remains between the theoretical efficiency of MPC protocols and the performance and usability demands of real-world deployments.   My work is motivated by a core goal: to build secure computation frameworks that are \emph{provably efficient} while remaining \emph{practical for real-world developers}. I work across three areas: (1) generic MPC protocol design\, (2) compiler frameworks for MPC\, and (3) application-driven cryptographic systems\, including differential privacy and thresholdizing standardized post-quantum signature schemes. I propose to build an efficient threshold version of the NIST-standardized FALCON signature scheme along two complementary directions: FALCON-specific algorithmic improvements\, including a fixed-point analysis of the fast Fourier orthogonalization sampler to reduce the asymptotic signing complexity\, and improved MPC primitives\, including more efficient correlation generators applicable to both FALCON and ML-DSA. \n\nWebcast Link: https://northwestern.zoom.us/j/2420017862?omn=91532718222
LOCATION:Online
TRANSP:OPAQUE
URL:https://planitpurple.northwestern.edu/event/641846
CREATED:20260420T050000Z
STATUS:CONFIRMED
LAST-MODIFIED:20260420T050000Z
PRIORITY:0
BEGIN:VALARM
TRIGGER:-PT10M
ACTION:DISPLAY
DESCRIPTION:Reminder
END:VALARM
END:VEVENT
END:VCALENDAR