Rewriting Privacy

DOI10.1007/978-3-031-12441-9_2MaRDI QIDQ6487293zbMATH OpenFDO

Authors Sebastian Mödersheim

Publication date 7 December 2022

Mathematics Subject Classification ID

Cryptography (94A60) Privacy of data (68P27)

Recommendations

• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• Defining privacy is supposed to be easy
• Privacy by typing in the \(\pi\)-calculus
• Analysing privacy-type properties in cryptographic protocols (invited talk)
• Differential Privacy and Security

Cites work

• A practical secret voting scheme for large scale elections
• A procedure for deciding symbolic equivalence between sets of constraint systems
• A rewriting-based inference system for the NRL protocol analyzer and its meta-logical properties
• A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols
• Automated verification of selected equivalences for security protocols
• Equivalence properties by typing in cryptographic branching protocols
• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy
• Private authentication
• Programming Languages and Systems
• The Hitchhiker's guide to decidability and complexity of equivalence properties in security protocols

Cited in

(2)

• Defining privacy is supposed to be easy
• Formalizing and proving privacy properties of voting protocols using alpha-beta privacy

This page was built for publication: Rewriting Privacy

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