A Type System for Privacy Properties

Abstract : Mature push button tools have emerged for checking trace properties (e.g. secrecy or authentication) of security protocols. The case of indistinguishability-based privacy properties (e.g. ballot privacy or anonymity) is more complex and constitutes an active research topic with several recent propositions of techniques and tools. We explore a novel approach based on type systems and provide a (sound) type system for proving equivalence of protocols, for a bounded or an unbounded number of sessions. The resulting prototype implementation has been tested on various protocols of the literature. It provides a significant speed-up (by orders of magnitude) compared to tools for a bounded number of sessions and complements in terms of expressiveness other state-of-the-art tools, such as ProVerif and Tamarin: e.g., we show that our analysis technique is the first one to handle a faithful encoding of the Helios e-voting protocol in the context of an untrusted ballot box.
Document type :
Conference papers
Complete list of metadatas

Cited literature [56 references]  Display  Hide  Download

https://hal.inria.fr/hal-01626109
Contributor : Véronique Cortier <>
Submitted on : Monday, October 30, 2017 - 12:31:21 PM
Last modification on : Tuesday, December 18, 2018 - 4:38:25 PM
Long-term archiving on : Wednesday, January 31, 2018 - 12:40:03 PM

File

main-ccs.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01626109, version 1

Citation

Véronique Cortier, Niklas Grimm, Joseph Lallemand, Matteo Maffei. A Type System for Privacy Properties. CCS'17 - 24th ACM Conference on Computer and Communications Security, Oct 2017, Dallas, United States. pp.409 - 423. ⟨hal-01626109⟩

Share

Metrics

Record views

393

Files downloads

371