Sciweavers

227 search results - page 19 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
P2P
2008
IEEE
14 years 1 months ago
Proactive Role Discovery in Mediator-Free Environments
The rapid proliferation of Internet and related technologies has created tremendous possibilities for the interoperability between domains in distributed environments. Interoperab...
Mohamed Shehab, Elisa Bertino, Arif Ghafoor
CSFW
2010
IEEE
13 years 11 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin
FORTE
2004
13 years 9 months ago
A Construction Kit for Modeling the Security of M-commerce Applications
Abstract. In this article we present a method to avoid security problems in modern m-commerce applications. The security problems that we are addressing are breaches of security du...
Dominik Haneberg, Wolfgang Reif, Kurt Stenzel
INFOCOM
2005
IEEE
14 years 1 months ago
PIKE: peer intermediaries for key establishment in sensor networks
— The establishment of shared cryptographic keys between communicating neighbor nodes in sensor networks is a challenging problem due to the unsuitability of asymmetric key crypt...
Haowen Chan, Adrian Perrig
JACM
2000
77views more  JACM 2000»
13 years 7 months ago
The fault span of crash failures
A crashing network protocol is an asynchronous protocol whose memory does not survive crashes. We show that a crashing network protocol that works over unreliable links can be driv...
George Varghese, Mahesh Jayaram