Seminar Privacy and Authenticity of Data
News
- You may be interested in our Seminar FAQ
Dates and Times
The following is the time table of the seminar. The exact dates of the talks will be published on a later date.
When |
| What | Misc |
|---|---|---|---|
03.04. |
| Confirm participation | |
| 10.04 |
| Submit topic preferences |
|
13.04 |
| Assignment of topics | |
| 08.06. | Submission of the initial essay and talk video | ||
| 29.06. |
| Submission of peer reviews (essays and talks) |
|
| 17.07. |
| Submission of final essay |
|
Overview
For the seminar, you will have to write an essay, two reviews of essays other students wrote, and give a talk about your topic. After receiving the peer reviews of your essay you will have the option to make changes to your paper to incorporate the reviews (this is not mandatory).
Your overall grade will be composed of individual grades for you initial essay submission, your presentation, the reviews you wrote, and how well you incorporated reviews into your final submission.
Seminar Topics
- Optimal differentially private mechanisms for randomised response
- Optimal Differentially Private Algorithms for k-Means Clustering
- Privacy Preserving Collaborative Filtering via the Johnson-Lindenstrauss Transform
- Differential Privacy for Collaborative Filtering Recommender Algorithm
- Integrity Protection for Revision Control
- Balloon: A Forward-Secure Append-Only Persistent Authenticated Data Structure
- Transparancy Logs via Append-Only Authenticated Dictionaries
- Authenticated Hash Tables
- How to Authenticate Graphs Without Leaking
- Optimal Verification of Operations on Dynamic Sets
- Efficient Fork-Linearizable Access to Untrusted Shared Memory
- Foundations of Group Signatures: Formal Definitions, Simplified Requirements, and a Construction Based on General Assumptions
- Short Group Sinatures
- Protecting Privacy Against Location-Based Personal Identification
- Protocols for Checking Compromised Credentials
- MemGuard: Defending against Black-Box Membership Inference Attacks via Adversarial Examples
- Trading Accumulation Size for Witness Size: A Merkle Tree Based Universal Accumulator Via Subset Differences
- Octopus: A Secure and Anonymous DHT Lookup
- Updatable Oblivious Key Management for Storage Systems
- Zero-Knowledge Sets with short proofs