changeset 287:3a3fff5f2120

Comment on UC
author Sigurd Meldgaard <stm@daimi.au.dk>
date Mon, 12 Apr 2010 12:41:15 +0200
parents cb46dc43b950
children be824362c376
files provsec/paper.tex
diffstat 1 files changed, 5 insertions(+), 1 deletions(-) [+]
line wrap: on
line diff
--- a/provsec/paper.tex	Mon Apr 12 12:38:16 2010 +0200
+++ b/provsec/paper.tex	Mon Apr 12 12:41:15 2010 +0200
@@ -77,7 +77,11 @@
 $n_A=1000$, say, then $A$ knows that $0< n_B\leq 1000$, but $A$ should
 learn nothing further about $n_B$.
 
-We model this using the Universal Composability (UC) framework of Canetti \cite{canetti00}.
+We model this using the Universal Composability (UC) framework of
+Canetti \cite{canetti00}. This means that we specify exactly what
+knowledge we want to be public (the ideal world), and then verify that
+only information that can be derived directly from this is ever
+made available to an adversary.
 
 A secure MPC protocol is often implemented by having
 players exchange values that are encrypted or by other means hidden,