Teooriapäevad Tõrvel / Theory Days at Tõrve: Ajakava / Programme

Reede, 7. oktoober 2011 / Friday, 7 October 2011

 saabumine / arrival
14.30-15.30lõunasöök / lunch
15.30-17.15 Andris Ambainis Random non-local games
Abuzer Yakaryilmaz NP has log-space verifiers with fixed-size public quantum registers
Bingsheng Zhang AIDA/Cube cryptanalysis on KATAN family of block ciphers
17.15-17.45paus / break
17.45-19.30 Jens Groth Probabilistically checkable proofs, hidden random bits and non-interactive zero-knowledge proofs
Helger LipmaaA more efficient computationally sound non-interactive zero-knowledge shuffle argument
19.30-20.30õhtusöök / dinner
20.30-saun & diskussioon / sauna & discussion

Laupäev, 8. oktoober 2011 / Saturday, 8 October 2011

08.00-09.00hommikusöök / breakfast
09.00-10.45 Thorsten Altenkirch To infinity and beyond: from setoids to weak ω-groupoids
Tarmo Uustalu Type-theoretic structured general corecursion
10.45-11.15paus / break
11.15-13.00 Madeline González Chameleon hashes in the forward secure setting
Alisa Pankova Bilinear mappings in formal cryptography
Jan Willemson On optimal threshold defender structures of resharing-based oblivious shuffle protocols for secret-shared secure multi-party computations
13.00-14.00lõunasöök / lunch
14.00-16.00aktiivne ajaviide / activities
16.00-17.15 Dmitry Itsykson Hard examples for DPLL algorithms
Alexander Kulikov An elementary proof of a 3n-o(n) lower bound on the circuit complexity of affine dispersers
17.15-17.45paus / break
17.45-19.30 Martin Pettai Secure information flow analysis for a distributed OO language
Peeter Laud Implementing a distributed language with futures in open environments
Michele Mazzucco Achieving performance and availability quarantees with Amazon spot instances
19.30-20.30õhtusöök / dinner
20.30-saun & diskussioon / sauna & discussion

Pühapäev, 9. oktoober 2011 / Sunday, 9 October 2011

08.00-09.00hommikusöök / breakfast
09.00-10.45 Härmel Nestra Compositional transfinite semantics
Hellis Tamm Introduction to the theory of átomata
Silvio Capobianco Forty-nine years of the Garden-of-Eden theorem
10.45-11.15paus / break
11.15-13.00 Jesper Buus Nielsen A new approach to practical active-Secure two-party computation
Dominique Unruh Computationally sound verification of source code
13.00lõunasöök / lunch
14.00 ärasõit / departure
Liina Kamm
Peeter Laud
Helger Lipmaa
Tarmo Uustalu
Varmo Vene
Viimane uuendus 6.10.2011