2007•Journal of Computer ApplicationsRequires access

Non-repudiation protocols model based on first-order logic

Zhu Yu-na

Abstract

In order to analyze the non-repudiation and fairness properties under one frame, a set of first-order logic syntax and semantics for non-repudiation protocols was proposed, and a model was built. The Zhou-Gollmann fair non-repudiation protocol was analyzed with the model and a known attack to the protocol was found. The results show that our model is valid and correct.

About this research paper

What this paper is about

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Non-repudiation, Computer science, Protocol (science), Programming language, Frame (networking), Syntax, Set (abstract data type), Semantics (computer science)