Sciweavers

719 search results - page 74 / 144
» Proving Security Protocols Correct
Sort
View
CORR
2006
Springer
82views Education» more  CORR 2006»
14 years 9 months ago
Explicit Randomness is not Necessary when Modeling Probabilistic Encryption
Although good encryption functions are probabilistic, most symbolic models do not capture this aspect explicitly. A typical solution, recently used to prove the soundness of such ...
Véronique Cortier, Heinrich Hördegen, ...
CISC
2005
Springer
169views Cryptology» more  CISC 2005»
15 years 3 months ago
On Bluetooth Repairing: Key Agreement Based on Symmetric-Key Cryptography
Abstract. Despite many good (secure) key agreement protocols based on publickey cryptography exist, secure associations between two wireless devices are often established using sym...
Serge Vaudenay
CSFW
2002
IEEE
15 years 2 months ago
Polynomial Fairness and Liveness
Important properties of many protocols are liveness or availability, i.e., that something good happens now and then. In asynchronous scenarios these properties obviously depend on...
Michael Backes, Birgit Pfitzmann, Michael Steiner,...
ESORICS
2007
Springer
15 years 4 months ago
Completeness of the Authentication Tests
Protocol participants manipulate values, transforming the cryptographic contexts in which they occur. The rules of the protocol determine which transformations are permitted. We fo...
Shaddin F. Doghmi, Joshua D. Guttman, F. Javier Th...
ASIACRYPT
2001
Springer
15 years 1 months ago
Provably Authenticated Group Diffie-Hellman Key Exchange - The Dynamic Case
Dynamic group Diffie-Hellman protocols for Authenticated Key Exchange (AKE) are designed to work in a scenario in which the group membership is not known in advance but where parti...
Emmanuel Bresson, Olivier Chevassut, David Pointch...