diff --git a/bibfile.bib b/bibfile.bib
index 700d96f3f3b2af2c16ca9e11f49b125b5d1194d3..41837bab28a4fdb0f32d9fef776096f97c0a6539 100644
--- a/bibfile.bib
+++ b/bibfile.bib
@@ -1,241 +1,48 @@
-@article{Goldreich:1996:SPS:233551.233553,
- author = {Goldreich, Oded and Ostrovsky, Rafail},
- title = {Software Protection and Simulation on Oblivious RAMs},
- journal = {J. ACM},
- issue_date = {May 1996},
- volume = {43},
- number = {3},
- month = may,
- year = {1996},
- issn = {0004-5411},
- pages = {431--473},
- numpages = {43},
- url = {http://doi.acm.org/10.1145/233551.233553},
- doi = {10.1145/233551.233553},
- acmid = {233553},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {pseudorandom functions, simulation of random access machines, software protection},
-}
-
-@article{Chang:2016:ORD:2994509.2994528,
- author = {Chang, Zhao and Xie, Dong and Li, Feifei},
- title = {Oblivious RAM: A Dissection and Experimental Evaluation},
- journal = {Proc. VLDB Endow.},
- issue_date = {August 2016},
- volume = {9},
- number = {12},
- month = aug,
- year = {2016},
- issn = {2150-8097},
- pages = {1113--1124},
- numpages = {12},
- url = {http://dx.doi.org/10.14778/2994509.2994528},
- doi = {10.14778/2994509.2994528},
- acmid = {2994528},
- publisher = {VLDB Endowment},
-}
-
-@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 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},
- Title = {PHANTOM: Practical Oblivious Computation in a Secure Processor},
- School = {EECS Department, University of California, Berkeley},
- Year = {2014},
- Month = may,
- pages = {1--87},
- URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2014/EECS-2014-89.html},
- Number = {UCB/EECS-2014-89},
- Abstract = {
- Confidentiality of data is a major problem as sensitive computations migrate to the cloud.
- Employees in a data center have physical access to machines and can carry out attacks that have traditionally only affected client-side crypto-devices such as smartcards.
- For example, an employee can snoop confidential data as it moves in and out of the processor to learn secret keys or other program information that can be used for targeted attacks.
-
- Secure processors have been proposed as a counter-measure to these attacks --- such processors are physically shielded and enforce confidentiality by encrypting all data outside the chip, e.g. in DRAM or non-volatile storage.
- While first proposals were academic in nature, this model is now starting to appear commercially, such as in the Intel SGX extensions.
-
- Although secure processors encrypt all data as it leaves the CPU, the memory addresses that are being accessed in DRAM are still transmitted in plaintext on the address bus.
- This represents an important source of information leakage that enables serious attacks that can, in the worst case, leak bits of cryptographic keys.
- To counter such attacks, we introduce PHANTOM, a new secure processor that obfuscates its memory access trace.
- To an adversary who can observe the processor's output pins, all memory access traces are computationally indistinguishable (a property known as obliviousness).
- We achieve obliviousness through a cryptographic construct known as Oblivious RAM (ORAM).
-
- Existing ORAM algorithms introduce a large (100-200x) overhead in the amount of data moved from memory, which makes ORAM inefficient on real-world workloads.
- To tackle this problem, we develop a highly parallel ORAM memory controller to reduce ORAM memory access latency and demonstrate the design as part of the PHANTOM secure processor, implemented on a Convey HC-2ex.
- The HC-2ex is a system that comprises an off-the-shelf x86 CPU paired with 4 high-end FPGAs with a highly parallel memory system.
-
- Our novel ORAM controller aggressively exploits the HC-2ex's high DRAM bank parallelism to reduce ORAM access latency and scales well to a large number of memory channels.
- PHANTOM is efficient in both area and performance: accessing 4KB of data from a 1GB ORAM takes 26.2us (13.5us until the data is available), a 32x slowdown over accessing 4KB from regular memory, while SQLite queries on a population database see 1.2-6x slowdown.
- }
-}
-
-@inproceedings{Kellaris:2016:GAS:2976749.2978386,
- author = {Kellaris, Georgios and Kollios, George and Nissim, Kobbi and O'Neill, Adam},
- title = {Generic Attacks on Secure Outsourced Databases},
- booktitle = {Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security},
- series = {CCS '16},
- year = {2016},
- isbn = {978-1-4503-4139-4},
- location = {Vienna, Austria},
- pages = {1329--1340},
- numpages = {12},
- url = {http://doi.acm.org/10.1145/2976749.2978386},
- doi = {10.1145/2976749.2978386},
- acmid = {2978386},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {generic attacks, secure outsourced databases},
-}
-
-@inproceedings{Naveed:2015:IAP:2810103.2813651,
- author = {Naveed, Muhammad and Kamara, Seny and Wright, Charles V.},
- title = {Inference Attacks on Property-Preserving Encrypted Databases},
- booktitle = {Proceedings of the 22Nd ACM SIGSAC Conference on Computer and Communications Security},
- series = {CCS '15},
- year = {2015},
- isbn = {978-1-4503-3832-5},
- location = {Denver, Colorado, USA},
- pages = {644--655},
- numpages = {12},
- url = {http://doi.acm.org/10.1145/2810103.2813651},
- doi = {10.1145/2810103.2813651},
- acmid = {2813651},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {deterministic encryption, encrypted databases, inference attacks, order-preserving encryption, property-preserving encryption},
-}
-
-@inproceedings{Dautrich:2013:CPP:2452376.2452397,
- author = {Dautrich,Jr., Jonathan L. and Ravishankar, Chinya V.},
- title = {Compromising Privacy in Precise Query Protocols},
- booktitle = {Proceedings of the 16th International Conference on Extending Database Technology},
- series = {EDBT '13},
- year = {2013},
- isbn = {978-1-4503-1597-5},
- location = {Genoa, Italy},
- pages = {155--166},
- numpages = {12},
- url = {http://doi.acm.org/10.1145/2452376.2452397},
- doi = {10.1145/2452376.2452397},
- acmid = {2452397},
- publisher = {ACM},
- address = {New York, NY, USA},
-}
-
-@inbook{Shi:2011,
- author = {Shi, Elaine and Chan, T. -H. Hubert and Stefanov, Emil and Li, Mingfei},
- title = {Oblivious RAM with ${O}( \log^3 {N} )$ Worst-Case Cost},
- bookTitle = {Advances in Cryptology -- ASIACRYPT 2011: 17th International Conference on the Theory and Application of Cryptology and Information Security, Seoul, South Korea, December 4-8, 2011. Proceedings},
- year = {2011},
- publisher = {Springer Berlin Heidelberg},
- address = {Berlin, Heidelberg},
- pages = {197--214},
- abstract = {
- Oblivious RAM is a useful primitive that allows a client to hide its data access patterns from an untrusted server in storage outsourcing applications.
- Until recently, most prior works on Oblivious RAM aim to optimize its amortized cost, while suffering from linear or even higher worst-case cost.
- Such poor worst-case behavior renders these schemes impractical in realistic settings, since a data access request can occasionally be blocked waiting for an unreasonably large number of operations to complete.
- },
- isbn = {978-3-642-25385-0},
- doi = {10.1007/978-3-642-25385-0_11},
- url = {https://doi.org/10.1007/978-3-642-25385-0_11}
-}
-
-@article{DBLP:journals/corr/abs-1106-3652,
- author = {Emil Stefanov and Elaine Shi and Dawn Song},
- title = {Towards Practical Oblivious {RAM}},
- journal = {CoRR},
- volume = {abs/1106.3652},
- year = {2011},
- url = {http://arxiv.org/abs/1106.3652},
- archivePrefix = {arXiv},
- eprint = {1106.3652},
- pages = {1--40},
- timestamp = {Wed, 07 Jun 2017 14:40:50 +0200},
- biburl = {http://dblp.org/rec/bib/journals/corr/abs-1106-3652},
- bibsource = {dblp computer science bibliography, http://dblp.org}
-}
-
-@inbook{Gentry:2013,
- author = {Gentry, Craig and Goldman, Kenny A. and Halevi, Shai and Julta, Charanjit and Raykova, Mariana and Wichs, Daniel},
- title = {Optimizing ORAM and Using It Efficiently for Secure Computation},
- bookTitle = {Privacy Enhancing Technologies: 13th International Symposium, PETS 2013, Bloomington, IN, USA, July 10-12, 2013. Proceedings},
- year = {2013},
- publisher = {Springer Berlin Heidelberg},
- address = {Berlin, Heidelberg},
- pages = {1--18},
- abstract = {
- Oblivious RAM (ORAM) allows a client to access her data on a remote server while hiding the access pattern (which locations she is accessing) from the server.
- Beyond its immediate utility in allowing private computation over a client's outsourced data, ORAM also allows mutually distrustful parties to run secure-computations over their joint data with sublinear on-line complexity.
- In this work we revisit the tree-based ORAM of Shi et al. and show how to optimize its performance as a stand-alone scheme, as well as its performance within higher level constructions.
- },
- isbn = {978-3-642-39077-7},
- doi = {10.1007/978-3-642-39077-7_1},
- url = {https://doi.org/10.1007/978-3-642-39077-7_1}
-}
-
-@article{DBLP:journals/corr/abs-1105-4125,
- author = {Michael T. Goodrich and Michael Mitzenmacher and Olga Ohrimenko and Roberto Tamassia},
- title = {Privacy-Preserving Group Data Access via Stateless Oblivious {RAM} Simulation},
- journal = {CoRR},
- volume = {abs/1105.4125},
- year = {2011},
- url = {http://arxiv.org/abs/1105.4125},
- archivePrefix = {arXiv},
- eprint = {1105.4125},
- timestamp = {Wed, 07 Jun 2017 14:41:08 +0200},
- biburl = {http://dblp.org/rec/bib/journals/corr/abs-1105-4125},
- bibsource = {dblp computer science bibliography, http://dblp.org}
-}
-
-@inproceedings{Fletcher:2012:SPA:2382536.2382540,
- author = {Fletcher, Christopher W. and Dijk, Marten van and Devadas, Srinivas},
- title = {A Secure Processor Architecture for Encrypted Computation on Untrusted Programs},
- booktitle = {Proceedings of the Seventh ACM Workshop on Scalable Trusted Computing},
- series = {STC '12},
- year = {2012},
- isbn = {978-1-4503-1662-0},
- location = {Raleigh, North Carolina, USA},
- pages = {3--8},
- numpages = {6},
- url = {http://doi.acm.org/10.1145/2382536.2382540},
- doi = {10.1145/2382536.2382540},
- acmid = {2382540},
- publisher = {ACM},
- address = {New York, NY, USA},
- keywords = {encrypted computation, secure processors},
-}
-
-@phdthesis{fletcher2013ascend,
- title={Ascend: An architecture for performing secure computation on encrypted data},
- author={Fletcher, Christopher Wardlaw},
- year={2013}
-}
-
-@article{ren2013design,
- title={Design space exploration and optimization of path oblivious ram in secure processors},
- author={Ren, Ling and Yu, Xiangyao and Fletcher, Christopher W and Van Dijk, Marten and Devadas, Srinivas},
- journal={ACM SIGARCH Computer Architecture News},
- volume={41},
- number={3},
- pages={571--582},
- year={2013},
- publisher={ACM}
+@misc{bu-code,
+ author = {Boston University},
+ title = {{Academic Conduct Code}},
+ howpublished = "\url{https://www.bu.edu/academics/policies/academic-conduct-code/}",
+ year = {2018},
+ note = "[Online; accessed 06-February-2019]"
+}
+
+@misc{plagiarism-org-definition,
+ author = {plagiarism.org},
+ title = {{What is Plagiarism?}},
+ howpublished = "\url{http://www.plagiarism.org/article/what-is-plagiarism}",
+ year = {2017},
+ note = "[Online; accessed 06-February-2019]"
+}
+
+@misc{wiki-plagiarism,
+ author = {Wikipedia community},
+ title = {{Plagiarism}},
+ howpublished = "\url{https://en.wikipedia.org/wiki/Plagiarism}",
+ year = {2018},
+ note = "[Online; accessed 06-February-2019]"
+}
+
+@misc{bcc,
+ author = {Bereley City College},
+ title = {{What is academic dishonesty?}},
+ howpublished = "\url{http://www.berkeleycitycollege.edu/wp/de/what-is-academic-dishonesty/}",
+ year = {2018},
+ note = "[Online; accessed 06-February-2019]"
+}
+
+@misc{dishonesty-paper,
+ author = {Lars R. Jones},
+ title = {{Academic Integrity \& Academic Dishonesty: A Handbook About Cheating \& Plagiarism}},
+ howpublished = "\url{http://web2.fit.edu/current/documents/plagiarism.pdf}",
+ year = {2011},
+ note = "[Online; accessed 06-February-2019]"
+}
+
+@misc{plagiarism-org-preventing,
+ author = {plagiarism.org},
+ title = {{Preventing Plagiarism when Writing}},
+ howpublished = "\url{http://www.plagiarism.org/article/preventing-plagiarism-when-writing}",
+ year = {2017},
+ note = "[Online; accessed 06-February-2019]"
}
diff --git a/sections/all-sections.tex b/sections/all-sections.tex
index d105c34fcf91d0cd0afbe6f56598d355090ebb3d..082383166331f4353fa1fac7bb706482a6f01187 100644
--- a/sections/all-sections.tex
+++ b/sections/all-sections.tex
@@ -1,11 +1,15 @@
% cSpell:ignore DBLP
-\begin{frame}{Disclaimer}
+\begin{frame}{Disclaimers}
\begin{alertblock}{Disclaimer}
Academic dishonesty in any form is strongly discouraged!
\end{alertblock}
+ \begin{alertblock}{Disclaimer}
+ As a member of academic community (and especially as Teaching Fellow) your obligated to report any academic misconduct.
+ \end{alertblock}
+
\end{frame}
\section{Intro}
@@ -35,7 +39,7 @@
\begin{block}{Definition}
\textbf{Academic dishonesty} or academic misconduct is \emph{any} type of cheating that occurs in relation to a formal academic exercise.\blfootnote{
- \url{http://www.berkeleycitycollege.edu/wp/de/what-is-academic-dishonesty/}
+ Cited from~\cite{bcc}.
}
\end{block}
@@ -55,7 +59,7 @@
\item[Sabotage]
Acting to prevent others from completing their work.
\end{description}\blfootnote{
- \url{http://www.berkeleycitycollege.edu/wp/de/what-is-academic-dishonesty/}
+ Cited from~\cite{bcc}.
}
\end{frame}
@@ -66,7 +70,7 @@
\begin{block}{Definition}
Representing the work of another as one’s own.\blfootnote{
- \url{https://www.bu.edu/academics/policies/academic-conduct-code/}
+ Cited from~\cite{bu-code}.
}
\end{block}
@@ -74,7 +78,7 @@
\begin{frame}{Plagiarism}
- Includes, but not limited to
+ Includes but is not limited to
\begin{itemize}
\item
@@ -85,12 +89,12 @@
Copying so many words or ideas from a source that it makes up the majority of your work, whether you give credit or not
\item
Giving incorrect information about the source of a quotation
+ \item
+ More elegant: giving URL to not working, password-protected or paid resource
\item
$\ldots$
\end{itemize}\blfootnote{
- \url{http://www.plagiarism.org/article/what-is-plagiarism}
- }\blfootnote{
- \url{https://en.wikipedia.org/wiki/Plagiarism\#Common\_forms\_of\_student\_plagiarism}
+ Cited from~\cite{plagiarism-org-definition},~\cite{wiki-plagiarism} and~\cite{dishonesty-paper}.
}
\end{frame}
@@ -108,6 +112,12 @@
Copyrighted material
\item
Paraphrasing
+ \item
+ Wikipedia
+ \begin{itemize}
+ \item
+ In most cases, Wikipedia itself is not an original source
+ \end{itemize}
\item
$\ldots$
\end{itemize}
@@ -140,7 +150,56 @@
\item
$\ldots$
\end{itemize}\blfootnote{
- \url{http://www.plagiarism.org/article/preventing-plagiarism-when-writing}
+ Cited from~\cite{plagiarism-org-preventing}.
}
\end{frame}
+
+\section{Fabrication}
+
+ \begin{frame}{Fabrication}
+
+ \begin{block}{Definition}
+ \textbf{Misrepresentation or falsification of data} presented for surveys, experiments, reports, etc.\blfootnote{
+ Cited from~\cite{bu-code}.
+ }
+
+ Includes but is not limited to
+
+ \begin{itemize}
+ \item
+ Citing authors that do not exist
+ \item
+ Citing interviews that never took place
+ \item
+ Citing field work that was not completed
+ \item
+ Manual fitting of experiment result to obtain sound conclusions
+ \begin{itemize}
+ \item
+ case later in the presentation
+ \end{itemize}
+ \end{itemize}
+
+ \end{block}
+
+ \end{frame}
+
+ \begin{frame}{Fabrication}
+
+ Preventing fabrication
+
+ \begin{itemize}
+ \item
+ Consult with your instructor
+ \item
+ Clearly explain all aspects of the experiment, survey, etc.
+ \item
+ Replicate your experiment and make sure other people can replicate it as well
+ \item
+ $\ldots$
+ \end{itemize}
+
+ \end{frame}
+
+