Sciweavers

Share
JCS
2010
80views more  JCS 2010»
8 years 10 months ago
Constraint differentiation: Search-space reduction for the constraint-based analysis of security protocols
We introduce constraint differentiation, a powerful technique for reducing search when model-checking security protocols using constraint-based methods. Constraint differentiation...
Sebastian Mödersheim, Luca Viganò, Dav...
ICUMT
2009
9 years 1 months ago
A syntactic approach for identifying multi-protocol attacks
In the context of multiple security protocols running in the same environment, we propose a syntactical approach for identifying multi-protocol attacks. The proposed approach uses ...
Béla Genge, Piroska Haller
CORR
2010
Springer
83views Education» more  CORR 2010»
9 years 3 months ago
A Platform for Implementing Secure Wireless Ad Hoc Networks
: We propose a new platform for implementing secure wireless ad hoc networks. Our proposal is based on a modular architecture, with the software stack constructed directly on the E...
Gyula Farkas, Béla Genge, Piroska Haller
IJNSEC
2007
110views more  IJNSEC 2007»
9 years 3 months ago
A Light Weight Enhancement to RC4 Based Security for Resource Constrained Wireless Devices
The Wired Equivalent Privacy (WEP) uses the 64 bit RC4 secret key stream cipher as its layer 2 security protocol. Although the underlying RC4 cipher is secure, the potential reuse...
Chetan Nanjunda Mathur, K. P. Subbalakshmi
IJNSEC
2007
130views more  IJNSEC 2007»
9 years 3 months ago
Central Manager: A Solution to Avoid Denial Of Service Attacks for Wireless LANs
802.1x is a security protocol based on the frame structure
Ping Ding
FUIN
2007
99views more  FUIN 2007»
9 years 3 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
JCS
2008
109views more  JCS 2008»
9 years 3 months ago
Secrecy for bounded security protocols with freshness check is NEXPTIME-complete
The secrecy problem for security protocols is the problem to decide whether or not a given security protocol has leaky runs. In this paper, the (initial) secrecy problem for bound...
Ferucio Laurentiu Tiplea, Catalin V. Birjoveanu, C...
ENTCS
2006
145views more  ENTCS 2006»
9 years 3 months ago
Compositionality of Security Protocols: A Research Agenda
The application of formal methods to security protocol analysis has been extensively researched during the last 25 years. Several formalisms and (semi-)automatic tools for the ver...
Cas J. F. Cremers
ISICT
2003
9 years 5 months ago
Analysis of a mobile communication security protocol
: Cryptographic protocols are used to achieve secure communication over insecure networks. Weaknesses in such protocols are hard to identify, as they can be the result of subtle de...
Tom Coffey, Reiner Dojen
CCS
2008
ACM
9 years 5 months ago
Unbounded verification, falsification, and characterization of security protocols by pattern refinement
We present a new verification algorithm for security protocols that allows for unbounded verification, falsification, and complete characterization. The algorithm provides a numbe...
Cas J. F. Cremers
books