Seminar • Data Systems — Leave No Trace: Personal Data with Provable Privacy Guarantees
Xi He, PhD candidate
Computer Science Department, Duke University
Xi He, PhD candidate
Computer Science Department, Duke University
Dakshita Khurana, PhD candidate
Department of Computer Science, UCLA
Can we provably immunize protocols against coordinated attacks on the internet? Can we verify that computation is performed correctly while preserving the privacy of underlying data? Can we enable mutually distrusting participants to securely compute on distributed private data?
These are some of the core challenges that lie at the heart of modern cryptography and secure protocol design.
Chengnian Sun, Software Engineer
Google Inc., Mountain View, USA
Feng-Xuan Choo, PhD candidate
David R. Cheriton School of Computer Science
Hicham El-Zein, PhD candidate
David R. Cheriton School of Computer Science
We present succinct data structures for one-dimensional color reporting and color counting problems. We are given a set of $n$ points with integer coordinates in the range $[1,m]$ and every point is assigned a color from the set $\{\,1,\ldots,\sigma\,\}$. A color reporting query asks for the list of distinct colors that occur in a query interval $[a,b]$ and a color counting query asks for the number of distinct colors in $[a,b]$.
Thad Starner, School of Interactive Computing
Georgia Institute of Technology
Edward Zulkoski, PhD candidate
David R. Cheriton School of Computer Science
Edward Zulkoski, PhD candidate
David R. Cheriton School of Computer Science
Xiao-Bo Li, PhD candidate
David R. Cheriton School of Computer Science
Xiao-Bo Li, PhD candidate
David R. Cheriton School of Computer Science