Sciweavers

25 search results - page 5 / 5
» Symbolic Trace Analysis of Cryptographic Protocols
Sort
View
CCS
2009
ACM
13 years 11 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
ASWEC
2006
IEEE
13 years 11 months ago
Formal Verification of the IEEE 802.11i WLAN Security Protocol
With the increased usage of wireless LANs (WLANs), businesses and educational institutions are becoming more concerned about wireless network security. The latest WLAN security pr...
Elankayer Sithirasenan, Saad Zafar, Vallipuram Mut...
ACNS
2005
Springer
97views Cryptology» more  ACNS 2005»
13 years 10 months ago
Thompson's Group and Public Key Cryptography
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established prot...
Vladimir Shpilrain, Alexander Ushakov
TPHOL
2009
IEEE
13 years 11 months ago
Formalising Observer Theory for Environment-Sensitive Bisimulation
Abstract. We consider a formalisation of a notion of observer (or intruder) theories, commonly used in symbolic analysis of security protocols. An observer theory describes the kno...
Jeremy E. Dawson, Alwen Tiu
JSAC
2008
118views more  JSAC 2008»
13 years 4 months ago
PEEC: a channel-adaptive feedback-based error
Reliable transmission is a challenging task over wireless LANs since wireless links are known to be susceptible to errors. Although the current IEEE802.11 standard ARQ error contro...
Sohraab Soltani, Hayder Radha