{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:42:46Z","timestamp":1774946566988,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642547911","type":"print"},{"value":"9783642547928","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54792-8_7","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:35:12Z","timestamp":1395408912000},"page":"120-139","source":"Crossref","is-referenced-by-count":8,"title":["When Not All Bits Are Equal: Worth-Based Information Flow"],"prefix":"10.1007","author":[{"given":"M\u00e1rio S.","family":"Alvim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andre","family":"Scedrov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred B.","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","unstructured":"Cachin, C.: Entropy Measures and Unconditional Security in Cryptography. PhD thesis, ETH Z\u00fcrich (1997) Reprint as of ETH Series in Information Security and Cryptography, vol. 1. Hartung-Gorre Verlag, Konstanz (1997) ISBN 3-89649-185-7"},{"issue":"2","key":"7_CR2","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1093\/logcom\/exi009","volume":"18","author":"D. Clark","year":"2005","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative information flow, relations and polymorphic types. J. of Logic and Computation\u00a018(2), 181\u2013199 (2005)","journal-title":"J. of Logic and Computation"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Malacaria, P.: Assessing security threats of looping constructs. In: Hofmann, M., Felleisen, M. (eds.) Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2007, pp. 225\u2013235. ACM (2007)","DOI":"10.1145\/1190216.1190251"},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Malacaria, P., Chen, H.: Lagrange multipliers and maximum information leakage in different observational models. In: Proc. of the 2008 Workshop on Programming Languages and Analysis for Security (PLAS 2008), pp. 135\u2013146. ACM (June 2008)","DOI":"10.1145\/1375696.1375713"},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Moskowitz, I.S., Newman, R.E., Syverson, P.F.: Quasi-anonymous channels. In: Proc. of CNIS, pp. 126\u2013131, IASTED (2003)","DOI":"10.21236\/ADA465128"},{"key":"7_CR6","doi-asserted-by":"crossref","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.) Workshop on Privacy in the Electronic Society 2003, pp. 79\u201388. ACM (2003)","DOI":"10.1145\/1005140.1005153"},{"issue":"2-4","key":"7_CR7","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. Inf. and Comp.\u00a0206(2-4), 378\u2013401 (2008)","journal-title":"Inf. and Comp."},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-15375-4_8","volume-title":"CONCUR 2010 - Concurrency Theory","author":"M.S. Alvim","year":"2010","unstructured":"Alvim, M.S., Andr\u00e9s, M.E., Palamidessi, C.: Information Flow in Interactive Systems. In: Gastin, P., Laroussinie, F. (eds.) CONCUR 2010. LNCS, vol.\u00a06269, pp. 102\u2013116. Springer, Heidelberg (2010)"},{"key":"7_CR9","unstructured":"Massey: Guessing and entropy. In: Proceedings of the IEEE International Symposium on Information Theory, p. 204. IEEE (1994)"},{"key":"7_CR10","unstructured":"Malacaria, P.: Algebraic foundations for information theoretical, probabilistic and guessability measures of information flow. CoRR abs\/1101.3453 (2011)"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-00596-1_21","volume-title":"Foundations of Software Science and Computational Structures","author":"G. Smith","year":"2009","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 288\u2013302. Springer, Heidelberg (2009)"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Quantitative notions of leakage for one-try attacks. In: Proceedings of the 25th Conf. on Mathematical Foundations of Programming Semantics. Electronic Notes in Theoretical Computer Science, vol.\u00a0249, pp. 75\u201391. Elsevier B.V. (2009)","DOI":"10.1016\/j.entcs.2009.07.085"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., Palamidessi, C., Smith, G.: Measuring information leakage using generalized gain functions. In: Proceedings of the 25th IEEE Computer Security Foundations Symposium (CSF), pp. 265\u2013279 (2012)","DOI":"10.1109\/CSF.2012.26"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Landauer, J., Redmond, T.: A lattice of information. In: Proc. Computer Security Foundations Workshop VI, pp. 65\u201370 (June 1993)","DOI":"10.1109\/CSFW.1993.246638"},{"key":"7_CR15","unstructured":"Alvim, M.S., Scedrov, A., Schneider, F.B.: When not all bits are equal: Worth-based information flow. Technical report (2013), http:\/\/ecommons.library.cornell.edu\/handle\/1813\/33124"},{"key":"7_CR16","unstructured":"Sweeney, L.: Uniqueness of simple demographics in the U.S. population, Carnegie Mellon University, Laboratory for International Data Privacy (2000)"},{"issue":"1","key":"7_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/JCS-2009-0397","volume":"19","author":"B. K\u00f6pf","year":"2011","unstructured":"K\u00f6pf, B., Basin, D.: Automatically deriving information-theoretic bounds for adaptive side-channel attacks. J. Comput. Secur.\u00a019(1), 1\u201331 (2011)","journal-title":"J. Comput. Secur."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Yasuoka, H., Terauchi, T.: Quantitative information flow \u2014 verification hardness and possibilities. In: Proc. 23rd IEEE Computer Security Foundations Symposium (CSF 2010), pp. 15\u201327 (2010)","DOI":"10.1109\/CSF.2010.9"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11787006_1","volume-title":"Automata, Languages and Programming","author":"C. Dwork","year":"2006","unstructured":"Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006, part II. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"7_CR20","first-page":"351","volume-title":"Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"A. Ghosh","year":"2009","unstructured":"Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 351\u2013360. ACM, New York (2009)"},{"key":"7_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-642-22012-8_4","volume-title":"Automata, Languages and Programming","author":"M.S. Alvim","year":"2011","unstructured":"Alvim, M.S., Andr\u00e9s, M.E., Chatzikokolakis, K., Palamidessi, C.: On the relation between differential privacy and quantitative information flow. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol.\u00a06756, pp. 60\u201376. Springer, Heidelberg (2011)"},{"issue":"4","key":"7_CR22","doi-asserted-by":"publisher","first-page":"443","DOI":"10.2996\/kmj\/1138846220","volume":"22","author":"Y. Nakamura","year":"1970","unstructured":"Nakamura, Y.: Entropy and semivaluations on semilattices. Kodai Mathematical Seminar Reports\u00a022(4), 443\u2013468 (1970)","journal-title":"Kodai Mathematical Seminar Reports"},{"issue":"1","key":"7_CR23","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1109\/TIT.1953.1188572","volume":"1","author":"C. Shannon","year":"1953","unstructured":"Shannon, C.: The lattice theory of information. IRE Professional Group on Information Theory\u00a01(1), 105\u2013107 (1953)","journal-title":"IRE Professional Group on Information Theory"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Backes, M., K\u00f6pf, B., Rybalchenko, A.: Automatic discovery and quantification of information leaks. In: IEEE Symposium on Security and Privacy, pp. 141\u2013153 (2009)","DOI":"10.1109\/SP.2009.18"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1145\/1920261.1920300","volume-title":"Proceedings of the 26th Annual Computer Security Applications Conference, ACSAC 2010","author":"J. Heusser","year":"2010","unstructured":"Heusser, J., Malacaria, P.: Quantifying information leaks in software. In: Proceedings of the 26th Annual Computer Security Applications Conference, ACSAC 2010, pp. 261\u2013269. ACM, New York (2010)"},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Ad\u00e3o, P., Mateus, P., Vigan\u00f2, L.: Protocol insecurity with a finite number of sessions and a cost-sensitive guessing intruder is np-complete. Theoretical Computer Science (2013) ISSN 0304-3975, http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397513006956 , doi:http:\/\/dx.doi.org\/10.1016\/j.tcs.2013.09.015","DOI":"10.1016\/j.tcs.2013.09.015"},{"key":"7_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/978-3-540-88313-5_22","volume-title":"Computer Security - ESORICS 2008","author":"A. Askarov","year":"2008","unstructured":"Askarov, A., Hunt, S., Sabelfeld, A., Sands, D.: Termination-insensitive noninterference leaks more than just a bit. In: Jajodia, S., Lopez, J. (eds.) ESORICS 2008. LNCS, vol.\u00a05283, pp. 333\u2013348. Springer, Heidelberg (2008)"},{"key":"7_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-642-00590-9_16","volume-title":"Programming Languages and Systems","author":"D. Demange","year":"2009","unstructured":"Demange, D., Sands, D.: All secrets great and small. In: Castagna, G. (ed.) ESOP 2009. LNCS, vol.\u00a05502, pp. 207\u2013221. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Principles of Security and Trust"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54792-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:47:01Z","timestamp":1746157621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54792-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547911","9783642547928"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54792-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}