AFGH is actually m-of-m

shankarganesh-pj · Jul 11, 2017 · 99e9b94 · 99e9b94
1 parent 1f17390
commit 99e9b94
Showing 1 changed file with 2 additions and 2 deletions.
diff --git a/kms-whitepaper.tex b/kms-whitepaper.tex
@@ -270,9 +270,9 @@ \subsection{Split-key re-encryption}
 Imagine that a re-encryption node decides to re-encrypt data immediately rather than to apply conditional policies as instructed.
 A split-key proxy re-encryption scheme can be used to solve this problem.
 
-Instead of one re-encryption key, m-of-n re-encryption keys can be used to produce ``re-encryption shares''.
+Instead of one re-encryption key, m-of-m re-encryption keys can be used to produce ``re-encryption shares''.
 These shares can be combined client-side.
-An m-of-n scheme exists for AFGH~\cite{AFGH} encryption.
+An m-of-m scheme exists for AFGH~\cite{AFGH} encryption.
 A ``collusion'' attack here would require $m$ miners \emph{and} the reader of the data.
 
 A threshold-based m-of-n scheme, to be published by NICS Labs, appears to be the most appropriate for this task.