Performance modelling of optimistic fair exchange

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper we explore the overhead introduced by secure functions in considering a case study in non-repudiation. We present a model of an optimistic fair exchange protocol specified using the Markovian process algebra PEPA and present results derived using a fluid approximation and stochastic simulation. This system poses an interesting performance problem in that the degree of overhead of the protocol is depended on the degree of misbehaviour by the participants.

Cite

CITATION STYLE

APA

Zhao, Y., & Thomas, N. (2016). Performance modelling of optimistic fair exchange. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9845 LNCS, pp. 298–313). Springer Verlag. https://doi.org/10.1007/978-3-319-43904-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free