Sciweavers

35 search results - page 6 / 7
» A Formal Analysis for Capturing Replay Attacks in Cryptograp...
Sort
View
CCS
2008
ACM
13 years 9 months ago
Secure neighbor discovery in wireless networks: formal investigation of possibility
Wireless communication enables a broad spectrum of applications, ranging from commodity to tactical systems. Neighbor discovery (ND), that is, determining which devices are within...
Marcin Poturalski, Panos Papadimitratos, Jean-Pier...
CORR
2010
Springer
152views Education» more  CORR 2010»
13 years 7 months ago
Automatic analysis of distance bounding protocols
Distance bounding protocols are used by nodes in wireless networks for the crucial purpose of estimating their distances to other nodes. Past efforts to analyze these protocols hav...
Sreekanth Malladi, Bezawada Bruhadeshwar, Kishore ...
CCS
2010
ACM
13 years 4 months ago
Practical leakage-resilient pseudorandom generators
Cryptographic systems and protocols are the core of many Internet security procedures (such as SSL, SSH, IPSEC, DNSSEC, secure mail, etc.). At the heart of all cryptographic funct...
Yu Yu, François-Xavier Standaert, Olivier P...
CSL
2010
Springer
13 years 8 months ago
Degrees of Security: Protocol Guarantees in the Face of Compromising Adversaries
Abstract. We present a symbolic framework, based on a modular operational semantics, for formalizing different notions of compromise relevant for the analysis of cryptographic prot...
David A. Basin, Cas J. F. Cremers
SASN
2003
ACM
14 years 1 months ago
Modeling vulnerabilities of ad hoc routing protocols
The purpose of this work is to automate the analysis of ad hoc routing protocols in the presence of attackers. To this end, a formal model of protocol behavior is developed in whi...
Shahan Yang, John S. Baras