BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//CECS - ECPv6.18.4//NONSGML v1.0//EN
CALSCALE:GREGORIAN
METHOD:PUBLISH
X-ORIGINAL-URL:https://www.cecs.uci.edu
X-WR-CALDESC:Events for CECS
REFRESH-INTERVAL;VALUE=DURATION:PT1H
X-Robots-Tag:noindex
X-PUBLISHED-TTL:PT1H
BEGIN:VTIMEZONE
TZID:America/Los_Angeles
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20180311T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20181104T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20190310T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20191103T090000
END:STANDARD
BEGIN:DAYLIGHT
TZOFFSETFROM:-0800
TZOFFSETTO:-0700
TZNAME:PDT
DTSTART:20200308T100000
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0700
TZOFFSETTO:-0800
TZNAME:PST
DTSTART:20201101T090000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTART;TZID=America/Los_Angeles:20190307T150000
DTEND;TZID=America/Los_Angeles:20190307T160000
DTSTAMP:20231011T190843Z
CREATED:20231011T190828Z
LAST-MODIFIED:20231011T190843Z
UID:14549-1551970800-1551974400@www.cecs.uci.edu
SUMMARY:"Poly-Logarithmic Side Channel Rank Estimation via Exponential Sampling"
DESCRIPTION:Name: Liron David\nDate and Time: Tuesday\, March 12 at 10:00 a.m. \nLocation: Engineering Hall 5204 \nAbstract: \nRank estimation is an important tool for a side-channel evaluations laboratories. It allows estimating the remaining security after an attack has been performed\, quantified as the time complexity and the memory consumption required to brute force the key given the leakages as probability distributions over d subkeys (usually key bytes). These estimations are particularly useful where the key is not reachable with exhaustive search. \nWe propose ESrank\, the first rank estimation algorithm that enjoys provable poly-logarithmic time- and space-complexity\, which also achieves excellent practical performance. Our main idea is to use exponential sampling to drastically reduce the algorithm’s complexity. Importantly\, ESrank is simple to build from scratch\, and requires no algorithmic tools beyond a sorting function. After rigorously bounding the accuracy\, time and space complexities\, we evaluated the performance of ESrank on a real SCA data corpus\, and compared it to the currently-best histogram-based algorithm. We show that ESrank gives excellent rank estimation (with roughly a 1-bit margin between lower and upper bounds)\, with a performance that is on-par with the Histogram algorithm: a run-time of under 1 second on a standard laptop using 6.5 MB RAM. \nBiography: \nLiron David is a Ph.D. candidate in Electrical Engineering at Tel-Aviv University under the supervision of Prof. Avishai Wool. She received her B.Sc. degree in Computer Science and Electrical and Electronics Engineering from Tel-Aviv University and her M.Sc. degree in Electrical Engineering from Tel-Aviv University. Liron has won the Weinstein award for excellence in studies in 2017 \,the Weinstein best paper prize in 2018 and the Tel-Aviv University excellence in teaching in 2018.
URL:https://www.cecs.uci.edu/event/poly-logarithmic-side-channel-rank-estimation-via-exponential-sampling/
LOCATION:CA
CATEGORIES:Seminars at CECS
END:VEVENT
END:VCALENDAR