BEGIN:VCALENDAR
VERSION:2.0
PRODID:icalendar-ruby
CALSCALE:GREGORIAN
METHOD:PUBLISH
BEGIN:VTIMEZONE
TZID:Europe/Vienna
BEGIN:DAYLIGHT
DTSTART:20200329T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=3
TZNAME:CEST
END:DAYLIGHT
BEGIN:STANDARD
DTSTART:20191027T020000
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
RRULE:FREQ=YEARLY;BYDAY=-1SU;BYMONTH=10
TZNAME:CET
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20260406T075627Z
UID:5e060da8aa16d170237444@ist.ac.at
DTSTART:20200116T100000
DTEND:20200116T110000
DESCRIPTION:Speaker: Giulio Malavolta\nhosted by Krzysztof Pietrzak\nAbstra
 ct: The communication complexity of secure protocols is a fundamental ques
 tion of the theory of computation and has important repercussions in the d
 evelopment of real-life systems. As an example\, the recent surge in popul
 arity of cryptocurrencies has been enabled and accompanied by advancements
  in the construction of more compact cryptographic machinery.In this talk 
 we discuss how to meet the boundaries of compactness in cryptography and h
 ow to exploit succinct communication to construct systems with new surpris
 ing properties. Specifically\, we consider the problem of computing functi
 ons on encrypted data: We show how to construct (i) homomorphic encryption
  schemes with optimal ciphertext expansion and (ii) time-lock puzzles wher
 e multiple puzzles can be compressed into a single one\, containing only t
 he function output. Then we survey the applications of these results along
  with the implication of cryptographic compactness in different contexts\,
  such as proof systems and scalable blockchains.
LOCATION:Mondi Seminar Room 2\, Central Building\, ISTA
ORGANIZER:tguggenb@ist.ac.at
SUMMARY:Giulio Malavolta: Compactness in Cryptography
URL:https://talks-calendar.ista.ac.at/events/2474
END:VEVENT
END:VCALENDAR