Theorem-proving anonymity of infinite-state systems

Kawabe, Yoshishige; Mano, Ken; Sakurada, Hideki; Tsukada, Yasuyuki

doi:10.1016/j.ipl.2006.06.016

Cited by 14 publications

(22 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We have extended the simulation-based proof method [13,12] for non-deterministic anonymity to apply to the notion of probabilistic anonymity defined in [4]. For the move we have exploited a generic theory of traces and simulations [9,10] in which the difference between non-determinism and probability is just a different choice of a parameter.…”

Section: Discussionmentioning

confidence: 99%

“…Hence our adversary has less observation power than one in [1] for example where security notions are bisimulation-based. A justification for having such a weaker adversary is found in [13].…”

Section: Definition 39 (Conditional Anonimity [8]mentioning

confidence: 99%

“…In this section we extend the proof method [13,12] for anonymity to the probabilistic setting. In the introduction we have presented the basic scenario.…”

Section: Anonymity Proof Via Probabilistic Simulationsmentioning

confidence: 99%

“…It is a probabilistic extension of the method by Kawabe et al [13,12] for a non-deterministic (as opposed to probabilistic) setting. The basic scenario is common in both non-deterministic and probabilistic cases:…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Probabilistic Anonymity Via Coalgebraic Simulations

Hasuo

Kawabe

2007

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

Abstract. There is a growing concern on anonymity and privacy on the Internet, resulting in lots of work on formalization and verification of anonymity. Especially, importance of probabilistic aspect of anonymity is claimed recently by many authors. Among them are Bhargava and Palamidessi who present the definition of probabilistic anonymity for which, however, proof methods are not yet elaborated. In this paper we introduce a simulation-based proof method for probabilistic anonymity. It is a probabilistic adaptation of the method by Kawabe et al. for non-deterministic anonymity: anonymity of a protocol is proved by finding out a forward/backward simulation between certain automata. For the jump from non-determinism to probability we fully exploit a generic, coalgebraic theory of traces and simulations developed by Hasuo and others. In particular, an appropriate notion of probabilistic simulations is obtained by instantiating a generic definition with suitable parameters.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Definition 39 (Conditional Anonimity [8]mentioning

confidence: 99%

“…In this section we extend the proof method [13,12] for anonymity to the probabilistic setting. In the introduction we have presented the basic scenario.…”

Section: Anonymity Proof Via Probabilistic Simulationsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Probabilistic Anonymity Via Coalgebraic Simulations

Hasuo

Kawabe

2007

Programming Languages and Systems

Self Cite

View full text Add to dashboard Cite

show abstract

“…The formal method has already been applied to analyze distributed systems and it can also be used to study the anonymous communication systems, such as [12] and [14], the method used in [14] is Mull Krakow chain and the method in [12] considers theoremproving.…”

Section: Anonymity Proofmentioning

confidence: 99%

Towards a Comprehensive Analysis of Crowds Anonymity System

Lu¹,

Zhang²,

Du³

et al. 2016

IJSIA

View full text Add to dashboard Cite

show abstract

A Strand Space Approach to Provable Anonymity

Pang

2014

Communications in Computer and Information Science

View full text Add to dashboard Cite

We formalize in the strand space theory the notion of provable anonymity. Bundle in a strand space is used to formalize a session of a protocol. Behaviors of an observer can then be formalized as extensions of a bundle. Reinterpretation function can be naturally derived from the mapping from one message term of an edge of a bundle in a strand space to that in another strand space. We formally define observational equivalence on bundles and use it to formalise anonymity properties. The novelty of our theory lies in the observational model and the construction of reinterpretation functions in the strand space theory. We build our theory in Isabelle/HOL to achieve a mechanical framework for the analysis of anonymity protocols.

show abstract

Theorem-proving anonymity of infinite-state systems

Cited by 14 publications

References 5 publications

Probabilistic Anonymity Via Coalgebraic Simulations

Probabilistic Anonymity Via Coalgebraic Simulations

Towards a Comprehensive Analysis of Crowds Anonymity System

A Strand Space Approach to Provable Anonymity

Contact Info

Product

Resources

About