A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Unifying simulatability definitions in cryptographic systems under different timing assumptions
2005
The Journal of Logic and Algebraic Programming
The cryptographic concept of simulatability has become a salient technique for faithfully analyzing and proving security properties of arbitrary cryptographic protocols. We investigate the relationship between simulatability in synchronous and asynchronous frameworks by means of the formal models of Pfitzmann et al., which are seminal in using this concept in order to bridge the gap between the formal-methods and the cryptographic community. We show that the synchronous model can be seen as a
doi:10.1016/j.jlap.2004.09.002
fatcat:q2e76u3o7bbwvpl3agnvq5nbhy