Description
The applied pi-calculus is a powerful framework to model protocols and to define security properties. In this symbolic model, it is possible to verify automatically complex security properties such as strong secrecy, anonymity and unlinkability properties which are based on equivalence of processes.
In this talk, we will see an overview of a verification method used by a tool, Akiss. The tool is able to handle ?- a wide range of cryptographic primitives (in particular AKISS is the only tool able to verify equivalence properties for protocols that use xor); ?- protocols with else branches (the treatment of disequalities is often complicated). ?We will also provide some insights on how interleaving due to concurrency can be effectively handled.
Prochains exposés
-
Users Pay Twice: The Hidden Energy Cost of Web Advertising
Orateur : Samuel Pélissier - CentraleSupélec
Advertisements are everywhere on the Web: search engines promote results, most websites display ads, some require users to accept ads as a condition for access, video streaming services fund their infrastructure through an increasing volume of ads, and much of the gaming industry has adopted ad-based revenue models. In exchange for free access to a wide range of content, web users sacrifice their[…]-
Privacy
-