Sciweavers

46 search results - page 3 / 10
» Computational Soundness of Formal Indistinguishability and S...
Sort
View
LPAR
2007
Springer
14 years 1 months ago
Deciding Knowledge in Security Protocols for Monoidal Equational Theories
Abstract. In formal approaches, messages sent over a network are usually modeled by terms together with an equational theory, axiomatizing the properties of the cryptographic funct...
Véronique Cortier, Stéphanie Delaune
ECBS
2000
IEEE
115views Hardware» more  ECBS 2000»
13 years 12 months ago
Discrete Event System Specification (DEVS) and StateMate StateCharts Equivalence for Embedded Systems Modeling
Recently, modeling has received a lot of attention in the design of embedded computing systems. StateCharts is one of the modeling specifications which has been successfully imple...
Stephan Schulz II, T. C. Ewing, Jerzy W. Rozenblit
POPL
2004
ACM
14 years 7 months ago
A bisimulation for dynamic sealing
We define seal, an untyped call-by-value -calculus with primitives for protecting abstract data by sealing, and develop a bisimulation proof method that is sound and complete with...
Eijiro Sumii, Benjamin C. Pierce
LICS
2007
IEEE
14 years 1 months ago
A Complete Axiomatization of Knowledge and Cryptography
The combination of first-order epistemic logic and formal cryptography offers a potentially very powerful framework for security protocol verification. In this article, we addre...
Mika Cohen, Mads Dam
GC
2004
Springer
14 years 28 days ago
Verifying a Structured Peer-to-Peer Overlay Network: The Static Case
Abstract. Structured peer-to-peer overlay networks are a class of algorithms that provide efficient message routing for distributed applications using a sparsely connected communic...
Johannes Borgström, Uwe Nestmann, Luc Onana A...