A novel framework for protocol analysis

Authors:
Kristian Gjøsteen;George Petrides;Asgeir Steine
Affiliations:
NTNU, Trondheim, Norway;NTNU, Trondheim, Norway;NTNU, Trondheim, Norway
Venue:
ProvSec'11 Proceedings of the 5th international conference on Provable security
Year:
2011

Citing 4
Cited 0

Foundations of Cryptography: Basic Tools

Foundations of Cryptography: Basic Tools
A Concrete Security Treatment of Symmetric Encryption

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
A Model for Asynchronous Reactive Systems and its Application to Secure Message Transmission

SP '01 Proceedings of the 2001 IEEE Symposium on Security and Privacy
Universally composable signcryption

EuroPKI'07 Proceedings of the 4th European conference on Public Key Infrastructure: theory and practice

Quantified Score

Hi-index	0.00

Visualization

Abstract

We describe a novel reformulation of Canetti's Universal Composability (UC) framework for the analysis of cryptographic protocols. Our framework is different mainly in that it is (a) based on systems of interactive Turing machines with a fixed communication graph and (b) augmented with a global message queue that allows the sending of multiple messages per activation. The first feature significantly simplifies the proofs of some framework results, such as the UC theorem, while the second can lead to more natural descriptions of protocols and ideal functionalities.