Probabilistic Non-Repudiation without Trusted Third Party
Olivier Markowitch, Yves Roggeman
Abstract
Olivier Markowitch, Yves Roggeman
Abstract
Abstract. We present a new theoretical generic protocol that offers non-repudiation services. We first go through the state of the art about non-repudiation. We will see that in order to achieve complete nonrepudiation during an information transfer a trusted third party is often needed (even playing a low weight role), obtaining an acknowledgement from the recipient being the current major problem. We aim to show the possibility of achieving fair non-repudiation services without the need of a third party. We will propose a concrete implementation inspired by this generic protocol. 1
OpenAlex reports 107 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract. We present a new theoretical generic protocol that offers non-repudiation services. We first go through the state of the art about non-repudiation. We will see that in order to achieve complete nonrepudiation during an information transfer a trusted third party is often needed (even playing a low weight role), obtaining an acknowledgement from the recipient being the current major problem. We aim to show the possibility of achieving fair non-repudiation services without the need of a third party. We will propose a concrete implementation inspired by this generic protocol. 1
Key concepts: Computer security, Probabilistic logic, Non-repudiation, Computer science, Third party, Internet privacy, Political science, Business