{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:37:59Z","timestamp":1757453879676},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642120015"},{"type":"electronic","value":"9783642120022"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12002-2_33","type":"book-chapter","created":{"date-parts":[[2010,3,8]],"date-time":"2010-03-08T01:20:25Z","timestamp":1268011225000},"page":"390-404","source":"Crossref","is-referenced-by-count":54,"title":["Statistical Measurement of Information Leakage"],"prefix":"10.1007","author":[{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Chothia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Apratim","family":"Guha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/TIT.1972.1054753","volume":"IT-18","author":"S. Arimoto","year":"1972","unstructured":"Arimoto, S.: An algorithm for computing the capacity of arbitrary memoryless channels. IEEE Trans. on Inform. Theory\u00a0IT-18(1), 14\u201320 (1972)","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-540-88313-5_33","volume-title":"Computer Security - ESORICS 2008","author":"M. Backes","year":"2008","unstructured":"Backes, M., K\u00f6pf, B.: Formally bounding the side-channel leakage in unknown-message attacks. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 517\u2013532. Springer, Heidelberg (2008)"},{"key":"33_CR3","first-page":"370","volume":"53","author":"T. Bayes","year":"1774","unstructured":"Bayes, T.: An essay towards solving a problem in the doctrine of chances. Philo. Trans. of the Royal Society of London\u00a053, 370\u2013418 (1774)","journal-title":"Philo. Trans. of the Royal Society of London"},{"key":"33_CR4","volume-title":"Mathematical Statistics: Basic Ideas and Selected Topics","author":"P.J. Bickel","year":"2006","unstructured":"Bickel, P.J., Doksum, K.A.: Mathematical Statistics: Basic Ideas and Selected Topics. Prentice Hall, Englewood Cliffs (2006)"},{"issue":"4","key":"33_CR5","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1109\/TIT.1972.1054855","volume":"IT-18","author":"R.E. Blahut","year":"1972","unstructured":"Blahut, R.E.: Computation of channel capacity and rate distortion functions. IEEE Trans. on Inform. Theory\u00a0IT-18(4), 460\u2013473 (1972)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"6","key":"33_CR6","first-page":"163","volume":"18","author":"D.R. Brillinger","year":"2004","unstructured":"Brillinger, D.R.: Some data analysis using mutual information. Brazilian Journal of Probability and Statistics\u00a018(6), 163\u2013183 (2004)","journal-title":"Brazilian Journal of Probability and Statistics"},{"key":"33_CR7","unstructured":"Brillinger, D.R.: Personal correspondence (April 2009)"},{"key":"33_CR8","unstructured":"Chatzikokolakis, K., Chothia, T., Guha, A.: Calculating probabilistic anonymity from sampled data. Technical report, University of Birmingham (2009)"},{"key":"33_CR9","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.ic.2007.07.003","volume":"206","author":"K. Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation\u00a0206, 378\u2013401 (2008)","journal-title":"Information and Computation"},{"issue":"5","key":"33_CR10","doi-asserted-by":"crossref","first-page":"531","DOI":"10.3233\/JCS-2008-0333","volume":"16","author":"K. Chatzikokolakis","year":"2008","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: On the bayes risk in information-hiding protocols. J. Comput. Secur.\u00a016(5), 531\u2013571 (2008)","journal-title":"J. Comput. Secur."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Chen, H., Malacaria, P.: Quantifying maximal loss of anonymity in protocols. In: ASIACCS, pp. 206\u2013217 (2009)","DOI":"10.1145\/1533057.1533087"},{"issue":"3","key":"33_CR12","doi-asserted-by":"crossref","first-page":"321","DOI":"10.3233\/JCS-2007-15302","volume":"15","author":"D. Clark","year":"2007","unstructured":"Clark, D., Hunt, S., Malacaria, P.: A static analysis for quantifying information flow in a simple imperative language. J. Comput. Secur.\u00a015(3), 321\u2013371 (2007)","journal-title":"J. Comput. Secur."},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Danezis, G., Dingledine, R., Mathewson, N.: Mixminion: Design of a type iii anonymous remailer protocol. In: Proceedings of the 2003 IEEE Symposium on Security and Privacy, pp. 2\u201315 (2003)","DOI":"10.1109\/SECPRI.2003.1199323"},{"key":"33_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-75227-1_5","volume-title":"Formal Aspects in Security and Trust","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., Pang, J., Wu, P.: Measuring anonymity with relative entropy. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 65\u201379. Springer, Heidelberg (2007)"},{"key":"33_CR15","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":"33_CR16","doi-asserted-by":"crossref","unstructured":"Dupuis, F., Yu, W., Willems, F.M.J.: Blahut-arimoto algorithms for computing channel capacity and rate-distortion with side information. In: Proceedings of International Symposium on Information Theory. ISIT 2004, p. 179+ (2004)","DOI":"10.1109\/ISIT.2004.1365218"},{"key":"33_CR17","doi-asserted-by":"crossref","first-page":"399","DOI":"10.7551\/mitpress\/1120.003.0056","volume-title":"Advances in Neural Information Processing Systems 14","author":"M. Hutter","year":"2002","unstructured":"Hutter, M.: Distribution of mutual information. In: Advances in Neural Information Processing Systems 14, pp. 399\u2013406. MIT Press, Cambridge (2002)"},{"key":"33_CR18","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1145\/1375696.1375713","volume-title":"PLAS 2008: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security","author":"P. Malacaria","year":"2008","unstructured":"Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: PLAS 2008: Proceedings of the third ACM SIGPLAN workshop on Programming languages and analysis for security, pp. 135\u2013146. ACM, New York (2008)"},{"key":"33_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-01465-9_5","volume-title":"Formal Aspects in Security and Trust","author":"H. Mantel","year":"2009","unstructured":"Mantel, H., Sudbrock, H.: Information-theoretic modeling and analysis of interrupt-related covert channels. In: Degano, P., Guttman, J., Martinelli, F. (eds.) FAST 2008. LNCS, vol.\u00a05491, pp. 67\u201381. Springer, Heidelberg (2009)"},{"key":"33_CR20","doi-asserted-by":"crossref","unstructured":"Matz, G., Duhamel, P.: Information geometric formulation and interpretation of accelerated blahut-arimoto-type algorithms. In: Proceedings of the IEEE Information Theory Workshop (ITW), pp. 66\u201370 (2004)","DOI":"10.1109\/ITW.2004.1405276"},{"key":"33_CR21","first-page":"441","volume-title":"A probabilistic approach to information hiding in Programming methodology","author":"A. McIver","year":"2003","unstructured":"McIver, A., Morgan, C.: A probabilistic approach to information hiding in Programming methodology, pp. 441\u2013460. Springer, Heidelberg (2003)"},{"key":"33_CR22","doi-asserted-by":"crossref","unstructured":"Millen, J.K.: Covert channel capacity. In: IEEE Symposium on Security and Privacy, pp. 60\u201366 (1987)","DOI":"10.1109\/SP.1987.10013"},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/0165-1684(89)90132-1","volume":"16","author":"R. Moddemejer","year":"1989","unstructured":"Moddemejer, R.: On estimation of entropy and mutual information of continuous distributions. Signal Processing\u00a016, 233\u2013248 (1989)","journal-title":"Signal Processing"},{"key":"33_CR24","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"},{"issue":"6","key":"33_CR25","doi-asserted-by":"publisher","first-page":"1191","DOI":"10.1162\/089976603321780272","volume":"15","author":"L. Paninski","year":"2003","unstructured":"Paninski, L.: Estimation of entropy and mutual information. Neural Comp.\u00a015(6), 1191\u20131253 (2003)","journal-title":"Neural Comp."},{"key":"33_CR26","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":"33_CR27","doi-asserted-by":"crossref","unstructured":"Troncoso, C., Danezis, G.: The bayesian traffic analysis of mix networks. In: Proceedings of the 16th ACM conference on Computer and communications security, pp. 369\u2013379 (2009)","DOI":"10.1145\/1653662.1653707"},{"key":"33_CR28","volume-title":"Introduction to Engineering Experimentation","author":"A.J. Wheeler","year":"2009","unstructured":"Wheeler, A.J., Ganji, A.R.: Introduction to Engineering Experimentation, 3rd edn. Prentice Hall, Englewood Cliffs (2009)","edition":"3"},{"key":"33_CR29","first-page":"514","volume-title":"Proc. of ICDCS","author":"Y. Zhu","year":"2005","unstructured":"Zhu, Y., Bettati, R.: Anonymity vs. information leakage in anonymity systems. In: Proc. of ICDCS, pp. 514\u2013524. IEEE Computer Society, Los Alamitos (2005)"}],"container-title":["Lecture Notes in Computer Science","Tools and Algorithms for the Construction and Analysis of Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12002-2_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T18:07:29Z","timestamp":1711303649000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12002-2_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642120015","9783642120022"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12002-2_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}