Relaxed Conditions for Secrecy in a Role-Based Specification

TL;DR

This paper introduces relaxed conditions for analyzing secrecy in role-based protocols, demonstrating that increasing protocols remain secure under these new criteria using specific security-estimating functions.

Contribution

It provides new, less restrictive conditions on functions and protocols to verify secrecy, expanding the applicability of security analysis methods.

Findings

Relaxed conditions ensure protocol secrecy with broader functions.

Increasing protocols are proven secure under these relaxed criteria.

The approach simplifies security verification for complex protocols.

Abstract

In this paper, we look at the property of secrecy through the growth of the protocol. Intuitively, an increasing protocol preserves the secret. For that, we need functions to estimate the security of messages. Here, we give relaxed conditions on the functions and on the protocol and we prove that an increasing protocol is correct when analyzed with functions that meet these conditions.