{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T20:40:07Z","timestamp":1762375207827},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540752264"},{"type":"electronic","value":"9783540752271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75227-1_5","type":"book-chapter","created":{"date-parts":[[2007,9,12]],"date-time":"2007-09-12T21:32:47Z","timestamp":1189632767000},"page":"65-79","source":"Crossref","is-referenced-by-count":28,"title":["Measuring Anonymity with Relative Entropy"],"prefix":"10.1007","author":[{"given":"Yuxin","family":"Deng","sequence":"first","affiliation":[]},{"given":"Jun","family":"Pang","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"5_CR1","doi-asserted-by":"publisher","first-page":"665","DOI":"10.1017\/S0960129599002984","volume":"10","author":"C. Baier","year":"2004","unstructured":"Baier, C., Kwiatkowaska, M.Z.: Domain equations for probabilistic processes. Mathematical Structures in Computer Science\u00a010(6), 665\u2013717 (2004)","journal-title":"Mathematical Structures in Computer Science"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/3-540-44702-4_3","volume-title":"Designing Privacy Enhancing Technologies","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.) Designing Privacy Enhancing Technologies. LNCS, vol.\u00a02009, pp. 30\u201345. Springer, Heidelberg (2001)"},{"key":"5_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":"5_CR4","series-title":"Lecture Notes in Computer Science","volume-title":"Proc. 2nd Symposium on Trustworthy Global Computing","author":"K. Chatzikokolakis","year":"2006","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. In: Proc. 2nd Symposium on Trustworthy Global Computing. LNCS, Springer, Heidelberg, 2006 (to appear)"},{"key":"5_CR5","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":"5_CR6","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: Proc. 3rd Workshop on Security Issues in Concurrency, ENTCS, 2006 (to appear)"},{"key":"5_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1109\/LICS.2002.1029849","volume-title":"Proc. 17th IEEE Symposium on Logic in Computer Science","author":"J. Desharnais","year":"2002","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. 17th IEEE Symposium on Logic in Computer Science, pp. 413\u2013422. IEEE Computer Society, Los Alamitos (2002)"},{"issue":"3","key":"5_CR8","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.tcs.2003.09.013","volume":"318","author":"J. Desharnais","year":"2004","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Metrics for labelled Markov processes. Theoretical Computer Science\u00a0318(3), 323\u2013354 (2004)","journal-title":"Theoretical Computer Science"},{"key":"5_CR9","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":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/11423409_12","volume-title":"Privacy Enhancing Technologies","author":"R. Dingledine","year":"2005","unstructured":"Dingledine, R., Shmatikov, V., Syverson, P.F.: Synchronous batching: From cascades to free routes. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 186\u2013206. Springer, Heidelberg (2005)"},{"issue":"12","key":"5_CR11","doi-asserted-by":"publisher","first-page":"4868","DOI":"10.1063\/1.1805729","volume":"45","author":"S. Furuichi","year":"2004","unstructured":"Furuichi, S., Yanagi, K., Kuriyama, K.: Fundamental properties of Tsallis relative entropy. Journal of Mathematical Physics\u00a045(12), 4868\u20134877 (2004)","journal-title":"Journal of Mathematical Physics"},{"key":"5_CR12","first-page":"63","volume-title":"Provable anonymity","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":"5_CR13","volume-title":"Anonymity and information hiding in multiagent systems","author":"J.Y. Halpern","year":"2003","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. In: Proc. 16th IEEE Computer Security Foundations Workshop. IEEE Computer Society, Los Alamitos (2003)"},{"key":"5_CR14","volume-title":"Communicating Sequential Processes","author":"C.A.R. Hoare","year":"1985","unstructured":"Hoare, C.A.R.: Communicating Sequential Processes. Prentice Hall, Englewood Cliffs (1985)"},{"issue":"1","key":"5_CR15","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":"5_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/3-540-49380-8_7","volume-title":"Information Hiding","author":"D. Kesdogan","year":"1998","unstructured":"Kesdogan, D., Egner, J.: Stop-and-go MIXes: Providing probabilistic anonymity in an open system. In: Aucsmith, D. (ed.) IH 1998. LNCS, vol.\u00a01525, pp. 83\u201398. Springer, Heidelberg (1998)"},{"issue":"1","key":"5_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S. Kullback","year":"1951","unstructured":"Kullback, S., Leibler, R.A.: On information and sufficiency. Annals of Mathematical Statistics\u00a022(1), 79\u201386 (1951)","journal-title":"Annals of Mathematical Statistics"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/3-540-46029-2_13","volume-title":"Computer Performance Evaluation","author":"M. Kwiatkowska","year":"2002","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM: Probabilistic symbolic model checker. In: Field, T., Harrison, P.G., Bradley, J., Harder, U. (eds.) TOOLS 2002. LNCS, vol.\u00a02324, pp. 200\u2013204. Springer, Heidelberg (2002)"},{"key":"5_CR19","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner, R.: Communication and Concurrency. Prentice-Hall, Englewood Cliffs (1989)"},{"key":"5_CR20","doi-asserted-by":"crossref","first-page":"79","DOI":"10.21236\/ADA465268","volume-title":"Covert channels and anonymizing networks","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: Proceedings of 2nd ACM Workshop on Privacy in the Electronic Society, pp. 79\u201388. ACM Press, New York (2003)"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Privacy Enhancing Technologies","author":"R.E. Newman","year":"2005","unstructured":"Newman, R.E., Nalla, V.R., Moskowitz, I.S.: Anonymity and covert channels in simple timed mix-firewalls. In: Martin, D., Serjantov, A. (eds.) PET 2004. LNCS, vol.\u00a03424, pp. 1\u201316. Springer, Heidelberg (2005)"},{"issue":"1","key":"5_CR22","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":"5_CR23","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":"5_CR24","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, MIT, Deptartment of EECS (1995)"},{"key":"5_CR25","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":"5_CR26","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"},{"key":"5_CR27","first-page":"44","volume-title":"Anonymous connections and onion routing","author":"P.F. Syverson","year":"1997","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: Proc. 18th IEEE Symposium on Security and Privacy, pp. 44\u201354. IEEE Computer Society Press, Los Alamitos (1997)"},{"key":"5_CR28","first-page":"280","volume-title":"Symbolic model checking the knowledge of the dining cryptographers","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)"}],"container-title":["Lecture Notes in Computer Science","Formal Aspects in Security and Trust"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75227-1_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:56:37Z","timestamp":1619506597000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75227-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540752264","9783540752271"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75227-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}