Sciweavers

196 search results - page 21 / 40
» Formally Analysing a Security Protocol for Replay Attacks
Sort
View
ICALP
2005
Springer
15 years 3 months ago
Probabilistic Polynomial-Time Semantics for a Protocol Security Logic
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
Anupam Datta, Ante Derek, John C. Mitchell, Vitaly...
IPL
2007
72views more  IPL 2007»
14 years 9 months ago
How to safely close a discussion
In the secure communication problem, we focus on safe termination. In applications such as electronic transactions, we want each party to be ensured that both sides agree on the s...
Gildas Avoine, Serge Vaudenay
HICSS
2005
IEEE
144views Biometrics» more  HICSS 2005»
15 years 3 months ago
Secure Dynamic Source Routing
— In this paper we present the Secure Dynamic Source Routing protocol for Mobile Ad hoc Networks that prevents a lot of potential attacks to these kind of networks. We also prese...
Frank Kargl, Alfred Geiss, Stefan Schlott, Michael...
NETWORKING
2007
14 years 11 months ago
Privacy-Aware Multi-Context RFID Infrastructure Using Public Key Cryptography
We propose a novel approach in designing an RFID infrastructure which foresees the usage of a single RFID tag within different contexts and for multiple purposes. We regard privacy...
Selim Volkan Kaya, Erkay Savas, Albert Levi, Ö...
CSFW
2006
IEEE
15 years 3 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...