Sciweavers

3504 search results - page 234 / 701
» Secure protocol composition
Sort
View
CCS
2003
ACM
15 years 11 months ago
DoS protection for UDP-based protocols
Since IP packet reassembly requires resources, a denial of service attack can be mounted by swamping a receiver with IP fragments. In this paper we argue how this attack need not ...
Charlie Kaufman, Radia J. Perlman, Bill Sommerfeld
CCS
2008
ACM
15 years 8 months ago
Reducing protocol analysis with XOR to the XOR-free case in the horn theory based approach
In the Horn theory based approach for cryptographic protocol analysis, cryptographic protocols and (Dolev-Yao) intruders are modeled by Horn theories and security analysis boils d...
Ralf Küsters, Tomasz Truderung
CCS
2008
ACM
15 years 8 months ago
Location privacy of distance bounding protocols
Distance bounding protocols have been proposed for many security critical applications as a means of getting an upper bound on the physical distance to a communication partner. As...
Kasper Bonne Rasmussen, Srdjan Capkun
CN
2006
117views more  CN 2006»
15 years 6 months ago
Using equivalence-checking to verify robustness to denial of service
In this paper, we introduce a new security property which intends to capture the ability of a cryptographic protocol being resistant to denial of service. This property, called im...
Stéphane Lafrance
ENTCS
2008
70views more  ENTCS 2008»
15 years 6 months ago
Separate Compilation of Polychronous Specifications
As code generation for synchronous programs requires strong safety properties to be satisfied, compositionality becomes a difficult goal to achieve. Most synchronous languages, su...
Julien Ouy, Jean-Pierre Talpin, Loïc Besnard,...