Sciweavers

45 search results - page 8 / 9
» Automatic Verification of Correspondences for Security Proto...
Sort
View
ACSAC
2010
IEEE
13 years 3 months ago
Keeping data secret under full compromise using porter devices
We address the problem of confidentiality in scenarios where the attacker is not only able to observe the communication between principals, but can also fully compromise the commu...
Christina Pöpper, David A. Basin, Srdjan Capk...
CNSM
2010
13 years 3 months ago
Automated and secure IPv6 configuration in enterprise networks
Over the last decade, IPv6 has established itself as the most mature network protocol for the future Internet. Its recent deployment in core networks of operators, its availability...
Frederic Beck, Olivier Festor, Isabelle Chrisment,...
SP
2005
IEEE
100views Security Privacy» more  SP 2005»
13 years 11 months ago
Polygraph: Automatically Generating Signatures for Polymorphic Worms
It is widely believed that content-signature-based intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt....
James Newsome, Brad Karp, Dawn Xiaodong Song
CORR
2004
Springer
120views Education» more  CORR 2004»
13 years 5 months ago
Validating a Web Service Security Abstraction by Typing
Abstraction by Typing Andrew D. Gordon Microsoft Research Riccardo Pucella Cornell University An XML web service is, to a first approximation, an RPC service in which requests and...
Andrew D. Gordon, Riccardo Pucella
FC
2010
Springer
169views Cryptology» more  FC 2010»
13 years 9 months ago
A Formal Approach for Automated Reasoning about Off-Line and Undetectable On-Line Guessing
Abstract. Starting from algebraic properties that enable guessing lowentropy secrets, we formalize guessing rules for symbolic verification. The rules are suited for both off-line ...
Bogdan Groza, Marius Minea