Events

Filter by:

Limit to events where the first date of the event:
Date range
Limit to events where the first date of the event:
Limit to events where the title matches:
Limit to events where the type is one or more of:
Limit to events tagged with one or more of:
Limit to events where the audience is one or more of:
Wednesday, March 28, 2018 10:30 am - 10:30 am EDT (GMT -04:00)

Seminar • Cryptography, Security, and Privacy — Breaking Cryptographic Barriers

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.

Wednesday, April 4, 2018 1:30 pm - 1:30 pm EDT (GMT -04:00)

PhD Seminar • Algorithms and Complexity: Succinct Color Searching in One Dimension

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]$.

Thomas Steinke, Postdoctoral researcher
IBM Almaden Research Center

As data is being more widely collected and used, privacy and statistical validity are becoming increasingly difficult to protect. Sound solutions are needed, as ad hoc approaches have resulted in several high-profile failures.

Maryam Mehri Dehvani
Department of Electrical and Computer Engineering, Rutgers University

The emergence of stupendously large matrices in applications such as data mining and large-scale scientific simulations has rendered the classical software frameworks and numerical methods inadequate in many situations. In this talk, I will demonstrate how building domain-specific compilers and reformulating classical mathematical methods significantly improve the performance and scalability of large-scale applications on modern computing platforms.