Sciweavers

128 search results - page 8 / 26
» Cryptographically sound implementations for typed informatio...
Sort
View
CSFW
2007
IEEE
14 years 16 days ago
Automaton-based Confidentiality Monitoring of Concurrent Programs
Noninterference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checking of noni...
Gurvan Le Guernic
TGC
2007
Springer
14 years 2 months ago
Computational Soundness of Equational Theories (Tutorial)
Abstract. We study the link between formal and cryptographic models for security protocols in the presence of passive and adaptive adversaries. We first describe the seminal resul...
Steve Kremer
ASIAN
2006
Springer
153views Algorithms» more  ASIAN 2006»
14 years 10 days ago
Automata-Based Confidentiality Monitoring
Abstract Non-interference is typically used as a baseline security policy to formalize confidentiality of secret information manipulated by a program. In contrast to static checkin...
Gurvan Le Guernic, Anindya Banerjee, Thomas P. Jen...
CSFW
2007
IEEE
14 years 2 months ago
Computationally Sound Mechanized Proofs of Correspondence Assertions
We present a new mechanized prover for showing correspondence assertions for cryptographic protocols in the computational model. Correspondence assertions are useful in particular...
Bruno Blanchet
CSFW
2005
IEEE
14 years 2 months ago
Computational and Information-Theoretic Soundness and Completeness of Formal Encryption
We consider expansions of the Abadi-Rogaway logic of indistinguishability of formal cryptographic expressions. We expand the logic in order to cover cases when partial information...
Pedro Adão, Gergei Bana, Andre Scedrov