Sciweavers

117 search results - page 9 / 24
» Concurrent general composition of secure protocols in the ti...
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
13 years 10 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
FSTTCS
2009
Springer
14 years 1 months ago
Simulation based security in the applied pi calculus
We present a symbolic framework for refinement and composition of security protocols. ework uses the notion of ideal functionalities. These are abstract systems which are secure b...
Stéphanie Delaune, Steve Kremer, Olivier Pe...
CSFW
2004
IEEE
13 years 10 months ago
Symmetric Encryption in a Simulatable Dolev-Yao Style Cryptographic Library
Recently we showed how to justify a Dolev-Yao type model of cryptography as used in virtually all automated protocol provers under active attacks and in arbitrary protocol environ...
Michael Backes, Birgit Pfitzmann
ENTCS
2006
145views more  ENTCS 2006»
13 years 6 months ago
Real-or-random Key Secrecy of the Otway-Rees Protocol via a Symbolic Security Proof
We present the first cryptographically sound security proof of the well-known Otway-Rees protocol. More precisely, we show that the protocol is secure against arbitrary active att...
Michael Backes
JNW
2006
149views more  JNW 2006»
13 years 6 months ago
Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes
Mobile ad hoc network (MANET) has been generally regarded as an ideal network model for group communications because of its specialty of instant establishment. However, the securit...
Shidi Xu, Yi Mu, Willy Susilo