{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T20:56:12Z","timestamp":1694638572937},"reference-count":45,"publisher":"Elsevier BV","issue":"22-24","license":[{"start":{"date-parts":[[2010,5,1]],"date-time":"2010-05-01T00:00:00Z","timestamp":1272672000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2014,5,17]],"date-time":"2014-05-17T00:00:00Z","timestamp":1400284800000},"content-version":"vor","delay-in-days":1477,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1016\/j.tcs.2010.01.031","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T15:13:15Z","timestamp":1265728395000},"page":"2239-2259","source":"Crossref","is-referenced-by-count":6,"title":["Probabilistic anonymity via coalgebraic simulations"],"prefix":"10.1016","volume":"411","author":[{"given":"Ichiro","family":"Hasuo","sequence":"first","affiliation":[]},{"given":"Yoshinobu","family":"Kawabe","sequence":"additional","affiliation":[]},{"given":"Hideki","family":"Sakurada","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.tcs.2010.01.031_b1","series-title":"Fourth ACM Conference on Computer and Communications Security","first-page":"36","article-title":"A calculus for cryptographic protocols: The Spi calculus","author":"Abadi","year":"1997"},{"key":"10.1016\/j.tcs.2010.01.031_b2","series-title":"Handbook of Process Algebra","first-page":"197","article-title":"Structural operational semantics","author":"Aceto","year":"2001"},{"key":"10.1016\/j.tcs.2010.01.031_b3","unstructured":"Anonymity bibliography. http:\/\/freehaven.net\/anonbib\/."},{"key":"10.1016\/j.tcs.2010.01.031_b4","series-title":"Toposes, Triples and Theories","author":"Barr","year":"1985"},{"key":"10.1016\/j.tcs.2010.01.031_b5","series-title":"CONCUR 2005","first-page":"171","article-title":"Probabilistic anonymity","volume":"vol. 3653","author":"Bhargava","year":"2005"},{"key":"10.1016\/j.tcs.2010.01.031_b6","unstructured":"S. Briais, ABC bisimulation checker. http:\/\/lamp.epfl.ch\/~sbriais\/abc\/abc.html, 2003."},{"key":"10.1016\/j.tcs.2010.01.031_b7","doi-asserted-by":"crossref","unstructured":"K. Chatzikokolakis, C. Palamidessi, Making random choices invisible to the scheduler, in: International Conference on Concurrency Theory, CONCUR 2007, in: Lect. Notes Comp. Sci., vol. 4703, 2007, pp. 42\u201358.","DOI":"10.1007\/978-3-540-74407-8_4"},{"key":"10.1016\/j.tcs.2010.01.031_b8","doi-asserted-by":"crossref","unstructured":"K. Chatzikokolakis, C. Palamidessi, P. Panangaden, Probability of error in information-hiding protocols, in: Computer Security Foundations Symposium. CSF\u201907. 20th IEEE, 2007, pp. 341\u2013354.","DOI":"10.1109\/CSF.2007.27"},{"issue":"1\u20132","key":"10.1016\/j.tcs.2010.01.031_b9","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.tcs.2006.08.033","article-title":"Probable innocence revisited","volume":"367","author":"Chatzikokolakis","year":"2006","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF00206326","article-title":"The dining cryptographers problem: Unconditional sender and recipient untraceability","volume":"1","author":"Chaum","year":"1988","journal-title":"J. Cryptology"},{"key":"10.1016\/j.tcs.2010.01.031_b11","unstructured":"L. Cheung, Reconciling nondeterministic and probabilistic choices. Ph.D. Thesis, Radboud Univ. Nijmegen, 2006."},{"key":"10.1016\/j.tcs.2010.01.031_b12","series-title":"FORTE","first-page":"115","article-title":"Analysing the MUTE anonymous file-sharing system using the pi-calculus","volume":"vol. 4229","author":"Chothia","year":"2006"},{"key":"10.1016\/j.tcs.2010.01.031_b13","unstructured":"T. Chothia, How anonymity can fail because of the scheduler. http:\/\/homepages.cwi.nl\/~chothia\/DCschedular\/, 2007."},{"key":"10.1016\/j.tcs.2010.01.031_b14","doi-asserted-by":"crossref","unstructured":"T. Chothia, Securing pseudo identities in an anonymous peer-to-peer file-sharing network, in: International Conference on Security and Privacy in Communication Networks, SecureComm 2007, 2007, pp. 279\u2013282.","DOI":"10.1109\/SECCOM.2007.4550344"},{"key":"10.1016\/j.tcs.2010.01.031_b15","series-title":"The 2nd Symposium on Trustworthy Global Computing, TGC 2006","article-title":"A framework for automatically checking anonymity with mCRL","author":"Chothia","year":"2006"},{"key":"10.1016\/j.tcs.2010.01.031_b16","unstructured":"F.D. Garcia, P. van Rossum, A. Sokolova, Probabilistic anonymity and admissible schedulers. arXiv:0706.1019v1, 2007."},{"key":"10.1016\/j.tcs.2010.01.031_b17","series-title":"3rd ACM Workshop on Formal Methods in Security Engineering, FMSE05","first-page":"63","article-title":"Provable anonymity","author":"Garcia","year":"2005"},{"key":"10.1016\/j.tcs.2010.01.031_b18","series-title":"Proceedings CONCUR \u201990, Theories of Concurrency: Unification and Extension, Amsterdam, August 1990","first-page":"278","article-title":"The linear time-branching time spectrum (extended abstract)","volume":"vol. 458","author":"van Glabbeek","year":"1990"},{"issue":"3","key":"10.1016\/j.tcs.2010.01.031_b19","doi-asserted-by":"crossref","first-page":"483","DOI":"10.3233\/JCS-2005-13305","article-title":"Anonymity and information hiding in multiagent systems","volume":"13","author":"Halpern","year":"2005","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.tcs.2010.01.031_b20","series-title":"International Conference on Concurrency Theory, CONCUR 2006","first-page":"406","article-title":"Generic forward and backward simulations","volume":"vol. 4137","author":"Hasuo","year":"2006"},{"key":"10.1016\/j.tcs.2010.01.031_b21","series-title":"International Conference on Algebra and Coalgebra in Computer Science, CALCO\u201905","first-page":"213","article-title":"Context-free languages via coalgebraic trace semantics","volume":"vol. 3629","author":"Hasuo","year":"2005"},{"key":"10.1016\/j.tcs.2010.01.031_b22","series-title":"International Workshop on Coalgebraic Methods in Computer Science, CMCS 2006","first-page":"47","article-title":"Generic trace theory","volume":"vol. 164","author":"Hasuo","year":"2006"},{"key":"10.1016\/j.tcs.2010.01.031_b23","doi-asserted-by":"crossref","unstructured":"I. Hasuo, B. Jacobs, A. Sokolova, Generic trace semantics via coinduction. Extended version of\u00a0[21,22], available from http:\/\/www.cs.ru.nl\/~ichiro, 2007.","DOI":"10.2168\/LMCS-3(4:11)2007"},{"key":"10.1016\/j.tcs.2010.01.031_b24","series-title":"European Symposium on Programming, ESOP 2007","first-page":"379","article-title":"Probabilistic anonymity via coalgebraic simulations","volume":"vol. 4421","author":"Hasuo","year":"2007"},{"key":"10.1016\/j.tcs.2010.01.031_b25","series-title":"FoSSaCS","first-page":"146","article-title":"Probabilistic asynchronous pi-calculus","volume":"vol. 1784","author":"Herescu","year":"2000"},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b26","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/JCS-2004-12102","article-title":"Information hiding, anonymity and privacy: A modular approach","volume":"12","author":"Hughes","year":"2004","journal-title":"J. Comput. Secur."},{"key":"10.1016\/j.tcs.2010.01.031_b27","unstructured":"Y. Kawabe, K. Mano, H. Sakurada, Y. Tsukada, Backward simulations for anonymity, in: International Workshop on Issues in the Theory of Security, WITS \u201906, 2006."},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b28","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1016\/j.ipl.2006.06.016","article-title":"Theorem-proving anonymity of infinite state systems","volume":"101","author":"Kawabe","year":"2007","journal-title":"Inform. Process. Lett."},{"issue":"2","key":"10.1016\/j.tcs.2010.01.031_b29","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1006\/inco.1995.1134","article-title":"Forward and backward simulations. I.~Untimed systems","volume":"121","author":"Lynch","year":"1995","journal-title":"Inform. Comput."},{"key":"10.1016\/j.tcs.2010.01.031_b30","series-title":"Encyclopedia of Software Engineering","first-page":"1136","article-title":"Security models","author":"McLean","year":"1994"},{"key":"10.1016\/j.tcs.2010.01.031_b31","series-title":"MFPS \u201905","first-page":"33","article-title":"Probabilistic and nondeterministic aspects of anonymity","volume":"vol. 155","author":"Palamidessi","year":"2006"},{"issue":"2\u20133","key":"10.1016\/j.tcs.2010.01.031_b32","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/j.tcs.2004.11.020","article-title":"A randomized encoding of the pi-calculus with mixed choice","volume":"335","author":"Palamidessi","year":"2005","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.tcs.2010.01.031_b33","doi-asserted-by":"crossref","unstructured":"A. Pfitzmann, M. K\u00f6hntopp, Anonymity, unobservability, and pseudonymity: A proposal for terminology. Draft, version 0.17, July 2000.","DOI":"10.1007\/3-540-44702-4_1"},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b34","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/290163.290168","article-title":"Crowds: Anonymity for Web transactions","volume":"1","author":"Reiter","year":"1998","journal-title":"ACM Trans. Inform. Syst. Secur."},{"key":"10.1016\/j.tcs.2010.01.031_b35","unstructured":"J. Rohrer, MUTE technical details. http:\/\/mutenet.sourceforge.net\/technicalDetails.shtml, 2006."},{"key":"10.1016\/j.tcs.2010.01.031_b36","unstructured":"A. Sabelfeld, D. Sands, Probabilistic noninterference for multi-threaded programs, in: Proceedings of the 13th IEEE Computer Security Foundations Workshop, CSFW\u201900, 2000, pp. 200\u2013214."},{"key":"10.1016\/j.tcs.2010.01.031_b37","series-title":"ESORICS \u201996: Proceedings of the 4th European Symposium on Research in Computer Security","first-page":"198","article-title":"CSP and anonymity","author":"Schneider","year":"1996"},{"key":"10.1016\/j.tcs.2010.01.031_b38","unstructured":"R. Segala, Modeling and verification of randomized distributed real-time systems. Ph.D. Thesis, MIT, 1995."},{"issue":"2","key":"10.1016\/j.tcs.2010.01.031_b39","first-page":"250","article-title":"Probabilistic simulations for probabilistic processes","volume":"2","author":"Segala","year":"1995","journal-title":"Nordic J. Comput."},{"key":"10.1016\/j.tcs.2010.01.031_b40","unstructured":"A. Serjantov, On the anonymity of anonymity systems. Ph.D. Thesis, University of Cambridge, March 2004."},{"issue":"3","key":"10.1016\/j.tcs.2010.01.031_b41","doi-asserted-by":"crossref","first-page":"355","DOI":"10.3233\/JCS-2004-123-403","article-title":"Probabilistic model checking of an anonymity system","volume":"12","author":"Shmatikov","year":"2004","journal-title":"J. Computer Security"},{"key":"10.1016\/j.tcs.2010.01.031_b42","doi-asserted-by":"crossref","unstructured":"G. Smith, D.M. Volpano, Secure information flow in a multi-threaded imperative language, in: POPL, 1998, pp. 355\u2013364.","DOI":"10.1145\/268946.268975"},{"key":"10.1016\/j.tcs.2010.01.031_b43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.entcs.2004.06.063","article-title":"Semantic domains for combining probability and non-determinism","volume":"129","author":"Tix","year":"2005","journal-title":"Elect. Notes in Theoret. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b44","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1017\/S0960129505005074","article-title":"Distributing probability over nondeterminism","volume":"16","author":"Varacca","year":"2006","journal-title":"Math. Struct. Comput. Sci."},{"issue":"1","key":"10.1016\/j.tcs.2010.01.031_b45","article-title":"Probabilistic noninterference in a concurrent language","volume":"7","author":"Volpano","year":"1999","journal-title":"Journ. of Computer Security"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751000068X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030439751000068X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,27]],"date-time":"2022-06-27T23:19:32Z","timestamp":1656371972000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030439751000068X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5]]},"references-count":45,"journal-issue":{"issue":"22-24","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["S030439751000068X"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2010.01.031","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2010,5]]}}}