Sciweavers

135 search results - page 16 / 27
» Formal Indistinguishability Extended to the Random Oracle Mo...
Sort
View
ENTCS
2006
145views more  ENTCS 2006»
13 years 7 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
UAI
2004
13 years 9 months ago
Active Model Selection
Classical learning assumes the learner is given a labeled data sample, from which it learns a model. The field of Active Learning deals with the situation where the learner begins...
Omid Madani, Daniel J. Lizotte, Russell Greiner
PKC
2010
Springer
187views Cryptology» more  PKC 2010»
13 years 9 months ago
Confidential Signatures and Deterministic Signcryption
Encrypt-and-sign, where one encrypts and signs a message in parallel, is usually not recommended for confidential message transmission. The reason is that the signature typically l...
Alexander W. Dent, Marc Fischlin, Mark Manulis, Ma...
FMCO
2008
Springer
117views Formal Methods» more  FMCO 2008»
13 years 9 months ago
Conformance Testing of Distributed Concurrent Systems with Executable Designs
Abstract. This paper presents a unified approach to test case generation and conformance test execution in a distributed setting. A model in the object-oriented, concurrent modelin...
Bernhard K. Aichernig, Andreas Griesmayer, Einar B...
SCN
2010
Springer
122views Communications» more  SCN 2010»
13 years 6 months ago
A New Security Model for Authenticated Key Agreement
The Canetti–Krawczyk (CK) and extended Canetti–Krawczyk (eCK) security models, are widely used to provide security arguments for key agreement protocols. We discuss security s...
Augustin P. Sarr, Philippe Elbaz-Vincent, Jean-Cla...