AIST > RCIS > Events > Computational and Symbolic Proofs of Security > Talk Schedule

Talk Schedule

Monday, April 6th

• 8:30-10:00: Martin Abadi: Introduction to Computational Soundness

• 10:30-12:00: Bogdan Warinschi: Introduction to Computational Soundness (cntd)

• 13:30-14:30: David Pointcheval: The Game-based Methodology for Computational Security Proofs

• 14:30-15:00: Y. Lakhnech: Towards Automated Proofs for Asymmetric Encrytion Schemes in the Random Oracle Model

• 15:30-16:00: Véronique Cortier: Computational soundness of observational equivalence
• 16:00-16:30: Yusuke Kawamoto, Hideki Sakurada: Computationally Sound Symbolic Analysis of anonymity in presence of active adversaries
• 16:30-17:00: K. Bhargavan, R. Corin, C. Fournet, E. Zalinescu: Cryptographic Verification of Protocol Implementations
• 17:00-17:30: Sergiu Bursuc: Observational and symbolic equivalence

Tuesday, April 7th

• 13:30-15:00: J. Mitchell: Protocol composition logic: symbolic model, computational model, and applications (I)

• 15:30-16:30: J. Mitchell: Protocol composition logic: symbolic model, computational model, and applications (II)
• 16:30-17:00: Arnab Roy, Anupam Datta, Ante Derek, John Mitchell: Inductive Proofs of Computational secrecy
• 17:00-17:30: B. Grégoire, S. Heraud, S. Zanella, G. Barthe: CertiCrypt: Formal certification of code-based cryptographic proofs
• 17:30-18:00: G. Bana, Y. Kawamoto, H. Sakurada: Computational Soundness of (Interactive) Zero-Knowledge Proof Systems in Presence of Active Adversaries

• 19:30-21:00: Matthias Berg: On Reactive Simulatability

Wednesday, April 8th

• 8:30-10:00: O. Pereira: Introduction to Universally Composable Security

• 10:30-12:00: R. Küsters: Simulation-based Security and Joint State Theorems in the IITM Model

• 13:30-14:30: K. Ohta: Cryptographic Applications of Indifferentiability via Leaking Random Oracle Models
• 14:30-15:00: I. Suzuki, Y. Kamano, M. Yoshida, T. Fujiwara: Development of a Verification Tool for Composable Security

• 15:30-16:00: C. Fournet: Computational Soundness for cryptographic typechecking
• 16:00-16:30: P. Adao, C. Fournet, N. Guts, F. Zappa-Nardelli: High-Level Programming for E-cash

Thursday, April 9th

• 8:30-10:00: R. Segala: On the Use of Probabilistic Automata for Security Proofs

• 10:30-12:00: R. Segala: On the Use of Probabilistic Automata for Security Proofs (cnt'd)

• 13:30-14:30: B. Blanchet: Cryptoverif: A Computationally Sound Mechanized Prover for Cryptographic Protocols

• 14:30-15:00: Gergei Bana, Koji Hasebe, Mitsuhiro Okada: Recent approaches to computational semantics for first-order logical analysis of cryptographic protocols