Sciweavers

ASIAN
2009
Springer
269views Algorithms» more  ASIAN 2009»
13 years 2 months ago
Noninterference with Dynamic Security Domains and Policies
Abstract. Language-based information flow analysis is used to statically examine a program for information flows between objects of different security domains, and to verify these ...
Robert Grabowski, Lennart Beringer
ASIAN
2009
Springer
274views Algorithms» more  ASIAN 2009»
13 years 5 months ago
Reducing Equational Theories for the Decision of Static Equivalence
Abstract. Static equivalence is a well established notion of indistinguishability of sequences of terms which is useful in the symbolic analysis of cryptographic protocols. Static ...
Steve Kremer, Antoine Mercier 0002, Ralf Treinen
ASIAN
2009
Springer
308views Algorithms» more  ASIAN 2009»
13 years 5 months ago
Automated Security Proof for Symmetric Encryption Modes
Abstract. We presents a compositional Hoare logic for proving semantic security of modes of operation for symmetric key block ciphers. We propose a simple programming language to s...
Martin Gagné, Pascal Lafourcade, Yassine La...
ASIAN
2009
Springer
299views Algorithms» more  ASIAN 2009»
13 years 5 months ago
Deducibility Constraints
In their work on tractable deduction systems, D. McAllester and later D. Basin and H. Ganzinger have identified a property of inference systems (the locality property) that ensures...
Sergiu Bursuc, Hubert Comon-Lundh, Stéphani...
ASIAN
2009
Springer
363views Algorithms» more  ASIAN 2009»
13 years 5 months ago
A Logic for Formal Verification of Quantum Programs
Abstract. This paper provides a Hoare-style logic for quantum computation. While the usual Hoare logic helps us to verify classical deterministic programs, our logic supports quant...
Yoshihiko Kakutani
ASIAN
2009
Springer
284views Algorithms» more  ASIAN 2009»
13 years 5 months ago
A Simulation-Based Treatment of Authenticated Message Exchange
Klaas Ole Kürtz, Henning Schnoor, Thomas Wilk...
ASIAN
2009
Springer
334views Algorithms» more  ASIAN 2009»
13 years 5 months ago
A Dolev-Yao Model for Zero Knowledge
In cryptographic protocols, zero knowledge proofs are employed for a principal A to communicate some non-trivial information t to B while at the same time ensuring that B cannot de...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh
ASIAN
2009
Springer
252views Algorithms» more  ASIAN 2009»
13 years 5 months ago
"Logic Wins!"
Abstract. Clever algorithm design is sometimes superseded by simple encodings into logic. We apply this motto to a few case studies in the formal verification of security propertie...
Jean Goubault-Larrecq