{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:10:14Z","timestamp":1746159014461,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642547911"},{"type":"electronic","value":"9783642547928"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54792-8_6","type":"book-chapter","created":{"date-parts":[[2014,3,21]],"date-time":"2014-03-21T13:35:12Z","timestamp":1395408912000},"page":"103-119","source":"Crossref","is-referenced-by-count":2,"title":["Quantitative Information Flow in Boolean Programs"],"prefix":"10.1007","author":[{"given":"Rohit","family":"Chadha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dileep","family":"Kini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mahesh","family":"Viswanathan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agat, J.: Transforming out timing leaks. In: POPL 2000, pp. 40\u201353 (2000)","DOI":"10.1145\/325694.325702"},{"issue":"5","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/070697926","volume":"38","author":"E. Allender","year":"2009","unstructured":"Allender, E., B\u00fcrgisser, P., Kjeldgaard-Pedersen, J., Miltersen, P.B.: On the complexity of numerical analysis. SIAM Journal on Computing\u00a038(5), 1987\u20132006 (2009)","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","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"},{"issue":"5","key":"6_CR4","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.comnet.2005.01.010","volume":"48","author":"D. Brumley","year":"2005","unstructured":"Brumley, D., Boneh, D.: Remote timing attacks are practical. Computer Networks\u00a048(5), 701\u2013716 (2005)","journal-title":"Computer Networks"},{"key":"6_CR5","unstructured":"Chadha, R., Ummels, M.: The complexity of quantitative information flow in recursive programs. In: FSTTCS, pp. 534\u2013545 (2012)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-12002-2_33","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"K. Chatzikokolakis","year":"2010","unstructured":"Chatzikokolakis, K., Chothia, T., Guha, A.: Statistical measurement of information leakage. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 390\u2013404. Springer, Heidelberg (2010)"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Probability of error in information-hiding protocols. In: CSF 2007, pp. 341\u2013354 (2007)","DOI":"10.1109\/CSF.2007.27"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Chatzikokolakis, K., Palamidessi, C., Panangaden, P.: Anonymity protocols as noisy channels. Information and Computation\u00a0206(2-4) (2008)","DOI":"10.1016\/j.ic.2007.07.003"},{"key":"6_CR9","first-page":"49","volume":"112","author":"D. Clark","year":"1984","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantified interference for a while language. Electronic Notes in Theoretical Computer Science (Proc. QAPL\u00a02004)\u00a0112, 49\u2013166 (1984)","journal-title":"Electronic Notes in Theoretical Computer Science (Proc. QAPL\u00a02004)"},{"issue":"2","key":"6_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1093\/logcom\/exi009","volume":"15","author":"D. Clark","year":"2005","unstructured":"Clark, D., Hunt, S., Malacaria, P.: Quantitative information flow, relations and polymorphic types. Journal of Logic Computation\u00a015(2), 181\u2013199 (2005)","journal-title":"Journal of Logic Computation"},{"issue":"3","key":"6_CR11","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. Journal of Computer Security\u00a015(3), 321\u2013371 (2007)","journal-title":"Journal of Computer Security"},{"key":"6_CR12","unstructured":"Denning, D.E.R.: Cryptography and Data Security. Addison-Wesley (1982)"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Goguen, J.A., Meseguer, J.: Security policies and security models. In: IEEE Symposium on Security and Privacy, pp. 11\u201320 (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Gray III, J.W.: Toward a mathematical foundation for information flow security. In: IEEE Symposium on Security and Privacy, pp. 21\u201335 (1991)","DOI":"10.1109\/RISP.1991.130769"},{"issue":"4","key":"6_CR15","doi-asserted-by":"publisher","first-page":"695","DOI":"10.1016\/S0022-0000(02)00025-9","volume":"65","author":"W. Hesse","year":"2002","unstructured":"Hesse, W., Allender, E., Mix Barrington, D.A.: Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computing Systems and Sciences\u00a065(4), 695\u2013716 (2002)","journal-title":"Journal of Computing Systems and Sciences"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Basin, D.A.: An information-theoretic model for adaptive side-channel attacks. In: ACM Conference on Computer and Communications Security, pp. 286\u2013296 (2007)","DOI":"10.1145\/1315245.1315282"},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., D\u00fcrmuth, M.: A provably secure and efficient countermeasure against timing attacks. In: CSF\u00a02009, pp. 324\u2013335 (2009)","DOI":"10.1109\/CSF.2009.21"},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"K\u00f6pf, B., Rybalchenko, A.: Approximation and randomization for quantitative information-flow analysis. In: CSF 2010, pp. 3\u201314 (2010)","DOI":"10.1109\/CSF.2010.8"},{"key":"6_CR19","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":"6_CR20","doi-asserted-by":"crossref","unstructured":"Reynolds, J.C.: Syntactic control of interference. In: POPL\u00a01978, pp. 39\u201346 (1978)","DOI":"10.1145\/512760.512766"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Shannon, C.: A mathematical theory of communication. The Bell System Technical Journal\u00a027, 379\u2013423, 623\u2013656 (1948)","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"key":"6_CR22","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":"6_CR23","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.entcs.2006.11.002","volume":"168","author":"R. Meyden van der","year":"2007","unstructured":"van der Meyden, R., Zhang, C.: Algorithmic verification of noninterference properties. Electronic Notes in Theoretical Computer Science\u00a0168, 61\u201375 (2007)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"\u010cern\u00fd, P., Chatterjee, K., Henzinger, T.A.: The complexity of quantitative information flow problems. In: CSF 2011, pp. 205\u2013217 (2011)","DOI":"10.1109\/CSF.2011.21"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-642-15497-3_22","volume-title":"Computer Security \u2013 ESORICS 2010","author":"H. Yasuoka","year":"2010","unstructured":"Yasuoka, H., Terauchi, T.: On bounding problems of quantitative information flow. In: Gritzalis, D., Preneel, B., Theoharidou, M. (eds.) ESORICS 2010. LNCS, vol.\u00a06345, pp. 357\u2013372. Springer, Heidelberg (2010)"},{"key":"6_CR26","doi-asserted-by":"crossref","unstructured":"Yasuoka, H., Terauchi, T.: Quantitative information flow - verification hardness and possibilities. In: CSF 2010, pp. 15\u201327 (2010)","DOI":"10.1109\/CSF.2010.9"},{"key":"6_CR27","doi-asserted-by":"crossref","unstructured":"Yasuoka, H., Terauchi, T.: Quantitative information flow as safety and liveness hyperproperties. In: QAPL\u00a02012, pp. 77\u201391 (2012)","DOI":"10.4204\/EPTCS.85.6"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T03:47:02Z","timestamp":1746157622000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54792-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642547911","9783642547928"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54792-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}