• kth.se
  • Student web
  • Intranet
  • kth.se
  • Student web
  • Intranet
Login
DD2496/FDD3344HT211
Reading: Provable Privacy (before group presentation 14/10/21, 10-12h)
Skip to content
Dashboard
  • Login
  • Dashboard
  • Calendar
  • Inbox
  • History
  • Help
Close
  • Min översikt
  • DD2496/FDD3344HT211
  • Assignments
  • Reading: Provable Privacy (before group presentation 14/10/21, 10-12h)
  • Home
  • Syllabus
  • Modules
  • Assignments
  • Course Evaluation

Reading: Provable Privacy (before group presentation 14/10/21, 10-12h)

  • Due 14 Oct 2021 by 9:59
  • Points None
  • Available after 1 Sep 2021 at 8:00

Provable Privacy

Required Reading:

  • Why do we need provable privacy? Easy to read blog post introducing the
    field of research.
    Kaafar, Dali, et al. "From Probably Private to Provable Privacy: On the
    Need for Rigorous Privacy Treatment for data-driven organisations."
    Optus Macquarie University Cyber Security Hub, 4 Mar 2019,
    (html Links to an external site.)
  • Longer paper, but first half is a repetition of things already discussed
    in class. Then discusses formal methods that could be used to verify
    privacy properties, and challenges with these approaches.
    Tschantz, Michael Carl, and Jeannette M. Wing. "Formal Methods for
    Privacy." FM 2009: Formal Methods, Lecture Notes in Computer Science,
    vol 5850, Springer, 2009, pp 1–15.
    (pdf) Links to an external site.

 

 

Optional:

  • Formal definition of privacy goals in the context of anonymous
    communication. (And winner of best student paper award Links to an external site., presented when PETS was at KTH)
    Kuhn, Christiane, et al. "On Privacy Notions in Anonymous
    Communication." Proceedings on Privacy Enhancing Technologies 2,
    Sciendo, 2019, pp 105–125.
    (pdf) Links to an external site.
  • Using behavioural equivalences to analyse privacy properties of e.g.
    RFID protocols.
    Delaune, Stéphanie. "Analysing Privacy-Type Properties in Cryptographic
    Protocols." 3rd International Conference on Formal Structures for
    Computation and Deduction, Leibniz International Proceedings in
    Informatics 108, Leibniz-Zentrum fuer Informatik, 2018, pp 1–20.
    (pdf) Links to an external site.

 

 

1634198399 10/14/2021 09:59am
Please include a description
Additional comments:
Rating max score to > Pts
Please include a rating title

Rubric

 
 
 
 
 
 
 
     
Can't change a rubric once you've started using it.  
Find a rubric
Find rubric
Please include a title
Title
You've already rated students with this rubric. Any major changes could affect their assessment results.
Title
Criteria Ratings Pts
Edit criterion description Delete criterion row
This criterion is linked to a learning outcome Description of criterion
threshold: 5 pts
Edit rating Delete rating
5 to >0 Pts
Full marks
blank
Edit rating Delete rating
0 to >0 Pts
No marks
blank_2
This area will be used by the assessor to leave comments related to this criterion.
pts
  / 5 pts
--
Additional comments
Edit criterion description Delete criterion row
This criterion is linked to a learning outcome Description of criterion
threshold: 5 pts
Edit rating Delete rating
5 to >0 Pts
Full marks
blank
Edit rating Delete rating
0 to >0 Pts
No marks
blank_2
This area will be used by the assessor to leave comments related to this criterion.
pts
  / 5 pts
--
Additional comments
Total points: 5 out of 5