Simplified universal composability framework
2016 (English)In: 13th International Conference on Theory of Cryptography, TCC 2016, Springer, 2016, 566-595 p.Conference paper (Refereed)Text
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
Artificial intelligence, Computers, Adaptive adversary, Analysis of protocols, Authenticated channel, Composition theorem, Illustrated versions, Security frameworks, Universal composability, Universally Composable Security, Cryptography
IdentifiersURN: urn:nbn:se:kth:diva-181122DOI: 10.1007/978-3-662-49096-9_24ISI: 000376041100024ScopusID: 2-s2.0-84952690570ISBN: 9783662490952OAI: oai:DiVA.org:kth-181122DiVA: diva2:903743
13th International Conference on Theory of Cryptography, TCC 2016; Tel Aviv; Israel
QC 201602162016-02-162016-01-292016-06-10Bibliographically approved