{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:18:03Z","timestamp":1725495483733},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540753339"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75336-0_19","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T20:38:37Z","timestamp":1195159117000},"page":"301-318","source":"Crossref","is-referenced-by-count":14,"title":["A Framework for Automatically Checking Anonymity with \u03bcCRL"],"prefix":"10.1007","author":[{"given":"Tom","family":"Chothia","sequence":"first","affiliation":[]},{"given":"Simona","family":"Orzan","sequence":"additional","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Mohammad","family":"Torabi Dashti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0304-3975(85)90088-X","volume":"37","author":"J.A. Bergstra","year":"1985","unstructured":"Bergstra, J.A., Klop, J.W.: Algebra of communicating processes with abstraction. Theoretical Computer Science\u00a037(1), 77\u2013121 (1985)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1007\/3-540-44702-4_3","volume-title":"Proc. Workshop on Design Issues in Anonymity and Unobservability","author":"O. Berthold","year":"2001","unstructured":"Berthold, O., Pfiztmann, A., Standtke, R.: The disavantages of free mix routes and how to overcome them. In: Federrath, H. (ed.) Proc. Workshop on Design Issues in Anonymity and Unobservability. LNCS, vol.\u00a02009, pp. 30\u201345. Springer, Heidelberg (2001)"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"250","DOI":"10.1007\/3-540-44585-4_23","volume-title":"Computer Aided Verification","author":"S.C.C. Blom","year":"2001","unstructured":"Blom, S.C.C., Fokkink, W.J., Groote, J.F., van Langevelde, I., Lisser, B., van de Pol, J.C.: \u03bcCRL: A toolset for analysing algebraic specifications. In: Berry, G., Comon, H., Finkel, A. (eds.) CAV 2001. LNCS, vol.\u00a02102, pp. 250\u2013254. Springer, Heidelberg (2001)"},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Blom, S.C.C., Groote, J.F., Mauw, S., Serebrenik, A.: Analysing the BKE-security protocol with \u03bcCRL. In: Proc. 6th AMAST Workshop on Real-Time Systems. ENTCS, vol.\u00a0139, pp. 49\u201390 (2004)","DOI":"10.1016\/j.entcs.2005.09.005"},{"issue":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/s10009-004-0159-4","volume":"7","author":"S.C.C. Blom","year":"2005","unstructured":"Blom, S.C.C., Orzan, S.M.: A distributed algorithm for strong bisimulation reduction of state spaces. Software Tools for Technology Transfer\u00a07(1), 74\u201386 (2005)","journal-title":"Software Tools for Technology Transfer"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11888116_9","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"T. Chothia","year":"2006","unstructured":"Chothia, T.: Analysing the mute anonymous file-sharing system using the pi-calculus. In: Najm, E., Pradat-Peyre, J.F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol.\u00a04229, pp. 115\u2013130. Springer, Heidelberg (2006)"},{"key":"19_CR9","unstructured":"Chothia, T., Orzan, S.M., Pang, J.: \u03bcCRL specifications. http:\/\/www.win.tue.nl\/~sorzan\/anonymity"},{"key":"19_CR10","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: Proc. 3rd Workshop on Security Issues in Concurrency (2005)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36467-6_5","volume-title":"Proc. 2nd Workshop on Privacy Enhancing Technologies","author":"C. D\u00edaz","year":"2002","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: PET 2002. LNCS, vol.\u00a02482, pp. 54\u201368. Springer, Heidelberg (2002)"},{"key":"19_CR12","unstructured":"van Eijck, J., Orzan, S.M.: Epistemic verification of anonymity. In: Proc. Views On Designing Complex Architectures (VODCA 2006) (2006)"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","first-page":"244","volume-title":"Proc. 3rd Workshop on the Theory and Application of Cryptographic Techniques","author":"A. Fujioka","year":"1992","unstructured":"Fujioka, A., Okamoto, T., Ohta, K.: A practical secret voting scheme for large scale elections. In: AUSCRYPT 1992. LNCS, vol.\u00a0718, pp. 244\u2013251. Springer, Heidelberg (1992)"},{"key":"19_CR14","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/1103576.1103585","volume-title":"Proc. 3rd ACM Workshop on Formal Methods in Security Engineering","author":"F.D. Garcia","year":"2005","unstructured":"Garcia, F.D., Hasuo, I., Pieters, W., van Rossum, P.: Provable anonymity. In: Proc. 3rd ACM Workshop on Formal Methods in Security Engineering, pp. 63\u201372. ACM Press, New York (2005)"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Groote, J.F., Reniers, M.A.: Algebraic process verification. In: Bergstra, J.A., Ponse, A., Smolka, S.A. (eds.) Handbook of Process Algebra, North-Holland, pp. 1151\u20131208 (2001)","DOI":"10.1016\/B978-044482830-9\/50035-7"},{"key":"19_CR16","doi-asserted-by":"crossref","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. Journal of Computer Security, 483\u2013514 (2005)","DOI":"10.3233\/JCS-2005-13305"},{"issue":"1","key":"19_CR17","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","volume":"12","author":"D. Hughes","year":"2004","unstructured":"Hughes, D., Shmatikov, V.: Information hiding, anonymity and privacy: A modular approach. Journal of Computer Security\u00a012(1), 3\u201336 (2004)","journal-title":"Journal of Computer Security"},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"H\u00fcttel, H., Shukla, S.: On the complexity of deciding behavioural equivalences and preorders - a survey. Technical Report RS-96-39, BRICS (1996)","DOI":"10.7146\/brics.v3i39.20021"},{"key":"19_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/978-3-540-31987-0_14","volume-title":"Programming Languages and Systems","author":"S. Kremer","year":"2005","unstructured":"Kremer, S., Ryan, M.: Analysis of an electronic voting protocol in the applied pi-calculus. In: Sagiv, M. (ed.) ESOP 2005. LNCS, vol.\u00a03444, pp. 186\u2013200. Springer, Heidelberg (2005)"},{"key":"19_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/11691372_31","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Lomuscio","year":"2006","unstructured":"Lomuscio, A., Raimondi, F.: MCMAS: A tool for verifying multi-agent systems. In: Hermanns, H., Palsberg, J. (eds.) TACAS 2006 and ETAPS 2006. LNCS, vol.\u00a03920, pp. 450\u2013454. Springer, Heidelberg (2006)"},{"key":"19_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-540-30108-0_7","volume-title":"Computer Security \u2013 ESORICS 2004","author":"S. Mauw","year":"2004","unstructured":"Mauw, S., Verschuren, J., de Vink, E.P.: A formalization of anonymity and onion routing. In: Samarati, P., Ryan, P.Y A, Gollmann, D., Molva, R. (eds.) ESORICS 2004. LNCS, vol.\u00a03193, pp. 109\u2013124. Springer, Heidelberg (2004)"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"Mauw, S., Verschuren, J., de Vink, E.P.: Data anonymity in the FOO voting scheme. In: Proc. Views On Designing Complex Architectures (VODCA 2006) (2006)","DOI":"10.1016\/j.entcs.2006.11.001"},{"key":"19_CR23","unstructured":"Meritt, M.J.: Cryptographic Protocols. PhD thesis, Georgia Institute of Technology (1983)"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1109\/CSFW.2004.1310747","volume-title":"Proc. 17th IEEE Computer Security Foundations Workshop","author":"R. Meyden van der","year":"2004","unstructured":"van der Meyden, R., Su, K.: Symbolic model checking the knowledge of the dining cryptographers. In: Proc. 17th IEEE Computer Security Foundations Workshop, pp. 280\u2013291. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"19_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-36103-0_40","volume-title":"Formal Methods and Software Engineering","author":"J. Pang","year":"2002","unstructured":"Pang, J.: Analysis of a security protocol in \u03bcCRL. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol.\u00a02495, pp. 396\u2013400. Springer, Heidelberg (2002)"},{"key":"19_CR26","unstructured":"Pfitzmann, A., Hansen, M.: Anonymity, unobservability, and pseudonymity: A proposal for terminology, draft v0.23 (August 2005)"},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: Anonymity for Web transactions. ACM Transactions on Information and System Security\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Transactions on Information and System Security"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/3-540-61770-1_38","volume-title":"Computer Security - ESORICS 1996","author":"S. Schneider","year":"1996","unstructured":"Schneider, S., Sidiropoulos, A.: CSP and anonymity. In: Martella, G., Kurth, H., Montolivo, E., Bertino, E. (eds.) Computer Security - ESORICS 1996. LNCS, vol.\u00a01146, pp. 198\u2013218. Springer, Heidelberg (1996)"},{"key":"19_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-36467-6_4","volume-title":"Privacy Enhancing Technologies","author":"A. Serjantov","year":"2003","unstructured":"Serjantov, A., Danezis, G.: Towards an information theoretic metric for anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 41\u201353. Springer, Heidelberg (2003)"},{"issue":"3\/4","key":"19_CR30","doi-asserted-by":"crossref","first-page":"355","DOI":"10.3233\/JCS-2004-123-403","volume":"12","author":"V. Shmatikov","year":"2004","unstructured":"Shmatikov, V.: Probabilistic model checking of an anonymity system. Journal of Computer Security\u00a012(3\/4), 355\u2013377 (2004)","journal-title":"Journal of Computer Security"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75336-0_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,14]],"date-time":"2023-05-14T15:17:13Z","timestamp":1684077433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75336-0_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540753339"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75336-0_19","relation":{},"subject":[]}}