The Full Abstraction of the UC Framework
TLDR
In this article, the Universal Composability framework (UC) is shown to be equivalent to security in the probabilistic polynomial time calculus ppc. Security is defined under active and adaptive adversaries with synchronous and authenticated communication.Abstract:
Two different approaches for general protocol security are proved equivalent. Concretely, we prove that security in the Universal Composability framework (UC) is equivalent to security in the probabilistic polynomial time calculus ppc. Security is defined under active and adaptive adversaries with synchronous and authenticated communication. In detail, we define an encoding from machines in UC to processes in ppc and show UC is fully abstract in ppc, i.e., we show the soundness and completeness of security in ppc with respect to UC. However, we restrict security in ppc to be quantified not over all possible contexts, but over those induced by UC-environments under encoding. This result is not overly-restricting security in ppc, since the threat and communication models we assume are meaningful in both practice and theory.read more
References
More filters
Proceedings ArticleDOI
Universally composable security: a new paradigm for cryptographic protocols
TL;DR: The notion of universally composable security was introduced in this paper for defining security of cryptographic protocols, which guarantees security even when a secure protocol is composed of an arbitrary set of protocols, or more generally when the protocol is used as a component of a system.
Journal ArticleDOI
The knowledge complexity of interactive proof systems
TL;DR: A computational complexity theory of the “knowledge” contained in a proof is developed and examples of zero-knowledge proof systems are given for the languages of quadratic residuosity and 'quadratic nonresiduosity.
Book
Foundations of Cryptography: Basic Tools
TL;DR: This book presents a rigorous and systematic treatment of the foundational issues of cryptography: defining cryptographic tasks and solving new cryptographic problems using existing tools, focusing on the basic mathematical tools: computational difficulty, pseudorandomness and zero-knowledge proofs.
Proceedings ArticleDOI
Composition and integrity preservation of secure reactive systems
Birgit Pfitzmann,Michael Waidner +1 more
TL;DR: This work proves two important properties of this definition, preservation of integrity and secure composition: first, a secure real system satisfies all integrity requirements that are satisfied by the ideal system, and if a composed system is designed using an ideal subsystem, it will remain secure if a securereal subsystem is used instead.
Proceedings ArticleDOI
A probabilistic poly-time framework for protocol analysis
TL;DR: A framework for analyzing security protocols in which protocol adversaries may be arbitrary probabilistic polynomial-time processes is developed, using an asymptotic notion of Probabilistic equivalence to polynometric-time statistical tests and discusses some example protocols to illustrate the potential strengths of this approach.