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.

• Type: Conference
• Year: 2003
• Where: CONCUR
• Authors: Paulo Mateus, John C. Mitchell, Andre Scedrov
• Keywords: CONCUR 2003, Cryptographic Protocols, Interactive Turing Machines, Probabilistic Polynomial-time Process