diff --git a/.vscode/settings.json b/.vscode/settings.json
index 889090c012737e9f0a8dc0b210ab129c04303486..2d17d198ba51562fa5a0837d0d9855ceb7510e3c 100644
--- a/.vscode/settings.json
+++ b/.vscode/settings.json
@@ -1,4 +1,8 @@
 {
+	"cSpell.ignoreRegExpList": [
+		"\\\\\\w*(\\[.*?\\])?(\\{.*?\\})?",
+		"\\$.+?\\$"
+	],
 	"cSpell.words": [
 		"Bogatov",
 		"Burkard",
diff --git a/bibfile.bib b/bibfile.bib
index c716fea7f10ddefb276926b6196597f6c8ca5ede..6c932ec7136cdbfde9baaeade91255465baa8129 100644
--- a/bibfile.bib
+++ b/bibfile.bib
@@ -37,20 +37,23 @@
 	publisher = {VLDB Endowment},
 } 
 
-@article{DBLP:journals/corr/abs-1202-5150,
-	author    = {Emil Stefanov and Elaine Shi},
-	title     = {Path {O-RAM:} An Extremely Simple Oblivious {RAM} Protocol},
-	journal   = {CoRR},
-	volume    = {abs/1202.5150},
-	year      = {2012},
-	pages = {1--25},
-	url       = {http://arxiv.org/abs/1202.5150},
-	archivePrefix = {arXiv},
-	eprint    = {1202.5150},
-	timestamp = {Wed, 07 Jun 2017 14:40:19 +0200},
-	biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1202-5150},
-	bibsource = {dblp computer science bibliography, http://dblp.org}
-}
+@inproceedings{Stefanov:2013:POE:2508859.2516660,
+	author = {Stefanov, Emil and van Dijk, Marten and Shi, Elaine and Fletcher, Christopher and Ren, Ling and Yu, Xiangyao and Devadas, Srinivas},
+	title = {Path ORAM: An Extremely Simple Oblivious RAM Protocol},
+	booktitle = {Proceedings of the 2013 ACM SIGSAC Conference on Computer \&\#38; Communications Security},
+	series = {CCS '13},
+	year = {2013},
+	isbn = {978-1-4503-2477-9},
+	location = {Berlin, Germany},
+	pages = {299--310},
+	numpages = {12},
+	url = {http://doi.acm.org/10.1145/2508859.2516660},
+	doi = {10.1145/2508859.2516660},
+	acmid = {2516660},
+	publisher = {ACM},
+	address = {New York, NY, USA},
+	keywords = {access pattern, oblivious ram, oram, path oram},
+} 
 
 @mastersthesis{Maas:EECS-2014-89,
     Author = {Maas, Martin},
diff --git a/sections/appendix.tex b/sections/appendix.tex
index 55b00fd9f466d0a92efaa53b848eadaead88b7bd..87745001953e1a7370cb4a93a328772206ba712b 100644
--- a/sections/appendix.tex
+++ b/sections/appendix.tex
@@ -15,7 +15,7 @@
 		
 	\end{center}
 
-	Figure 3 from~\cite{DBLP:journals/corr/abs-1202-5150}.
+	Figure 3 from~\cite{Stefanov:2013:POE:2508859.2516660}.
 
 \end{frame}
 
@@ -47,7 +47,7 @@
 
 	\end{center}
 
-	Figure 5 from~\cite{DBLP:journals/corr/abs-1202-5150}.
+	Figure 5 from~\cite{Stefanov:2013:POE:2508859.2516660}.
 
 \end{frame}
 
@@ -66,6 +66,6 @@
 
 	\end{center}
 
-	Figure 4 from~\cite{DBLP:journals/corr/abs-1202-5150}.
+	Figure 4 from~\cite{Stefanov:2013:POE:2508859.2516660}.
 
 \end{frame}
diff --git a/sections/conclusion.tex b/sections/conclusion.tex
index 192789a5f39d295823a80d39536d55eef4627510..b46899e480e830f23487908c54a903d9ab0cb65a 100644
--- a/sections/conclusion.tex
+++ b/sections/conclusion.tex
@@ -8,7 +8,7 @@
 
 			Partly due to its simplicity, PathORAM is the most practical ORAM scheme known-to-date under a small amount of client storage.
 			We formally prove asymptotic bounds on PathORAM, and show that its performance is competitive with or asymptotically better than the best known construction (for a small amount of client storage), assuming reasonably large block sizes. 
-			We also present simulation results that confirm our theoretic bounds.~\cite{DBLP:journals/corr/abs-1202-5150}
+			We also present simulation results that confirm our theoretic bounds.~\cite{Stefanov:2013:POE:2508859.2516660}
 
 		\end{quote}
 
diff --git a/sections/oblivious-memory.tex b/sections/oblivious-memory.tex
index 4dcf867a93642ad12fd42b4ad0b3ba9160995ccf..e26888ce373b5c758e6d64919bad935b8b1619f0 100644
--- a/sections/oblivious-memory.tex
+++ b/sections/oblivious-memory.tex
@@ -32,7 +32,7 @@
 			Which records are accessed only after some other records were touched.
 			How often read vs write operations occur.
 
-			Talk about~\cite{Dautrich:2013:CPP:2452376.2452397} paper.
+			Talk about~\textcite{Dautrich:2013:CPP:2452376.2452397} paper.
 		}
 	\end{frame}
 
diff --git a/settings.tex b/settings.tex
index 006b0da2c222dee72091fdea4a4445a42f6f72ac..f93192234eeb3a0c7942d95cdc546efa73673f2a 100644
--- a/settings.tex
+++ b/settings.tex
@@ -7,8 +7,9 @@
 \title{Data-X Talk} % chktex 13
 
 \subtitle{
-	Path ORAM:\ An Extremely Simple Oblivious RAM Protocol by \emph{Emil Stefanov} and \emph{Elaine Shi} \\
-	\cite{DBLP:journals/corr/abs-1202-5150} % chktex 2
+	Path ORAM:\ An Extremely Simple Oblivious RAM Protocol \\
+	{\small by \emph{Emil Stefanov}, \emph{Elaine Shi}, \emph{Marten van Dijk}, \emph{Christopher Fletcher}, \emph{	Ling Ren}, \emph{Xiangyao Yu} and \emph{Srinivas Devadas}} \\
+	\cite{Stefanov:2013:POE:2508859.2516660} % chktex 2
 }
 
 \date{Built from \href{https://git.dbogatov.org/bu/PathORAM-Talk/commit/\version}{\emph{\version}} on \today}