BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Penn Engineering Events - ECPv6.15.18//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Penn Engineering Events
X-ORIGINAL-URL:https://seasevents.nmsdev7.com
X-WR-CALDESC:Events for Penn Engineering Events
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20220313T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20221106T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20230312T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20231105T060000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
TZNAME:EDT
DTSTART:20240310T070000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
TZNAME:EST
DTSTART:20241103T060000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/New_York:20230221T153000
DTEND;TZID=America/New_York:20230221T163000
DTSTAMP:20260404T200127
CREATED:20230206T192128Z
LAST-MODIFIED:20230206T192128Z
UID:8418-1676993400-1676997000@seasevents.nmsdev7.com
SUMMARY:CIS Seminar: "Secure Computation with Minimal Interaction"
DESCRIPTION:In the current digital and decentralized world\, there is an imminent need for technologies that can provide a fast approach to compute on private data while guaranteeing secrecy. Secure Multiparty Computation (MPC) is one such cryptographic technology that provides an efficient approach to compute on private data. At a high level\, MPC is a distributed computation protocol that allows a set of mutually distrusting parties to compute a joint function on their private inputs while only leaking the output and hiding everything else. \nAny distributed computation protocol typically involves multiple rounds of back-and-forth interaction between the parties. A key question that is of both theoretical and practical importance is to minimize the number of rounds of such interaction to its absolute limit. This is the problem of constructing round-optimal MPC protocols. \nIn this talk\, I will describe new techniques to construct such round-optimal protocols. These techniques have been instrumental in resolving several long-standing open problems in the area and have also opened up the possibility of constructing practically efficient round-optimal protocols.
URL:https://seasevents.nmsdev7.com/event/cis-seminar-secure-computation-with-minimal-interaction/
LOCATION:Wu and Chen Auditorium (Room 101)\, Levine Hall\, 3330 Walnut Street\, Philadelphia\, PA\, 19104\, United States
ORGANIZER;CN="Computer and Information Science":MAILTO:cherylh@cis.upenn.edu
END:VEVENT
END:VCALENDAR