A Type System for Privacy Properties - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A Type System for Privacy Properties

(1, 2) , (3) , (2, 1) , (3)
1
2
3

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.
Fichier principal
Vignette du fichier
main-ccs.pdf (731.57 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01626109 , version 1 (30-10-2017)

Identifiers

  • HAL Id : hal-01626109 , version 1

Cite

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⟩
403 View
364 Download

Share

Gmail Facebook Twitter LinkedIn More