CS573 Data Security and Privacy

Midterm Exam Review




1.     The exam is open book and open notes.

2.     You have the full class period (75 minutes).

3.     The format is short answer questions testing the concepts and techniques we covered in the lectures and assigned readings.




Differential Privacy

-        Traditional anonymization notions

o   k-anonymity

o   l-diversity

o   t-closeness

-        Basic definition of differential privacy

o   Neighboring databases

o   Composition (sequential and parallel)

-        Basic mechanisms

o   Laplace mechanism

o   Exponential mechanism

o   Building more complex algorithms via composition

-        Histogram applications with differential privacy

o   Basic Laplace mechanism

o   Partitioning based algorithms

o   Evaluation metrics (absolute and relative error for count queries)

-        Frequent pattern mining with differential privacy

o   Nave algorithm with Laplace mechanism

o   Sampling based algorithms

o   Evaluation metrics (precision and recall, relative error)

-        Other settings of differential privacy

o   Local differential privacy, randomized response mechanism, and applications in RAPPOR

o   Location perturbation, differential privacy with constrained neighborhood (location set)

o   Data streams, sampling based algorithms


Secure multiparty computation

-        Basic cryptography

o   Symmetric encryption

o   Public key encryption

-        Secure multiparty computation definition

o   Semi-honest model vs malicious model

o   Simulation based security definition

o   Composition theorem

-        General constructions

o   Oblivious transfer

o   Secret sharing scheme

o   Oblivious circuit evaluation

o   Zero knowledge proof (wont be tested)

-        Specialized protocols

o   Secure sum

o   Secure union

o   Building more complex protocols via composition


Secure outsourcing

-        Basic cryptography tools

o   Homomorphic encryption

o   Partially homomorphic encryption (additive and multiplicative)

-        Protocols based on partially homomorphic encryption

o   Two server setting

o   Secure multiplication

o   Building more complex protocols via composition

-        Order preserving encryption

o   CryptDB architecture