{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T13:28:34Z","timestamp":1725888514824},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319602240"},{"type":"electronic","value":"9783319602257"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60225-7_11","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T02:26:37Z","timestamp":1495851997000},"page":"156-170","source":"Crossref","is-referenced-by-count":1,"title":["Reasoning About Distributed Secrets"],"prefix":"10.1007","author":[{"given":"Nicol\u00e1s","family":"Bordenabe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Annabelle","family":"McIver","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carroll","family":"Morgan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tahiry","family":"Rabehaja","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Alvim, M.S., Chatzikokolakis, K., McIver, A., Morgan, C., Palamidessi, C., Smith, G.: Additive and multiplicative notions of leakage, and their capacities. In: CSF, pp. 308\u2013322. IEEE (2014)","DOI":"10.1109\/CSF.2014.29"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-54792-8_7","volume-title":"Principles of Security and Trust","author":"MS Alvim","year":"2014","unstructured":"Alvim, M.S., Scedrov, A., Schneider, F.B.: When not all bits are equal: worth-based information flow. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 120\u2013139. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-642-54792-8_7"},{"key":"11_CR3","unstructured":"Bordenabe, N., McIver, A., Morgan, C., Rabehaja, T.: Compositional security and collateral leakage (2016). \narXiv:1604.04983"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Bordenabe, N.E., Smith, G.: Correlated secrets in quantitative information flow. In: IEEE 29th Computer Security Foundations Symposium, CSF 2016, Lisbon, Portugal, 27 June - 1 July 2016, pp. 93\u2013104 (2016)","DOI":"10.1109\/CSF.2016.14"},{"issue":"2\u20134","key":"11_CR5","doi-asserted-by":"crossref","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. Comput. 206(2\u20134), 378\u2013401 (2008)","journal-title":"Inf. Comput."},{"issue":"3","key":"11_CR6","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1016\/S1571-0661(04)00290-7","volume":"59","author":"D Clark","year":"2001","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative analysis of the leakage of confidential data. Electron. Notes Theoret. Comput. Sci. 59(3), 238\u2013251 (2001)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1016\/j.entcs.2004.01.018","volume":"112","author":"D Clark","year":"2005","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. Electron. Notes Theoret. Comput. Sci. 112, 149\u2013166 (2005)","journal-title":"Electron. Notes Theoret. Comput. Sci."},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Clarkson, M.R., Myers, A.C., Schneider, F.B.: Belief in information flow. In: 18th IEEE Computer Security Foundations Workshop, (CSFW-18 2005), 20\u201322 June 2005, Aix-en-Provence, France, pp. 31\u201345 (2005)","DOI":"10.1109\/CSFW.2005.10"},{"key":"11_CR9","first-page":"429","volume":"15","author":"T Dalenius","year":"1977","unstructured":"Dalenius, T.: Towards a methodology for statistical disclosure control. Statistik Tidskrift 15, 429\u2013444 (1977)","journal-title":"Statistik Tidskrift"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Doychev, G., K\u00f6pf, B.: Rational protection against timing attacks. In: IEEE 28th Computer Security Foundations Symposium, CSF 2015, Verona, Italy, 13\u201317 July 2015, pp. 526\u2013536 (2015)","DOI":"10.1109\/CSF.2015.39"},{"key":"11_CR11","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. LNCS, vol. 4052, pp. 1\u201312. Springer, Heidelberg (2006). doi:\n10.1007\/11787006_1"},{"key":"11_CR12","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.ic.2013.03.005","volume":"226","author":"B Espinoza","year":"2013","unstructured":"Espinoza, B., Smith, G.: Min-entropy as a resource. Inf. Comput. 226, 57\u201375 (2013)","journal-title":"Inf. Comput."},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/11545262_5","volume-title":"Cryptographic Hardware and Embedded Systems \u2013 CHES 2005","author":"PJ Green","year":"2005","unstructured":"Green, P.J., Noad, R., Smart, N.P.: Further hidden Markov model cryptanalysis. In: Rao, J.R., Sunar, B. (eds.) CHES 2005. LNCS, vol. 3659, pp. 61\u201374. Springer, Heidelberg (2005). doi:\n10.1007\/11545262_5"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-540-45238-6_3","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2003","author":"C Karlof","year":"2003","unstructured":"Karlof, C., Wagner, D.: Hidden Markov model cryptanalysis. In: Walter, C.D., Ko\u00e7, \u00c7.K., Paar, C. (eds.) CHES 2003. LNCS, vol. 2779, pp. 17\u201334. Springer, Heidelberg (2003). doi:\n10.1007\/978-3-540-45238-6_3"},{"key":"11_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-319-10696-0_28","volume-title":"Quantitative Evaluation of Systems","author":"Y Kawamoto","year":"2014","unstructured":"Kawamoto, Y., Chatzikokolakis, K., Palamidessi, C.: Compositionality results for quantitative information flow. In: Norman, G., Sanders, W. (eds.) QEST 2014. LNCS, vol. 8657, pp. 368\u2013383. Springer, Cham (2014). doi:\n10.1007\/978-3-319-10696-0_28"},{"key":"11_CR16","unstructured":"Lenstra, A.K., Hughes, J.P., Augier, M., Kleinjung, T., Wachter, C.: Ron was wrong, Whit is right. Technical report, EPFL IC LACAL, Station 14, CH-1015 Lausanne, Switzerland (2012)"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Mardziel, P., Alvim, M.S., Hicks, M.W., Clarkson, M.R.: Quantifying information flow for dynamic secrets. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, 18\u201321 May 2014, pp. 540\u2013555 (2014)","DOI":"10.1109\/SP.2014.41"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-14162-1_19","volume-title":"Automata, Languages and Programming","author":"A McIver","year":"2010","unstructured":"McIver, A., Meinicke, L., Morgan, C.: Compositional closure for bayes risk in probabilistic noninterference. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010. LNCS, vol. 6199, pp. 223\u2013235. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14162-1_19"},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1017\/S0960129513000625","volume":"25","author":"A McIver","year":"2014","unstructured":"McIver, A., Meinicke, L., Morgan, C.: Hidden-Markov program algebra with iteration. Math. Struct. Comput. Sci. 25, 320\u2013360 (2014)","journal-title":"Math. Struct. Comput. Sci."},{"key":"11_CR20","doi-asserted-by":"crossref","unstructured":"McIver, A., Morgan, C., Rabehaja, T.: Abstract Hidden Markov Models: a monadic account of quantitative information flow. In: Proceedings of LICS 2015 (2015)","DOI":"10.1109\/LICS.2015.61"},{"key":"11_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-642-54792-8_5","volume-title":"Principles of Security and Trust","author":"A McIver","year":"2014","unstructured":"McIver, A., Morgan, C., Smith, G., Espinoza, B., Meinicke, L.: Abstract channels and their robust information-leakage ordering. In: Abadi, M., Kremer, S. (eds.) POST 2014. LNCS, vol. 8414, pp. 83\u2013102. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-642-54792-8_5"},{"key":"11_CR22","volume-title":"Programming from Specifications","author":"CC Morgan","year":"1994","unstructured":"Morgan, C.C.: Programming from Specifications, 2nd edn. Prentice-Hall, Upper Saddle River (1994). \nhttp:\/\/www.cs.ox.ac.uk\/publications\/books\/PfS\/","edition":"2"},{"key":"11_CR23","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: Alfaro, L. (ed.) FoSSaCS 2009. LNCS, vol. 5504, pp. 288\u2013302. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-00596-1_21"},{"key":"11_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/3-540-45760-7_5","volume-title":"Topics in Cryptology \u2014 CT-RSA 2002","author":"CD Walter","year":"2002","unstructured":"Walter, C.D.: MIST: an efficient, randomized exponentiation algorithm for resisting power analysis. In: Preneel, B. (ed.) CT-RSA 2002. LNCS, vol. 2271, pp. 53\u201366. Springer, Heidelberg (2002). doi:\n10.1007\/3-540-45760-7_5"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60225-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T02:30:20Z","timestamp":1495852220000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-60225-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319602240","9783319602257"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60225-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}