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

chap: -> ch:

Browse Source
This commit is contained in:
Fabrice Mouhartem
2018-02-16 15:54:03 +01:00
parent 4521358a63
commit df47d3b441
3 changed files with 13 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
chap-proofs.tex
View File

@ -1,4 +1,4 @@
\chapter{Security Proofs in Cryptography} \label{chap:proofs}
\chapter{Security Proofs in Cryptography} \label{ch:proofs}
Provable security is a subfield of cryptography where constructions are proven secure with regards to a security model.
To illustrate this notion, let us take the example of public-key encryption schemes.
@ -111,7 +111,7 @@ an attack is successful if the probability that it succeed is noticeable.
Once that we define the notions related to the core of the proof, we have to define the objects on what we work on.
Namely, defining what we want to prove, and the hypotheses on which we rely, also called ``hardness assumption''.
The details of the hardness assumptions we use are given in Chapter~\ref{chap:structures}.
The details of the hardness assumptions we use are given in Chapter~\ref{ch:structures}.
Nevertheless, some notions are common to these and are evoked here.
The confidence one can put in a hardness assumption depends on many criteria.