BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:America/New_York
BEGIN:DAYLIGHT
DTSTART:20220313T030000
TZOFFSETFROM:-0500
TZOFFSETTO:-0400
RRULE:FREQ=YEARLY;BYDAY=2SU;BYMONTH=3
TZNAME:EDT
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20221106T010000
TZOFFSETFROM:-0400
TZOFFSETTO:-0500
RRULE:FREQ=YEARLY;BYDAY=1SU;BYMONTH=11
TZNAME:EST
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20240918T102307Z
UID:8c74ce2d-4128-4d33-817f-4aef3b2756e0
DTSTART;TZID=America/New_York:20220930T103000
DTEND;TZID=America/New_York:20220930T120000
CREATED:20220922T143640
DESCRIPTION:In the classical model of computation\, it is well established
that one-way functions (OWF) are essential for almost every computational
cryptographic application. In the quantum setting\, however\, OWFs appear
not to be essential (Kretschmer 2021\; Ananth et al.\, Morimae and Yamakaw
a 2022)\, and the question of whether a minimal primitive exists remains o
pen.\n\nWe consider EFI pairs - efficiently samplable\, statistically far
but computationally indistinguishable pairs of distributions. Building on
the work of Yan (2022) which shows equivalence between EFI pairs and stati
stical commitment schemes\, we show that EFI pairs are necessary and suffi
cient for a large class of quantum-cryptographic applications. Specificall
y\, while it was known how to construct commitments schemes\, oblivious tr
ansfer\, and general secure multiparty computation from any EFI\, we show
how to construct EFI pairs from minimalistic versions of each one of these
primitives. We also construct from EFI quantum computational zero knowled
ge (QCZK) proofs for all of QIP\, and construct EFI pairs from essentially
any non-trivial QCZK.\n\nThis suggests that\, for much of quantum cryptog
raphy\, EFI pairs play a similar role to that played by OWFs in the classi
cal setting: they are simple to describe\, essential\, and also serve as a
linchpin for demonstrating equivalence between primitives.\n
LAST-MODIFIED:20220922T143640
SUMMARY:On the computational hardness needed for quantum cryptography
URL:https://calendar.csail.mit.edu/events/252575
END:VEVENT
END:VCALENDAR