summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
authorGuillermo Ramos2015-07-16 13:21:19 +0200
committerGuillermo Ramos2015-07-16 15:34:37 +0200
commit767d837a06e7102d26ba70322a68170e64e9cba1 (patch)
treeb3fdc264121c8a288510283c7bafba298e925b15
parent946a1dcdce00d4a350fee92ae4931300e6170719 (diff)
downloadtfm-767d837a06e7102d26ba70322a68170e64e9cba1.tar.gz
Synchronized with Copy dir
-rwxr-xr-xfrom-copy.sh4
-rw-r--r--tfm.pdfbin305752 -> 266913 bytes
-rwxr-xr-xtfm.tex51
-rwxr-xr-xto-copy.sh3
4 files changed, 55 insertions, 3 deletions
diff --git a/from-copy.sh b/from-copy.sh
index 79c0f36..434698d 100755
--- a/from-copy.sh
+++ b/from-copy.sh
@@ -1,6 +1,6 @@
#!/bin/bash
-COPY_D="${HOME}/Copy/work/tfm"
+COPY_D="${HOME}/Copy/univ/master/tfm"
cp -r ${COPY_D}/*.tex ${COPY_D}/Makefile ${COPY_D}/bib.bib .
-cp -r ${COPY_D}/portada/*.tex portada/
+cp -r ${COPY_D}/front/*.tex front/
diff --git a/tfm.pdf b/tfm.pdf
index 62ab0b3..9881909 100644
--- a/tfm.pdf
+++ b/tfm.pdf
Binary files differ
diff --git a/tfm.tex b/tfm.tex
index 4840bdc..3dc078a 100755
--- a/tfm.tex
+++ b/tfm.tex
@@ -90,10 +90,52 @@ understand EasyCrypt and implement bla bla bla)
\pagenumbering{arabic}
\setcounter{page}{1}
+In the last years, society is becoming ever more dependent on computer
+systems. People manage their bank accounts via web, are constantly in touch with
+their contacts thanks to instant messaging applications, and have huge amounts
+of personal data stored in the \textit{cloud}. All this personal information
+flowing through computer networks need to be protected by correctly implementing
+adequate security measures regarding both information transmission and
+storage. Building strong security systems is not an easy task, because there are
+lots of parts that must be studied in order to assure the system as a whole
+behaves as intended.
+
+One of the most fundamental tools used to build security computer systems is
+\textbf{cryptography}. Due to its heavy mathematical roots, cryptography today
+is a mature science that, when correctly implemented, can provide strong
+security guarantees to the systems using it. In fact, it is usually the case
+that cryptography is one of the \textit{most secure} parts of the system, and a
+lot of other concerns should be taken care of, such as underlying operating
+systems, security policies, or the human factor.
+
+At this point, one could be tempted of just ``using strong, NIST-approved
+cryptography'' and focusing on the security of other parts of the system. The
+reality is that correctly implementing cryptography is a pretty difficult task
+on its own, mainly because there is not a one-size-fits-all construction that
+covers all security requirements. Every cryptographic primitive has its own
+security assumptions and guarantees, so one must be exceptionally cautious when
+combining them in order to build larger systems. For example, a given
+cryptographic construction could be well suited for a concrete scenario and
+totally useless in some others. In turn, this situation can produce a false
+sense of security, potentially worse that not having any security at all.
+
+In order to have the best guarantee that some cryptographic construction meets
+its security requirements, we can use use formal methods to prove that the
+requirements follow from the assumptions (scenario).
+
+(TODO: maybe a sub-section on sequences of games, Hoare logic, etc.)
+
\section{Problem} %%
+(TODO: Need of Computer-assisted proofs)
+
+
+\subsection{EasyCrypt}
+
+(TODO: What is EasyCrypt (Coq-like, screens, etc))
+
\section{Contributions} %%
@@ -149,6 +191,15 @@ ciphertext ($C$).
\section{Sequences of games} %%
+While mathematical proofs greatly enhance the confidence we have in that a given
+cryptosystem behaves as expected, with the recent increase in complexity it has
+become more and more difficult to write and verify the proofs by hand, to the
+point of being practically non-viable. In 2004 \cite{Shoup04}, Victor Shoup
+introduced the concept of \textbf{sequences of games} as a method of taming the
+complexity of cryptography related proofs. A game is like a program written in a
+well-defined, probabilistic programming language, and a sequence of games is the
+result of applying transformations over the initial one.
+
\section{Verification: EasyCrypt} %%
diff --git a/to-copy.sh b/to-copy.sh
index d5fd2c1..9c665bf 100755
--- a/to-copy.sh
+++ b/to-copy.sh
@@ -1,5 +1,6 @@
#!/bin/bash
-COPY_D="${HOME}/Copy/work/tfm"
+COPY_D="${HOME}/Copy/univ/master/tfm"
cp -r *.tex Makefile bib.bib ${COPY_D}/
+cp -r front/*.tex ${COPY_D}/front/