Abstract. Simulatability has established itself as a salient notion for defining and proving the security of cryptographic
protocols since it entails strong security and compositionality guarantees, which are achieved by universally
quantifying over all environmental behaviors of the analyzed protocol. As a consequence, however, protocols that
are secure except for certain environmental behaviors are not simulatable, even if these behaviors are efficiently
identifiable and thus can be prevented by the surrounding protocol.
存档附件原文地址
原文发布时间:2008/11/13
引用本文:
Michael Backes;Markus Dürmuth;Dennis Hofheinz;Ralf Küsters.Conditional Reactive Simulatability.http://ynau.firstlight.cn/View.aspx?infoid=556131&cb=zhangyingyingxg.
发布时间:2008/11/13.检索时间:2024/12/14