Sciweavers

719 search results - page 119 / 144
» Proving Security Protocols Correct
Sort
View
TYPES
2004
Springer
15 years 3 months ago
A Machine-Checked Formalization of the Random Oracle Model
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...
Gilles Barthe, Sabrina Tarento
ICALP
2003
Springer
15 years 2 months ago
Secrecy in Untrusted Networks
We investigate the protection of migrating agents against the untrusted sites they traverse. The resulting calculus provides a formal framework to reason about protection policies ...
Michele Bugliesi, Silvia Crafa, Amela Prelic, Vlad...
ASIAN
2006
Springer
91views Algorithms» more  ASIAN 2006»
15 years 1 months ago
A Type-Theoretic Framework for Formal Reasoning with Different Logical Foundations
Abstract. A type-theoretic framework for formal reasoning with different logical foundations is introduced and studied. With logic-enriched type theories formulated in a logical fr...
Zhaohui Luo
FSE
2006
Springer
121views Cryptology» more  FSE 2006»
15 years 1 months ago
The Ideal-Cipher Model, Revisited: An Uninstantiable Blockcipher-Based Hash Function
The Ideal-Cipher Model of a blockcipher is a well-known and widely-used model dating back to Shannon [24] and has seen frequent use in proving the security of various cryptographi...
John Black
MOBIHOC
2006
ACM
15 years 9 months ago
MLS: : an efficient location service for mobile ad hoc networks
MLS is a distributed location service to track the position of mobile nodes and to route messages between any two nodes. The lookup of nodes is achieved by searching in a hierarch...
Roland Flury, Roger Wattenhofer