Sciweavers

120 search results - page 4 / 24
» A Practical and Secure Communication Protocol in the Bounded...
Sort
View
FUIN
2007
99views more  FUIN 2007»
13 years 6 months ago
Verifying Security Protocols Modelled by Networks of Automata
In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Miroslaw Kurkowski, Wojciech Penczek
CONEXT
2008
ACM
13 years 8 months ago
Packet-dropping adversary identification for data plane security
Until recently, the design of packet dropping adversary identification protocols that are robust to both benign packet loss and malicious behavior has proven to be surprisingly el...
Xin Zhang, Abhishek Jain 0002, Adrian Perrig
FSTTCS
2003
Springer
14 years 3 days ago
Tagging Makes Secrecy Decidable with Unbounded Nonces as Well
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...
Ramaswamy Ramanujam, S. P. Suresh
MDM
2007
Springer
111views Communications» more  MDM 2007»
14 years 1 months ago
FragDB - Secure Localized Storage Based on Super-Distributed RFID-Tag Infrastructures
Smart environments and wearables will make the storage and subsequent sharing of digitized multimedia diaries and meeting protocols – whom we meet, or what we say or do – chea...
Marc Langheinrich
CSFW
2009
IEEE
14 years 1 months ago
Modeling and Verifying Physical Properties of Security Protocols for Wireless Networks
We present a formal model for modeling and reasoning about security protocols. Our model extends standard, inductive, trace-based, symbolic approaches with a formalization of phys...
Patrick Schaller, Benedikt Schmidt, David A. Basin...