Privacy Preserving Algorithms and Data Security

1. Credits and contact hours: 3 credits, 3 contact hours
2. Instructor’s or course coordinator’s name: 
3. Text book, title, author, and year: None required
4. Other supplemental materials: None

Specific course information

1. Brief description of the content of the course: Fundamentals of privacy preserving algorithms, data security, anonymization, and techniques and mechanisms to minimize disclosure of sensitive information while maintaining availability. Theory and fundamentals underpinning measures to evaluate the privacy and availability of data; implementation and deployment of privacy-preserving data operations including pre- and post-randomization techniques, homomorphisms, and secure function evaluation protocols. Theory and practice of the algorithmic limits on data privacy, including the cost in terms of time and space complexity.
2. Prerequisites or co-requisites: COM S 311
3. Required, elective, or selected elective? Selected Elective

Specific goals for the course

1. Specific outcomes of instruction:

• An ability to analyze a complex computing problem and to apply principles of computing to identify solutions (1)
• An ability to apply computer science theory and software development fundamentals to produce computing-based solutions (6)

Brief list of topics to be covered

• Fundamentals of privacy preserving algorithms