Sciweavers

335 search results - page 54 / 67
» Reasoning about Probabilistic Security Using Task-PIOAs
Sort
View
POPL
2006
ACM
14 years 8 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
SOICT
2010
13 years 2 months ago
Password recovery for encrypted ZIP archives using GPUs
Protecting data by passwords in documents such as DOC, PDF or RAR, ZIP archives has been demonstrated to be weak under dictionary attacks. Time for recovering the passwords of suc...
Pham Hong Phong, Phan Duc Dung, Duong Nhat Tan, Ng...
IFM
2010
Springer
190views Formal Methods» more  IFM 2010»
13 years 6 months ago
On Model Checking Techniques for Randomized Distributed Systems
Abstract. The automata-based model checking approach for randomized distributed systems relies on an operational interleaving semantics of the system by means of a Markov decision ...
Christel Baier
SEC
1996
13 years 9 months ago
Intention modelling: approximating computer user intentions for detection and prediction of intrusions
This paper introduces and describes an innovative modelling approach which utilises models that are synthesised through approximate calculations of user actions and extensive repr...
Thomas Spyrou, John Darzentas
CADE
1998
Springer
13 years 12 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...