RISC Seminars (Research on Information Security and Cryptology)

     Archives: [2024] [2023] [2022] [2021] [2020] [2019] [2018] [2017] [2016] [2015] [2014] [2013] [2012] [2011] [2010] [2009] [2008] [2007] [2006] [2005] [2004] [List of Speakers]
(To receive information about upcoming seminars, register for the RISC mailing list.)
[print]
School and Workshop "Mathematics of Information-Theoretic Cryptography"

School: 13 to 17 May.
Workshop: 21 to 25 May.
You can check the program here.

Date:May 13-25
Location:Lorentz Center (Leiden University)
Schedule: 
Tuesday, May 21
10:00-10:15Welcome
10:15-11:00Amos Beimel:
Multi-Linear Secret Sharing Schemes
11:00-11:25Coffe/tea break
11:25-11:55Oriol Farràs:
Secret Sharing Schemes for Very Dense Graphs
12:00-14:00Lunch @Snellius restaurant
14:00-14:30Gilles Zemor:
Low Rank Parity Check Codes and their Application to Cryptography
14:30-15:00Suhas Digavvi:
On Interactive Wireless Network Security
15:00-16:15Coffee/tea break
16:15-17:00Harald Niederreiter:
Remarkable Sequences Obtained from Global Function Fields
17:00Wine & cheese party @Common room
Wednesday, May 22
9:45Yevgeniy Dodis:
Key Derivation Without Entropy Waste
10:30-10:55Coffee/tea break
10:55-11:25Ruud Pellikaan:
Error-correcting pairs and arrays from algebraic geometry codes
11:25-11:55Yvo Desmedt:
Functional secret sharing
12:00-14:00Lunch @Snellius restaurant
14:00-14:30Tal Rabin:
Full Characterization of Functions that Imply Fair Coin Tossing and Ramifications to Fairness
14:30-15:00Alexander May:
Recent Progress in Decoding Random Linear Codes
15:00-15:30Coffee/tea break
15:30-17:00Rump Session
Thursday, May 23
9:45-10:30Renato Renner:
Smooth entropy in physics and information theory
10:30-10:55Coffee/tea break
10:55-11:25Serge Fehr:
The monogamy of entanglement, and one-sided device independent QKD
11:25-11:55Frantisek Matus:
Ideal secret sharing in quantum setting
12:00-14:00Lunch @Snellius restaurant
14:00-14:30Juan Garay:
Broadcast-Efficient Secure Multiparty Computation
14:30-15:00Manoj Prabhakaran:
Towards Quantitative Cryptographic Complexity
15:00-15:30Coffee/tea break
15:30-16:15Parikshit Gopalan:
Locally Testable Codes and their Guises
17:30-18:00Departure by bus to Leiderdorp
18:00-22:00Workshop dinner and boat trip
Friday, May 24
10:00-11:00Hendrik Lenstra:
Lattices with Symmetry
11:00-11:25Coffee/tea break
11:25-11:55Iwan Duursma:
Algebraic aspects of secret sharing
12:00-14:00Lunch @Snellius restaurant
14:00-14:45Chaoping Xing:
List Decoding Reed-Solomon, Algebraic Geometry and Gabidulin Subcodes
14:45-15:15Coffee/tea break
15:15-15:45Diego Mirandola:
On powers of codes
15:45-16:15Coffee/tea break
16:15-17:00Madhu Sudan:
Locality in codes and Lifting
Saturday, May 25
9:45-10:30Henning Stichtenoth:
On Ihara's constant A(q) over non-prime finite fields
10:30-10:55Coffee/tea break
10:55-11:25Alp Bassa:
Rational points on curves over finite fields and Drinfeld modular varieties
11:25-11:55Olav Geil:
Further improvements on the Feng-Rao bound for dual codes
12:00-14:00Lunch @Common room
14:00-14:30Tarik Kaced:
Essentially Conditional Inequalities Might Help
14:30-15:00Coffee/tea break
15:00-15:45Jesper Buus Nielsen:
Fun with Oblivious Transfer
15:45-16:00Closing Remarks
0.05174s