\documentclass[11pt]{article}
\setlength{\oddsidemargin}{0.0truein}
\setlength{\evensidemargin}{0.0truein}
\setlength{\textwidth}{6.5truein}
\setlength{\topmargin}{0.0truein}
\setlength{\textheight}{9.0truein} \setlength{\headsep}{0.0truein}
\setlength{\headheight}{0.0truein} \setlength{\topskip}{10.0pt}
\setlength{\parskip}{5mm}
\usepackage{url}
\begin{document}

\begin{center}
  \textbf{\textsc{STANFORD UNIVERSITY}}\\[5pt]
  \textbf{\textsc{DEPARTMENT OF STATISTICS}}\\[5pt]
  \Large{\textbf\textsc{{DEPARTMENTAL SEMINAR}}}
\end{center}

\begin{center}
  4:15 p.m., Tuesday, April 18, 2006\\
  Sequoia Hall Room 200\\
  (Cookies at 3:45 in 1st Floor Lounge)
\end{center}

\begin{center}
  \textsl{  Cynthia Dwork   }\\
        Microsoft Research, Silicon Valley
\end{center}

\begin{center}
  \textbf{  A cryptographer's perspective on privacy-preserving\\
data mining and statistical disclosure control  } 
\end{center}

\noindent
We revisit the problem of statistical disclosure control -- revealing accurate
statistics about a population while preserving the privacy of
individuals -- from a cryptographic perspective.

\noindent
We provide rigorous, well founded, definitions of privacy and explicit
characterizations of the capabilities of the adversary.  We then
describe a powerful technique for achieving privacy while preserving
utility of the data, together with impossibility results that guided
its development.

\end{document}