Sciweavers

576 search results - page 7 / 116
» Modeling Adversaries in a Logic for Security Protocol Analys...
Sort
View
CCS
2009
ACM
14 years 2 months ago
Computational soundness for key exchange protocols with symmetric encryption
Formal analysis of security protocols based on symbolic models has been very successful in finding flaws in published protocols and proving protocols secure, using automated too...
Ralf Küsters, Max Tuengerthal
ICNP
2007
IEEE
14 years 1 months ago
Location Privacy in Sensor Networks Against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
K. Mehta, Donggang Liu, Matthew Wright
CANS
2009
Springer
132views Cryptology» more  CANS 2009»
13 years 11 months ago
Fully Robust Tree-Diffie-Hellman Group Key Exchange
We extend the well-known Tree-Diffie-Hellman technique used for the design of group key exchange (GKE) protocols with robustness, i.e. with resistance to faults resulting from poss...
Timo Brecher, Emmanuel Bresson, Mark Manulis
CORR
2006
Springer
105views Education» more  CORR 2006»
13 years 7 months ago
Knowledge Flow Analysis for Security Protocols
Knowledge flow analysis offers a simple and flexible way to find flaws in security protocols. A protocol is described by a collection of rules constraining the propagation of know...
Emina Torlak, Marten van Dijk, Blaise Gassend, Dan...
ASIACRYPT
2007
Springer
14 years 1 months ago
Secure Protocols with Asymmetric Trust
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...
Ivan Damgård, Yvo Desmedt, Matthias Fitzi, J...