Sciweavers

127 search results - page 13 / 26
» Proving Properties of Security Protocols by Induction
Sort
View
IFIP
2009
Springer
14 years 7 months ago
Finite Models in FOL-Based Crypto-Protocol Verification
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...
Jan Jürjens, Tjark Weber
IFIPTM
2010
139views Management» more  IFIPTM 2010»
14 years 8 months ago
Metric Strand Spaces for Locale Authentication Protocols
Abstract. Location-dependent services are services that adapt their behavior based on the locations of mobile devices. For many applications, it is critical that location-dependent...
F. Javier Thayer, Vipin Swarup, Joshua D. Guttman
IACR
2011
221views more  IACR 2011»
13 years 9 months ago
A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions
Abstract. Radio Frequency Identification (RFID) systems are vulnerable to relay attacks (i.e., mafia, terrorist and distance frauds) when they are used for authentication purpose...
Süleyman Kardas, Mehmet Sabir Kiraz, Muhammed...
CSFW
2012
IEEE
13 years 1 days ago
Provably Secure and Practical Onion Routing
The onion routing network Tor is undoubtedly the most widely employed technology for anonymous web access. Although the underlying onion routing (OR) protocol appears satisfactory...
Michael Backes, Ian Goldberg, Aniket Kate, Esfandi...
CSFW
2002
IEEE
15 years 2 months ago
Types and Effects for Asymmetric Cryptographic Protocols
We present the first type and effect system for proving authenticity properties of security protocols based on asymmetric cryptography. The most significant new features of our ...
Andrew D. Gordon, Alan Jeffrey