325 search results - page 20 / 65 » Concurrent Composition of Secure Protocols in the Timing Mod... |
CRYPTO
2006
Springer
14 years 8 days ago
2006
Springer
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
ESAS
2006
Springer
14 years 8 days ago
2006
Springer
We investigate the performance of of several protocol enhancements to the On-Demand Secure Byzantine Routing (ODSBR) [3] protocol in the presence of various Byzantine Attack models...
APN
2007
Springer
14 years 2 months ago
2007
Springer
Asynchronous data communication mechanisms (ACMs) have been extensively studied as data connectors between independently timed concurrent processes. In previous work, an automatic ...
CSFW
2004
IEEE
14 years 10 days ago
2004
IEEE
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...
SP
2009
IEEE
14 years 3 months ago
2009
IEEE
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...