Change search
ReferencesLink to record
Permanent link

Direct link
Simplified universal composability framework
KTH, School of Computer Science and Communication (CSC), Theoretical Computer Science, TCS.ORCID iD: 0000-0003-4157-1371
2016 (English)In: 13th International Conference on Theory of Cryptography, TCC 2016, Springer, 2016, 566-595 p.Conference paper (Refereed)Text
Abstract [en]

We introduce a simplified universally composable (UC) security framework in our thesis (2005). In this paper we present an updated more comprehensive and illustrated version. The introduction of our simplified model is motivated by the difficulty to describe and analyze concrete protocols in the full UC framework due to its generality and complexity. The main differences between our formalization and the general UC security framework are that we consider: a fixed number of parties, static corruption, and simple ways to bound the running times of the adversary and environment. However, the model is easy to extend to adaptive adversaries. Authenticated channels become a trivial ideal functionality. We generalize the framework to allow protocols to securely realize other protocols. This allows a natural and modular description and analysis of protocols. We introduce invertible transforms of models that allow us to reduce the proof of the composition theorem to a simple special case and transform any hybrid protocol into a hybrid protocol with at most one ideal functionality. This factors out almost all of the technical details of our framework to be considered when relating our framework to any other security framework, e.g., the UC framework, and makes this easy.

Place, publisher, year, edition, pages
Springer, 2016. 566-595 p.
, Lecture Notes in Computer Science, ISSN 0302-9743 ; 9562
Keyword [en]
Artificial intelligence, Computers, Adaptive adversary, Analysis of protocols, Authenticated channel, Composition theorem, Illustrated versions, Security frameworks, Universal composability, Universally Composable Security, Cryptography
National Category
Computer Science
URN: urn:nbn:se:kth:diva-181122DOI: 10.1007/978-3-662-49096-9_24ISI: 000376041100024ScopusID: 2-s2.0-84952690570ISBN: 9783662490952OAI: diva2:903743
13th International Conference on Theory of Cryptography, TCC 2016; Tel Aviv; Israel

QC 20160216

Available from: 2016-02-16 Created: 2016-01-29 Last updated: 2016-06-10Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopus

Search in DiVA

By author/editor
Wikström, Douglas
By organisation
Theoretical Computer Science, TCS
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Altmetric score

Total: 23 hits
ReferencesLink to record
Permanent link

Direct link