
handle: 11562/990568 , 11576/1892515
AbstractWe advocate the use of approximate noninterference for the security analysis of probabilistic protocols. Our approach relies on a formalisation of the protocol in the setting of a probabilistic process algebra and a notion of process similarity based on weak probabilistic bisimulation. We illustrate this approach by presenting the analysis of a probabilistic nonrepudiation protocol which allows us to quantitatively estimate its fairness degree.
Approximate Noninterference, Process Equivalence, Case Study, Approximate Noninterference, Process Equivalence, Probabilistic Process Algebra, Probabilistic Process Algebra, Theoretical Computer Science, Computer Science(all)
Approximate Noninterference, Process Equivalence, Case Study, Approximate Noninterference, Process Equivalence, Probabilistic Process Algebra, Probabilistic Process Algebra, Theoretical Computer Science, Computer Science(all)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 4 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
