\documentclass[landscape]{slides}
\begin{document}
\begin{slide}
\begin{center}
The Free Haven Project\\
Distributed Anonymous Storage Service\\
\vspace{.8in}
Roger Dingledine, MIT\\
Michael Freedman, MIT\\
David Molnar, Harvard
\end{center}
\end{slide}

\begin{slide}
\begin{center}
Differences from Freenet
\begin{itemize}
\item Content-neutral
\item Focus on storage and persistence
\item Stronger anonymity?
\end{itemize}
\end{center}
\end{slide}

\begin{slide}
\begin{center}
Kinds of Anonymity
\end{center}
\begin{itemize}
\item Publisher should not be known
\item Readers should not be identified
\item Location of documents unknown
\item Server deniability
\item Private information retrieval
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Other Aspects of Anonymity
\end{center}
\begin{itemize}
\item Linkability: Anonymity vs Pseudonymity
\item Partial anonymity
\item Computational vs Information-Theoretic Anonymity
\item Perfect Forward Anonymity
\item Formal models
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Some Requirements
\begin{itemize}
\item Robust (k of n reconstruction)
\item Content-neutral
\item Configuration preferences set by each node operator
\item Free/Opensource
\end{itemize}
\end{center}
\end{slide}

\begin{slide}
\begin{center}
Some related works
\end{center}
\begin{itemize}
\item Gnutella
\item Freenet
\item Publius
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Supported operations
\end{center}
\begin{itemize}
\item Inserting (Information Dispersal algorithms)
\item Expiring (expiration chosen at publication)
\item Trading (currency)
\item Retrieving (via public key for document)
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Reasons for trading
\end{center}
\begin{itemize}
\item Publisher anonymity
\item Dynamic (easy to join/exit)
\item Longer expiration dates
\item Accomodates ethical concerns
\item Difficult to track shares
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Trading Protocol
\end{center}
\begin{itemize}
\item Simplicity vs Accountability (fair exchange protocol, third party)
\item Four-message exchange:
\begin{itemize}
\item Two to exchange shares
\item Two to exchange receipts
\end{itemize}
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Accountability
\end{center}
\begin{itemize}
\item Shepherd system (one fixed share, one roving)
\item Buddy system (both shares roving)
\item Receipts
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Trust Network
\end{center}
\begin{itemize}
\item Broadcast opinions (or changes in opinions)
\item Believe broadcasts based on trust
\item Accept trades based on trust
\item Only risk as much as you've already gained
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Mixnet
\end{center}
\begin{itemize}
\item Mixmaster III (SMTP)
\item Low-latency onion-routing
\item `Meeting' servers, keyservers, other extension ideas
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Open Problems
\end{center}
\begin{itemize}
\item Ideal mixnet
\item Accountability and trust algebra
\item Modelling and metrics
\item Formal definitions of anonymity
\item Convenient/useful interfaces
\end{itemize}
\end{slide}

\begin{slide}
\begin{center}
Conclusion
\end{center}
\begin{itemize}
\item Implementation
\item Legal issues/Education
\item No systems are good enough yet
\end{itemize}
\end{slide}
\end{document}