fmouhart/thesis
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Corrections David

Browse Source
This commit is contained in:
Fabrice Mouhartem
2018-08-19 16:07:38 -07:00
parent 13474a1adb
commit 44f65c6f6c
9 changed files with 16 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
sec-pairings.tex
View File

@ -34,7 +34,7 @@ The advantages of the best $\ppt$ adversary against $\DDH$ in group $\GG$ and $\
In \cref{ch:sigmasig}, the security of our group signature scheme relies on the $\SXDH$ assumption, which is a well-studied assumption.
Moreover, this assumption is static, meaning that the size of the assumption is independent of the number of queries made py the adversary or any feature (e.g., the maximal number of users) of the system, and is non-interactive, in the sense that it does not involve any oracle.
This gives us stronger confidente in the security of schemes proven under this kind of assumptions.
This gives us stronger confidence in the security of schemes proven under this kind of assumptions.
For instance, Cheon gave an attack against the $q$-Strong Diffie-Hellmann problem for large values of $q$~\cite{Che06} (which usually represents the number of adversarial queries).
In \cref{ch:sigmasig}, we also rely on the following assumption, which generalizes the Discrete Logarithm problem to asymmetric groups.