Weak Probabilistic Anonymity

Electronic Notes in Theoretical Computer Science

Volumn 180, Issue 1, 2007, Pages 55-76

  Deng, Yuxin ^a   Palamidessi, Catuscia ^b   Pang, Jun ^b  

^a UNIVERSITÉ PARIS DESCARTES   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Anonymity; Dining Cryptographers; Nondeterminism; Probability

Indexed keywords

ANONYMITY; DINING CRYPTOGRAPHERS; NONDETERMINISM;

CRYPTOGRAPHY; NETWORK PROTOCOLS; PROBABILISTIC LOGICS; USER INTERFACES;

DATA PRIVACY;

EID: 34249809380     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2005.05.047     Document Type: Article

References (16)

1. Alur R., and Henzinger T.A. Reactive modules. Formal Methods in System Design 15 1 (1999) 7-48
2. Baier C., Haverkort B., Hermanns H., and Katoen J.-P. Model checking continuous-time markov chains by transient analysis. Proceedings of the 12th Conference on Computer Aided Verification. Lecture Notes in Computer Science volume 1855 (2000), Springer-Verlag 358-372
3. Baier C., and Kwiatkowska M. Model checking for a probabilistic branching time logic with fairness. Distributed Computing 11 3 (1998) 125-155
4. Mohit Bhargava and Catuscia Palamidessi. Probabilistic anonymity. Technical report, INRIA Futurs and LIX, 2005. To appear in the proceedings of CONCUR 2005. Report version available at http://www.lix.polytechnique.fr/~catuscia/papers/Anonymity/report.ps
5. Bianco A., and de Alfaro L. Model checking of probabilistic and nondeterministic systems. Proceedings of the 15th Conference on Foundations of Software Technology and Theoretical Computer Science. Lecture Notes in Computer Science volume 1026 (1995), Springer-Verlag 499-513
6. Chaum D. The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1 (1988) 65-75
7. Joseph Y. Halpern and Kevin R. O'Neill. Anonymity and information hiding in multiagent systems. In Proc. of the 16th IEEE Computer Security Foundations Workshop, pages 75-88, 2003
8. Hansson H., and Jonsson B. A logic for reasoning about time and reliability. Formal Aspects of Computing 6 5 (1994) 512-535
9. Kesdogan D., Egner J., and Büschkes R. Stop-and-go MIXes: Providing probabilistic anonymity in an open system. Proceedings of Information Hiding Workshop. (IH 1998). LNCS 1525 (1998), Springer-Verlag
10. Kwiatkowska M.Z., Norman G., and Parker D. PRISM: Probabilistic symbolic model checker. Proceedings of the 12th Conference on Computer Performance Evaluation, Modelling Techniques and Tools. Lecture Notes in Computer Science volume 2324 (2002), Springer-Verlag 200-204
11. Reiter M.K., and Rubin A.D. Crowds: anonymity for Web transactions. ACM Transactions on Information and System Security 1 1 (1998) 66-92
12. Ryan P.Y., and Schneider S. Modelling and Analysis of Security Protocols (2001), Addison-Wesley
13. Schneider S., and Sidiropoulos A. CSP and anonymity. Proc. of the European Symposium on Research in Computer Security. (ESORICS). Lecture Notes in Computer Science volume 1146 (1996), Springer-Verlag 198-218
14. Segala R., and Lynch N. Probabilistic simulations for probabilistic processes. Nordic Journal of Computing 2 2 (1995) 250-273
15. An extended abstract appeared in Proceedings of CONCUR '94, LNCS 836: 481-496
16. P.F. Syverson, D.M. Goldschlag, and M.G. Reed. Anonymous connections and onion routing. In IEEE Symposium on Security and Privacy, pages 44-54, Oakland, California, 1997