CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper introduces the use of static information flow analysis for the specification and enforcement of end-toend availability policies in programs. We generalize the decentr...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
Availability is a critical issue in modern distributed systems. While many techniques and protocols for preventing denial of service (DoS) attacks have been proposed and deployed ...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
To reason about information flow based on beliefs, a new model is developed that describes how attacker beliefs change due to the attacker’s observation of the execution of a p...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
Real computing systems sometimes need to forget sensitive information. This paper explores the specification and semantics of information erasure policies, which impose a strong,...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
This paper contrasts two existing type-based techniques for the analysis of authentication protocols. The former, proposed by Gordon and Jeffrey, uses dependent types for nonces a...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
A number of key establishment protocols claim the property of forward secrecy, where the compromise of a longterm key does not result in the compromise of previously computed sess...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
We develop a general method for proving properties of contract-signing protocols using a specialized protocol logic. The method is applied to the Asokan-ShoupWaidner and the Garay...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
We present the first cryptographically sound Dolev-Yaostyle security proof of a comprehensive electronic payment system. The payment system is a slightly simplified variant of t...
CSFW
2005
IEEE
14 years 5 months ago
2005
IEEE
We study an automatic technique for the verification of cryptographic protocols based on a Horn clause model of the protocol. This technique yields proofs valid for an unbounded ...