Defining privacy is supposed to be easy

DOI10.1007/978-3-642-45221-5_41MaRDI QIDQ2870157zbMATH OpenOpenAlexFDO

Authors Sebastian Mödersheim, Thomas Groß, Luca Viganò

Publication date 17 January 2014

Published in Logic for Programming, Artificial Intelligence, and Reasoning (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-45221-5_41

Mathematics Subject Classification ID

Logic in computer science (03B70) Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• Rewriting Privacy
• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• Privacy by typing in the -calculus
• Type checking privacy policies in the -calculus
• A formal model of data privacy

Cited in

(5)

• Constructing independently verifiable privacy-compliant type systems for message passing between black-box components
• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• Type checking privacy policies in the -calculus
• Privacy by typing in the -calculus
• Rewriting Privacy

This page was built for publication: Defining privacy is supposed to be easy

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870157)