168
Voted
TCC
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We prove a computational soundness theorem for the symbolic analysis of cryptographic protocols which extends an analogous theorem of Abadi and Rogaway (J. of Cryptology ...
160
Voted
TCC
2007
Springer
16 years 14 days ago
2007
Springer
We prove a computational soundness theorem for symmetric-key encryption protocols that can be used to analyze security against adaptively corrupting adversaries (that is, adversar...