Sciweavers

176 search results - page 31 / 36
» Formal Security Analysis for Ad-Hoc Networks
Sort
View
LPAR
2007
Springer
14 years 2 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
ASIAN
2006
Springer
116views Algorithms» more  ASIAN 2006»
13 years 11 months ago
Secrecy Analysis in Protocol Composition Logic
We present formal proof rules for inductive reasoning about the way that data transmitted on the network remains secret from a malicious attacker. Extending a compositional protoco...
Arnab Roy, Anupam Datta, Ante Derek, John C. Mitch...
ESORICS
2007
Springer
14 years 2 months ago
SilentKnock: Practical, Provably Undetectable Authentication
Port knocking is a technique first introduced in the blackhat and trade literature to prevent attackers from discovering and exploiting potentially vulnerable services on a networ...
Eugene Y. Vasserman, Nicholas Hopper, John Laxson,...
SP
1998
IEEE
173views Security Privacy» more  SP 1998»
14 years 5 days ago
An Automated Approach for Identifying Potential Vulnerabilities in Software
This paper presents results from analyzing the vulnerability of security-critical software applications to malicious threats and anomalous events using an automated fault injectio...
Anup K. Ghosh, Tom O'Connor, Gary McGraw
TMC
2012
11 years 10 months ago
Protecting Location Privacy in Sensor Networks against a Global Eavesdropper
— While many protocols for sensor network security provide confidentiality for the content of messages, contextual information usually remains exposed. Such information can be c...
Kiran Mehta, Donggang Liu, Matthew Wright