The Full Abstraction of the UC Framework (ResearchIndex)

See this document in CiteSeerX!

The Full Abstraction of the UC Framework (2005) (Make Corrections)
Jesus Almansa

View or download:
iacr.org/2005/019.pdf
Cached: PS.gz PS PDF Image Update Help

From: iacr.org/complete/ (more)
(Enter author homepages)

Rate this article:

(best)
Comment on this article

(Enter summary)
Abstract: 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 it is fully abstract with respect to UC-security and ppc-security, i.e., we show a protocol is UC-secure i# its encoding is ppc-secure. However, we restrict ... (Update)

Active bibliography (related documents): More All
2.1: The Full Abstraction of the UC Framework - Almansa (2004) (Correct)
0.2: On the Relationships between Notions of.. - Datta, Küsters.. (2006) (Correct)
0.2: Conditional Reactive Simulatability - Backes, Dürmuth, Hofheinz, Küsters (2006) (Correct)

Similar documents based on text: More All
0.1: On the Limitations of Universally Composable Two-Party .. - Canetti, Kushilevitz, .. (2004) (Correct)
0.1: Modeling Insider Attacks on Group Key-Exchange Protocols - Katz, Shin (2005) (Correct)
0.1: MOGUL: A Methodology to Obtain Genetic fuzzy.. -.. (1998) (Correct)

BibTeX entry: (Update)

@misc{ almansa-full,
  author = "Jesus Almansa",
  title = "The Full Abstraction of the UC Framework",
  url = "citeseer.ist.psu.edu/article/almansa05full.html" }