Sciweavers

460 search results - page 47 / 92
» Heuristic Methods for Security Protocols
Sort
View
INFOCOM
2012
IEEE
12 years 6 months ago
Expected loss bounds for authentication in constrained channels
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy conditions and communication costs. This is motivated by a numbe...
Christos Dimitrakakis, Aikaterini Mitrokotsa, Serg...
PODC
2003
ACM
14 years 29 days ago
Constructing fair-exchange protocols for E-commerce via distributed computation of RSA signatures
Applications such as e-commerce payment protocols, electronic contract signing, and certified e-mail delivery require that fair exchange be assured. A fair-exchange protocol allo...
Jung Min Park, Edwin K. P. Chong, Howard Jay Siege...
ASIACRYPT
2004
Springer
14 years 1 months ago
Asynchronous Proactive Cryptosystems Without Agreement (Extended Abstract)
d abstract) Bartosz Przydatek1 and Reto Strobl2 1 Department of Computer Science, ETH Z¨urich, Switzerland 2 IBM Research, Zurich Research Laboratory, Switzerland In this paper, w...
Bartosz Przydatek, Reto Strobl
TIFS
2011
252views Education» more  TIFS 2011»
13 years 2 months ago
Secure Device Pairing Based on a Visual Channel: Design and Usability Study
— “Pairing” is the establishment of authenticated key agreement between two devices over a wireless channel. Such devices are ad hoc in nature as they lack any common preshar...
Nitesh Saxena, Jan-Erik Ekberg, Kari Kostiainen, N...
SIGCOMM
2010
ACM
13 years 8 months ago
DONAR: decentralized server selection for cloud services
Geo-replicated services need an effective way to direct client requests to a particular location, based on performance, load, and cost. This paper presents DONAR, a distributed sy...
Patrick Wendell, Joe Wenjie Jiang, Michael J. Free...