Sciweavers

343 search results - page 58 / 69
» Formal security analysis of PKCS
Sort
View
IPPS
2008
IEEE
15 years 3 months ago
What is the best way to prove a cryptographic protocol correct?
In this paper, we identify that protocol verification using invariants have significant limitations such as inapplicability to some protocols, non-standard attacker inferences a...
Sreekanth Malladi, Gurdeep S. Hura
ISI
2004
Springer
15 years 2 months ago
Interactive Query Languages for Intelligence Tasks
Counterterrorism and intelligence tasks rely on the efficient collection, analysis and dissemination of information. While information systems play a key role in such tasks, databa...
Antonio Badia
77
Voted
FMCO
2003
Springer
154views Formal Methods» more  FMCO 2003»
15 years 2 months ago
Tools for Generating and Analyzing Attack Graphs
Abstract. Attack graphs depict ways in which an adversary exploits system vulnerabilities to achieve a desired state. System administrators use attack graphs to determine how vulne...
Oleg Sheyner, Jeannette M. Wing
IJWIN
2006
209views more  IJWIN 2006»
14 years 9 months ago
On Connected Multiple Point Coverage in Wireless Sensor Networks
Abstract-- We consider a wireless sensor network consisting of a set of sensors deployed randomly. A point in the monitored area is covered if it is within the sensing range of a s...
Shuhui Yang, Fei Dai, Mihaela Cardei, Jie Wu, Floy...
POPL
2006
ACM
15 years 9 months ago
Decidability and proof systems for language-based noninterference relations
Noninterference is the basic semantical condition used to account for confidentiality and integrity-related properties in programming languages. There appears to be an at least im...
Mads Dam