Sciweavers

CSFW
2009
IEEE
13 years 8 months ago
Cryptographic Protocol Synthesis and Verification for Multiparty Sessions
We present the design and implementation of a compiler that, given high-level multiparty session descriptions, generates custom cryptographic protocols. Our sessions specify pre-a...
Karthikeyan Bhargavan, Ricardo Corin, Pierre-Malo ...
CSFW
2009
IEEE
13 years 8 months ago
Specification and Analysis of Dynamic Authorisation Policies
This paper presents a language, based on transaction logic, for specifying dynamic authorisation policies, i.e., rules governing actions that may depend on and update the authoris...
Moritz Y. Becker
CSFW
2009
IEEE
13 years 8 months ago
Authentication without Elision: Partially Specified Protocols, Associated Data, and Cryptographic Models Described by Code
Specification documents for real-world authentication protocols typically mandate some aspects of a protocol's behavior but leave other features optional or undefined. In add...
Phillip Rogaway, Till Stegers
CSFW
2009
IEEE
13 years 8 months ago
Using ProVerif to Analyze Protocols with Diffie-Hellman Exponentiation
ProVerif is one of the most successful tools for cryptographic protocol analysis. However, dealing with algebraic properties of operators such as the exclusive OR (XOR) and Diffie-...
Ralf Küsters, Tomasz Truderung
CSFW
2009
IEEE
13 years 11 months ago
Universally Composable Symmetric Encryption
For most basic cryptographic tasks, such as public key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities...
Ralf Küsters, Max Tuengerthal
CSFW
2009
IEEE
13 years 11 months ago
ASPIER: An Automated Framework for Verifying Security Protocol Implementations
Abstract. We present aspier – the first framework that combines software model checking with a standard protocol security model to analyze authentication and secrecy properties ...
Sagar Chaki, Anupam Datta
CSFW
2009
IEEE
13 years 11 months ago
More Anonymous Onion Routing Through Trust
We consider using trust information to improve the anonymity provided by onion-routing networks. In particular, we introduce a model of trust in network nodes and use it to design...
Aaron Johnson, Paul F. Syverson
CSFW
2009
IEEE
13 years 11 months ago
Achieving Security Despite Compromise Using Zero-knowledge
One of the important challenges when designing and analyzing cryptographic protocols is the enforcement of security properties in the presence of compromised participants. This pa...
Michael Backes, Martin P. Grochulla, Catalin Hritc...
CSFW
2009
IEEE
13 years 11 months ago
Securing Timeout Instructions in Web Applications
Timeout mechanisms are a useful feature for web applications. However, these mechanisms need to be used with care because, if used as-is, they are vulnerable to timing attacks. Th...
Alejandro Russo, Andrei Sabelfeld