{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:17:51Z","timestamp":1725495471710},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_18","type":"book-chapter","created":{"date-parts":[[2007,11,15]],"date-time":"2007-11-15T20:38:37Z","timestamp":1195159117000},"page":"281-300","source":"Crossref","is-referenced-by-count":18,"title":["Anonymity Protocols as Noisy Channels"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Catuscia","family":"Palamidessi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prakash","family":"Panangaden","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","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":"18_CR2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.3233\/JCS-2005-13305","volume":"13","author":"J.Y. Halpern","year":"2005","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. Journal of Computer Security\u00a013, 483\u2013512 (2005)","journal-title":"Journal of Computer Security"},{"key":"18_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), http:\/\/www.lix.polytechnique.fr\/~catuscia\/papers\/Anonymity\/concur.pdf"},{"key":"18_CR4","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, 66\u201392 (1998)","journal-title":"ACM Transactions on Information and System Security"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tcs.2006.08.033","volume":"367","author":"K. Chatzikokolakis","year":"2006","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Probable innocence revisited. Theoretical Computer Science\u00a0367, 123\u2013138 (2006), http:\/\/www.lix.polytechnique.fr\/~catuscia\/papers\/Anonymity\/reportPI.pdf","journal-title":"Theoretical Computer Science"},{"key":"18_CR6","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)"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-36467-6_5","volume-title":"Privacy Enhancing Technologies","author":"C. D\u00edaz","year":"2003","unstructured":"D\u00edaz, C., Seys, S., Claessens, J., Preneel, B.: Towards measuring anonymity. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 54\u201368. Springer, Heidelberg (2003)"},{"key":"18_CR8","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1145\/1005140.1005153","volume-title":"WPES","author":"I.S. Moskowitz","year":"2003","unstructured":"Moskowitz, I.S., Newman, R.E., Crepeau, D.P., Miller, A.R.: Covert channels and anonymizing networks. In: Jajodia, S., Samarati, P., Syverson, P.F. (eds.) WPES, pp. 79\u201388. ACM, New York (2003)"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Moskowitz, I.S., Newman, R.E., Syverson, P.F.: Quasi-anonymous channels. In: IASTED CNIS, pp. 126\u2013131 (2003)","DOI":"10.21236\/ADA465128"},{"key":"18_CR10","unstructured":"Deng, Y., Pang, J., Wu, P.: Measuring anonymity with relative entropy. In: Proceedings of the 4th International Workshop on Formal Aspects in Security and Trust. LNCS, Springer, Heidelberg (to appear, 2006)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"McLean, J.: Security models and information flow. IEEE Symposium on Security and Privacy, 180\u2013189 (1990)","DOI":"10.21236\/ADA462529"},{"key":"18_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/RISP.1991.130769","volume-title":"Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy SSP 1991","author":"J.W.. Gray III","year":"1991","unstructured":"Gray III, J.W.: Toward a mathematical foundation for information flow security. In: Proceedings of the 1991 IEEE Computer Society Symposium on Research in Security and Privacy SSP 1991, Washington - Brussels - Tokyo, pp. 21\u201335. IEEE, Los Alamitos (1991)"},{"key":"18_CR13","series-title":"Electr. Notes Theor. Comput. Sci","first-page":"238","volume-title":"Proc. of QAPL 2001","author":"D. Clark","year":"2001","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative analysis of the leakage of confidential data. In: Proc. of QAPL 2001. Electr. Notes Theor. Comput. Sci, vol.\u00a059 (3), pp. 238\u2013251. Elsevier Science B.V., Amsterdam (2001)"},{"key":"18_CR14","series-title":"Electr. Notes Theor. Comput. Sci","first-page":"149","volume-title":"Proc. of QAPL 2004","author":"D. Clark","year":"2005","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. In: Proc. of QAPL 2004. Electr. Notes Theor. Comput. Sci, vol.\u00a0112, pp. 149\u2013166. Elsevier Science B.V., Amsterdam (2005)"},{"key":"18_CR15","first-page":"18","volume-title":"Proc. of CSFW 2002","author":"G. Lowe","year":"2002","unstructured":"Lowe, G.: Quantifying information flow. In: Proc. of CSFW 2002, pp. 18\u201331. IEEE Computer Society Press, Los Alamitos (2002)"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"1350","DOI":"10.1109\/18.850674","volume":"46","author":"U.M. Maurer","year":"2000","unstructured":"Maurer, U.M.: Authentication theory and hypothesis testing. IEEE Transactions on Information Theory\u00a046, 1350\u20131356 (2000)","journal-title":"IEEE Transactions on Information Theory"},{"key":"18_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/JCS-2004-12103","volume":"12","author":"A.D. Pierro","year":"2004","unstructured":"Pierro, A.D., Hankin, C., Wiklicky, H.: Approximate non-interference. Journal of Computer Security\u00a012, 37\u201382 (2004)","journal-title":"Journal of Computer Security"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.03.002","volume":"340","author":"A.D. Pierro","year":"2005","unstructured":"Pierro, A.D., Hankin, C., Wiklicky, H.: Measuring the confinement of probabilistic systems. Theoretical Computer Science\u00a0340, 3\u201356 (2005)","journal-title":"Theoretical Computer Science"},{"key":"18_CR19","doi-asserted-by":"crossref","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T.M. Cover","year":"1991","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. John Wiley & Sons, Inc, Chichester (1991)"},{"key":"18_CR20","first-page":"200","volume-title":"Proc. of CSFW 2000","author":"A. Sabelfeld","year":"2000","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proc. of CSFW 2000, pp. 200\u2013214. IEEE Computer Society Press, Los Alamitos (2000)"},{"key":"18_CR21","series-title":"Electronic Notes in Theoretical Computer Science","volume-title":"Proc. of SecCo 2005","author":"Y. Deng","year":"2005","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: Proc. of SecCo 2005. Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, Amsterdam (2005), http:\/\/www.lix.polytechnique.fr\/~catuscia\/papers\/Anonymity\/report_wa.pdf"}],"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_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:59:26Z","timestamp":1619506766000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75336-0_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540753339"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75336-0_18","relation":{},"subject":[]}}