We give efficient protocols and matching accuracy lower bounds for frequency estimation in
the local model for differential privacy. In this model, individual users randomize their data …

We present new practical local differentially private heavy hitters algorithms achieving
optimal or near-optimal worst-case error--TreeHist and Bitstogram. In both algorithms, server …

We provide formal definitions and efficient secure techniques for turning biometric
information into keys usable for any cryptographic application, and reliably and securely …

We provide formal definitions and efficient secure techniques for turning noisy information
into keys usable for any cryptographic application, and, in particular, reliably and securely …

Efficient join processing is one of the most fundamental and well-studied tasks in database
research. In this work, we examine algorithms for natural join queries over many relations …

The Handbook of Linear Algebra provides comprehensive coverage of linear algebra
concepts, applications, and computational software packages in an easy-to-use handbook …

We present a new locally differentially private algorithm for the heavy hitters problem that
achieves optimal worst-case error as a function of all standardly considered parameters …

Abstract Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the
client to store a file F on an untrusted server, and later run an efficient audit protocol in which …

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

We study the design of cryptographic primitives resilient to key-leakage attacks, where an
attacker can repeatedly and adaptively learn information about the secret key, subject only …