BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Discrete Mathematics Group - ECPv6.15.20//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-WR-CALNAME:Discrete Mathematics Group
X-ORIGINAL-URL:https://dimag.ibs.re.kr
X-WR-CALDESC:Events for Discrete Mathematics Group
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:20190101T000000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=Asia/Seoul:20200609T163000
DTEND;TZID=Asia/Seoul:20200609T173000
DTSTAMP:20260420T045535
CREATED:20200529T052601Z
LAST-MODIFIED:20240705T200042Z
UID:2498-1591720200-1591723800@dimag.ibs.re.kr
SUMMARY:Jiseung Kim (김지승)\, Hardness and concrete security in cryptography
DESCRIPTION:Computationally hard problems have been widely used to construct cryptographic primitives such as encryptions\, digital signatures. For example\, provably secure primitives are based on a reduction from the hardness problems. However\, the concrete instantiation of primitives does not follow the results of hardness problems due to its efficiency. In this talk\, we introduce cryptographic hardness problems widely used in cryptography and the gap between hardness results and concrete security of cryptographic primitives based on our recent works.
URL:https://dimag.ibs.re.kr/event/2020-06-09/
LOCATION:Room B232\, IBS (기초과학연구원)
CATEGORIES:Discrete Math Seminar
END:VEVENT
END:VCALENDAR