<< 2009-0 >>
Department of
Computer Science
 

November 3-5, 2004, INRIA, Versailles, Paris.

http://www.cs.bris.ac.uk/Research/CryptographySecurity/Workshop_Provable_Security.html

Workshop Slides

SPEAKER TITLE
Alex DentGame hopping proof techniques
David PointchevalProvable Security and Ideal Models
Caroline KudlaModelling the security of Two-Party key agreement protocols
Marc FischlinRe-Revisiting the Random Oracle Methodology in Cryptology
Contact the author for the slides.
Moti Yung TBA
Endre-Felix BangerterEfficient Proofs Of Knowledge of a Preimage of a Group Homomorphism with Unknown Order of the Co-Domain
David GalindoThe Exact Security of Pairing Based Encryption and Signature Schemes
Shai HaleviUniversally Composable Password-Based Key Exchange
Mario Di RaimondoAlternative Methods for Deniable Authentication
Tatsuaki OkamotoTBA
Maria Isabel Glez. VascoConstructing group based provably secure schemes: a methodology
Michel AbdallaNotions of security for password-based authenticated key exchange
Douglas Wikstrom Attacks against against a mix-net of Golle, Zhong, Boneh, Jakobsson and Juels
Yevgeniy DodisProvable cryptography based on biometrics and other noisy data
Ron CramerPractical Non-Interactive Zero-Knowledge Proofs

© 1995-2010 University of Bristol  |  Terms and Conditions
About this Page