Department of Computer Science | Institute of Theoretical Computer Science | CADMO
Prof. Emo Welzl and Prof. Bernd Gärtner
Mittagsseminar Talk Information |
Date and Time: Tuesday, January 25, 2011, 12:15 pm
Duration: This information is not available in the database
Location: OAT S15/S16/S17
Speaker: Robin Künzler
The two models mentioned in the title are widely used to prove the security of cryptographic schemes under the assumption that an ideal primitive (a random oracle, or an ideal cipher, respectively) is given.
It is natural to ask if security in one model also implies security in the other model, i.e., are the models equivalent? Coron et al. proved the second and more challenging direction of this equivalence in 2008. In my Master‘s Thesis I showed that their proof is not correct and together with Holenstein and Tessaro we recently gave a new proof [1]. I am going to describe the two models, and then explain the security notion required to argue about their equivalence. Finally, I will describe the construction we use and sketch some of the challenges of the security proof.
[1] Thomas Holenstein, Robin Künzler, Stefano Tessaro: The Equivalence of the Random Oracle Model and the Ideal Cipher Model, Revisited. http://arxiv.org/abs/1011.1264v1
Upcoming talks | All previous talks | Talks by speaker | Upcoming talks in iCal format (beta version!)
Previous talks by year: 2025 2024 2023 2022 2021 2020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999 1998 1997 1996
Information for students and suggested topics for student talks
Automatic MiSe System Software Version 1.4803M | admin login