From 092e6092ef231f5be02ff518568fd0b23ad08715 Mon Sep 17 00:00:00 2001 From: Daira Hopwood Date: Wed, 27 May 2020 17:20:27 +0100 Subject: [PATCH] Remove the claim that Discrete Logarithm Independence is stronger than collision resistance of GroupHash. (That's not clearly true, and it's irrelevant.) Signed-off-by: Daira Hopwood --- protocol/protocol.tex | 3 +-- 1 file changed, 1 insertion(+), 2 deletions(-) diff --git a/protocol/protocol.tex b/protocol/protocol.tex index 2d3e5af5..1f67b0b8 100644 --- a/protocol/protocol.tex +++ b/protocol/protocol.tex @@ -3862,8 +3862,7 @@ not return $\bot$) as a random oracle. \item Under the Discrete Logarithm assumption on $\SubgroupG{}$, a random oracle almost surely satisfies Discrete Logarithm Independence. Discrete Logarithm Independence implies \collisionResistance\!, since a collision $(m_1, m_2)$ for $\GroupGHash{\URS}$ trivially gives a - discrete logarithm relation with $x_1 = 1$ and $x_2 = -1$. It is in fact - stronger than \collisionResistance\!. + discrete logarithm relation with $x_1 = 1$ and $x_2 = -1$. \item $\GroupJHash{}$ is also used to instantiate $\DiversifyHash$ in \crossref{concretediversifyhash}. We do not know how to prove the Unlinkability property defined in that section in the standard model, but in a model where $\GroupJHash{}$ (restricted to