Selected publications at LSV: 2006

Véronique Cortier, Steve Kremer, Ralf Küsters and Bogdan WarinschiComputationally Sound Symbolic Secrecy in the Presence of Hash FunctionsIn N. Garg and S. Arun-Kumar (eds.), Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06), Kolkata, India, December 2006, LNCS 4337, pages 176-187. Springer. ( PDF | PS | PS.GZ | PDF (long version) | PS (long version) | PS.GZ (long version) )
doi: 10.1007/11944836_18
The standard symbolic, deducibility-based notions of secrecy are in general insufficient from a cryptographic point of view, especially in presence of hash functions. In this paper we devise and motivate a more appropriate secrecy criterion which exactly captures a standard cryptographic notion of secrecy for protocols involving public-key enryption and hash functions: protocols that satisfy it are computationally secure while any violation of our criterion directly leads to an attack. Furthermore, we prove that our criterion is decidable via an NP decision procedure. Our results hold for standard security notions for encryption and hash functions modeled as random oracles.

   address = {Kolkata, India},
   author = {Cortier, V{\'e}ronique and Kremer, Steve and K{\"u}sters, Ralf and Warinschi, Bogdan},
   booktitle = {{P}roceedings of the 26th {C}onference on {F}oundations of {S}oftware {T}echnology and {T}heoretical {C}omputer {S}cience ({FSTTCS}'06)},
   DOI = {10.1007/11944836_18},
   editor = {Garg, Naveen and Arun-Kumar, S.},
   month = dec,
   pages = {176-187},
   publisher = {Springer},
   series = {Lecture Notes in Computer Science},
   title = {Computationally Sound Symbolic Secrecy in the Presence of Hash Functions},
   url = {},
   volume = {4337},
   year = {2006},

About LSV