Symbolic Universal Composability

Author

Bohl, Florian ; Unruh, Dominique

Author_Institution

KIT, Karlsruhe, Germany

fYear

2013

fDate

26-28 June 2013

Firstpage

257

Lastpage

271

Abstract

We introduce a variant of the Universal Composability framework (UC; Canetti, FOCS 2001) that uses symbolic cryptography. Two salient properties of the UC framework are secure composition and the possibility of easily defining security by giving an ideal functionality as specification. These advantages are now also available in a symbolic modeling of cryptography, allowing for a modular analysis of complex protocols. We furthermore introduce a new technique for modular design of protocols that uses UC but avoids the need for powerful cryptographic primitives that often comes with UC protocols; this "virtual primitives" approach is unique to the symbolic setting and has no counterpart in the original computational UC framework.

Keywords

cryptographic protocols; UC protocols; complex protocol modular analysis; computational UC framework; cryptography symbolic modeling; symbolic universal composability framework; virtual primitives; Calculus; Computational modeling; Context; Cryptography; Mathematical model; Protocols; observational equivalence; security definitions; symbolic security models; universal composability;

fLanguage

English

Publisher

ieee

Conference_Titel

Computer Security Foundations Symposium (CSF), 2013 IEEE 26th

Conference_Location

New Orleans, LA

Type

conf

DOI

10.1109/CSF.2013.24

Filename

6595833