Privacy as Reachability

We show that privacy can be formalized as a reachability problem. We introduce a transaction-process formalism for distributed systems that can exchange cryptographic messages (in a black-box cryptography model). Our formalism includes privacy variables chosen non-deterministically from finite domai...

Full description

Saved in:
Bibliographic Details
Published in2022 IEEE 35th Computer Security Foundations Symposium (CSF) pp. 130 - 146
Main Authors Gondron, Sebastien, Modersheim, Sebastian, Vigano, Luca
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2022
Subjects
DP-3T
Formal Methods
Grounding
Linkability
Manuals
Privacy
Probabilistic logic
Protocol security
Protocols
Roads
Transition system
Turing machines
Online AccessGet full text

Cover

More Information
Summary:We show that privacy can be formalized as a reachability problem. We introduce a transaction-process formalism for distributed systems that can exchange cryptographic messages (in a black-box cryptography model). Our formalism includes privacy variables chosen non-deterministically from finite domains (e.g., candidates in a voting protocol), it can work with long-term mutable states (e.g., a hash-key chain) and allows one to specify consciously released information (e.g., number of votes and the result). We discuss examples, e.g., problems of linkability, and the core of the privacy-preserving proximity tracing system DP-3T.
DOI:10.1109/CSF54842.2022.9919668