The dining cryptographers problem: unconditional sender and recipient untraceability
Journal of Cryptology
The linear time-branching time spectrum (extended abstract)
CONCUR '90 Proceedings on Theories of concurrency : unification and extension: unification and extension
Forward and backward simulations I.: untimed systems
Information and Computation
A calculus for cryptographic protocols: the spi calculus
Proceedings of the 4th ACM conference on Computer and communications security
Probabilistic noninterference in a concurrent language
Journal of Computer Security
Probabilistic simulations for probabilistic processes
Nordic Journal of Computing
ESORICS '96 Proceedings of the 4th European Symposium on Research in Computer Security: Computer Security
Probabilistic Noninterference for Multi-Threaded Programs
CSFW '00 Proceedings of the 13th IEEE workshop on Computer Security Foundations
CONCUR 2005 - Concurrency Theory
Proceedings of the 2005 ACM workshop on Formal methods in security engineering
Distributing probability over non-determinism
Mathematical Structures in Computer Science
Anonymity and information hiding in multiagent systems
Journal of Computer Security
Theorem-proving anonymity of infinite-state systems
Information Processing Letters
Probabilistic analysis of an anonymity system
Journal of Computer Security - Special issue on CSFW15
Information hiding, anonymity and privacy: a modular approach
Journal of Computer Security - Special issue on WITS'02
Probabilistic and Nondeterministic Aspects of Anonymity
Electronic Notes in Theoretical Computer Science (ENTCS)
Generic forward and backward simulations
CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
An Adversary Model for Simulation-Based Anonymity Proof
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Probabilistic anonymity via coalgebraic simulations
Theoretical Computer Science
Reasoning about probabilistic security using task-PIOAs
ARSPA-WITS'10 Proceedings of the 2010 joint conference on Automated reasoning for security protocol analysis and issues in the theory of security
Anonymity, Privacy, Onymity, and Identity: A Modal Logic Approach
Transactions on Data Privacy
Hi-index | 0.00 |
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.