Sciweavers

24 search results - page 2 / 5
» How to prevent type-flaw attacks on security protocols under...
Sort
View
IFIP
2009
Springer
13 years 2 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
IJIPT
2010
147views more  IJIPT 2010»
13 years 3 months ago
On investigating ARP spoofing security solutions
: The Address Resolution Protocol (ARP) has proven to work well under regular circumstances, but it was not designed to cope with malicious hosts. By performing ARP spoofing attack...
Zouheir Trabelsi, Wassim El-Hajj
WS
2003
ACM
13 years 10 months ago
Rushing attacks and defense in wireless ad hoc network routing protocols
In an ad hoc network, mobile computers (or nodes) cooperate to forward packets for each other, allowing nodes to communicate beyond their direct wireless transmission range. Many ...
Yih-Chun Hu, Adrian Perrig, David B. Johnson
CORR
2011
Springer
175views Education» more  CORR 2011»
12 years 8 months ago
Extracting and Verifying Cryptographic Models from C Protocol Code by Symbolic Execution
Consider the problem of verifying security properties of a cryptographic protocol coded in C. We propose an automatic solution that needs neither a pre-existing protocol descripti...
Mihhail Aizatulin, Andrew D. Gordon, Jan Jürj...
CCS
2008
ACM
13 years 6 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