3531 articles – 5253 Notices  [english version]
.:. Consultation > Liste par auteurs > Warinschi .:.
18 documents classés par :
Première Page Page Précédente 1 - 2
From passive to active security via a simple transformation
Eugen Z., Cortier V., Warinschi B.
(2007) [inria-00139908 - version 1]
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Cortier V., Hoerdegen H., Warinschi B.
Dans Workshop on Information and Computer Security (ICS 2006) (2006) [inria-00108404 - version 1]
Computationally Sound Symbolic Secrecy in the Presence of Hash Functions
Cortier V., Kremer S., Kuesters R., Warinschi B.
Dans Proceedings of the 26th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'06) (2006) [inria-00108386 - version 1]
fulltext access Soundness of Symbolic Equivalence for Modular Exponentiation
Lakhnech Y., Mazare L., Warinschi B.
Dans Workshop on Formal and Computational Cryptography - FCC 2006 (2006) [inria-00080673 - version 1]
fulltext access Computationally Sound Compositional Logic for Security Protocols
Datta A., Derek A., Mitchell J. C., Roy A., Shmatikov V., Turuani M., Warinschi B.
Dans Workshop on Formal and Computational Cryptography - FCC 2006 (2006) [inria-00080593 - version 1]
fulltext access Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Cortier V., Hördegen H., Warinschi B.
N° RR-5928 (2006) [inria-00078825 - version 2]
Computationally Sound, Automated Proofs for Security Protocols
Cortier V., Warinschi B.
Dans 14th European Symposium on Programming - ESOP 2005 3444 (2005) 157-171 [inria-00000556 - version 1]
fulltext access Computationally Sound, Automated Proofs for Security Protocols
Cortier V., Warinschi B.
N° RR-5341 (2004) [inria-00070660 - version 1]