BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Ashoka University - ECPv6.17.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Ashoka University
X-ORIGINAL-URL:https://www.ashoka.edu.in
X-WR-CALDESC:Events for Ashoka University
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Kolkata
BEGIN:STANDARD
TZOFFSETFROM:+0530
TZOFFSETTO:+0530
TZNAME:IST
DTSTART:20240101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Kolkata:20250113T123000
DTEND;TZID=Asia/Kolkata:20250113T133000
DTSTAMP:20250113T003913Z
CREATED:20250113T003913Z
LAST-MODIFIED:20250113T003913Z
UID:71563-1736771400-1736775000@www.ashoka.edu.in
SUMMARY:CS Colloquium
DESCRIPTION:Abstract: Classical cryptography is built on assuming the existence of "hard" problems. The weakest such assumption\, necessary for the existence of any meaningful classical cryptography\, is the existence of one-way functions\, which are functions which can be efficiently computed but are hard to invert in the average case. In a quantum world\, however\, the picture is quite different. Recent works have opened up the possibility of building powerful quantum cryptographic primitives from assumptions even weaker than the existence of one-way functions. In fact\, there is evidence that these primitives could exist even if P=NP (in which case all classical cryptography would be insecure)! This talk will give a brief introduction to this setting as well as cover the speaker's recent results on building such quantum cryptographic primitives from the (extremely mild) worst case assumption that #P-hard problems are infeasible for efficient quantum adversaries.
URL:https://www.ashoka.edu.in/event/cs-colloquium/
END:VEVENT
END:VCALENDAR