Sciweavers

227 search results - page 39 / 46
» On the Reachability Problem in Cryptographic Protocols
Sort
View
COORDINATION
2008
Springer
13 years 9 months ago
A Process Calculus for Mobile Ad Hoc Networks
We present the -calculus, a process calculus for formally modeling and reasoning about Mobile Ad Hoc Wireless Networks (MANETs) and their protocols. The -calculus naturally capture...
Anu Singh, C. R. Ramakrishnan, Scott A. Smolka
IJFCS
2006
110views more  IJFCS 2006»
13 years 7 months ago
Sat-based Model Checking for Region Automata
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this re...
Fang Yu, Bow-Yaw Wang
PERCOM
2005
ACM
14 years 7 months ago
Security Parallels between People and Pervasive Devices
Unique and challenging security problems arise due to the scarcity of computational, storage, and power resources in the low-cost pervasive computing environment. Particularly rel...
Stephen A. Weis
ESORICS
2002
Springer
14 years 7 months ago
Outbound Authentication for Programmable Secure Coprocessors
A programmable secure coprocessor platform can help solve many security problems in distributed computing. However, these solutions usually require that coprocessor applications be...
Sean W. Smith
CDC
2008
IEEE
180views Control Systems» more  CDC 2008»
14 years 1 months ago
Opacity-enforcing supervisory strategies for secure discrete event systems
— Initial-state opacity emerges as a key property in numerous security applications of discrete event systems including key-stream generators for cryptographic protocols. Speciï¬...
Anooshiravan Saboori, Christoforos N. Hadjicostis