zenon/applied-cryptography
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Add solution for 1h

Browse Source
This commit is contained in:
Tobias Eidelpes 2022-06-14 11:53:30 +02:00
parent 0f66d8ec3e
commit 47904c27e6
1 changed files with 8 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
exam/ex.tex
View File

@ -81,7 +81,14 @@
$E$ is not present if the adversary is nonce-respecting. Additionally, the $E$ is not present if the adversary is nonce-respecting. Additionally, the
distinguisher is computationally unbounded and never repeats a query. distinguisher is computationally unbounded and never repeats a query.
\item \TODO \item The practical relevance is high, in my opinion. This is due to the
fact that the EWCDM construction is secure against nonce-misusing
adversaries up to the birthday bound. It has been shown that implementing
nonces securely is a difficult task. If a scheme is easily broken by wrong
handling of nonces, there is no \emph{fallback} security guarantee. The
EWCDM construction, however, provides such a \emph{fallback} security
guarantee and is of high practical relevance.
\item \TODO \item \TODO
\item \TODO \item \TODO
\item \TODO \item \TODO