Sciweavers

Share
CONCUR
2003
Springer

Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus

9 years 7 months ago
Composition of Cryptographic Protocols in a Probabilistic Polynomial-Time Process Calculus
We describe a probabilistic polynomial-time process calculus for analyzing cryptographic protocols and use it to derive compositionality properties of protocols in the presence of computationally bounded adversaries. We illustrate these concepts on oblivious transfer, an example from cryptography. We also compare our approach with a framework based on interactive Turing machines.
Paulo Mateus, John C. Mitchell, Andre Scedrov
Added 06 Jul 2010
Updated 06 Jul 2010
Type Conference
Year 2003
Where CONCUR
Authors Paulo Mateus, John C. Mitchell, Andre Scedrov
Comments (0)
books