Sciweavers

13 search results - page 2 / 3
» On Simulatability Soundness and Mapping Soundness of Symboli...
Sort
View
TCC
2005
Springer
163views Cryptology» more  TCC 2005»
14 years 4 months ago
Adaptive Security of Symbolic Encryption
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 ...
Daniele Micciancio, Saurabh Panjwani
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
14 years 4 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
ACL
1997
14 years 3 days ago
Paradigmatic Cascades: a Linguistically Sound Model of Pronunciation by Analogy
We present and experimentally evaluate a new model of pronunciation by analogy: the paradigmatic cascades model. Given a pronunciation lexicon, this algorithm first extracts the m...
François Yvon
FM
2006
Springer
153views Formal Methods» more  FM 2006»
14 years 2 months ago
Formal Methods and Cryptography
Security-critical systems are an important application area for formal methods. However, such systems often contain cryptographic subsystems. The natural definitions of these subsy...
Michael Backes, Birgit Pfitzmann, Michael Waidner
ENTCS
2006
145views more  ENTCS 2006»
13 years 10 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes