Sciweavers

335 search results - page 33 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
PODS
2006
ACM
156views Database» more  PODS 2006»
14 years 7 months ago
From statistical knowledge bases to degrees of belief: an overview
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
Joseph Y. Halpern
CRYPTO
1997
Springer
156views Cryptology» more  CRYPTO 1997»
13 years 12 months ago
Fast and Secure Hashing Based on Codes
This paper considers hash functions based on block ciphers. It presents a new attack on the compression function of the 128-bit hash function MDC-4 using DES with a complexity far ...
Lars R. Knudsen, Bart Preneel
SIGMETRICS
2008
ACM
119views Hardware» more  SIGMETRICS 2008»
13 years 7 months ago
Network externalities and the deployment of security features and protocols in the internet
Getting new security features and protocols to be widely adopted and deployed in the Internet has been a continuing challenge. There are several reasons for this, in particular ec...
Marc Lelarge, Jean Bolot
AAAI
2012
11 years 10 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...
AUSAI
2003
Springer
13 years 11 months ago
Decidability of Propositionally Quantified Logics of Knowledge
Abstract. Logics of knowledge have important applications for reasoning about security protocols and multi-agent systems. We extend the semantics for the logic of necessity with lo...
Tim French