Sciweavers

176 search results - page 33 / 36
» Formal Security Analysis for Ad-Hoc Networks
Sort
View
FSTTCS
2003
Springer
14 years 1 months 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
CSFW
2012
IEEE
11 years 10 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...
CCS
2008
ACM
13 years 10 months ago
The risk-utility tradeoff for IP address truncation
Network operators are reluctant to share traffic data due to security and privacy concerns. Consequently, there is a lack of publicly available traces for validating and generaliz...
Martin Burkhart, Daniela Brauckhoff, Martin May, E...
FMCO
2003
Springer
154views Formal Methods» more  FMCO 2003»
14 years 1 months ago
Tools for Generating and Analyzing Attack Graphs
Abstract. Attack graphs depict ways in which an adversary exploits system vulnerabilities to achieve a desired state. System administrators use attack graphs to determine how vulne...
Oleg Sheyner, Jeannette M. Wing
ICNP
2007
IEEE
14 years 2 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