Non-repudiation analysis using LySa with annotations

TL;DR: This chapter addresses the scenario in which a consumer may be reluctant to move his private data to the cloud because of existing vulnerabilities and presents an overview of security issues and a framework that supports a fair data transmission procedure without the risk of dispute.

TL;DR: This work introduces a formal analysis of the non-repudiation property for security protocols, modelled in the process calculus LySa, using an extended syntax with annotations.

TL;DR: This book is unique in providing an overview of the four major approaches to program analysis: data flow analysis, constraint-based analysis, abstract interpretation, and type and effect systems.

TL;DR: The goals of privacy and non-malleability are considered, each under chosen plaintext attack and two kinds of chosen ciphertext attack, and a new definition of non-Malleability is proposed which the author believes is simpler than the previous one.

TL;DR: This paper explores ways in which security properties may be described as CSP specifications, how security mechanisms may be captured, and how particular protocols designed to provide these properties May be analysed within the CSP framework.

TL;DR: The paper applies the theory of communicating sequential processes (CSP) to the modelling and analysis of a non-repudiation protocol and highlights some novel considerations that are required for this kind of protocol.