{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:35:46Z","timestamp":1740116146096,"version":"3.37.3"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,5,18]],"date-time":"2010-05-18T00:00:00Z","timestamp":1274140800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1007\/s10207-010-0107-0","type":"journal-article","created":{"date-parts":[[2010,5,17]],"date-time":"2010-05-17T10:21:52Z","timestamp":1274091712000},"page":"83-106","source":"Crossref","is-referenced-by-count":6,"title":["Probabilistic timing covert channels: to close or not to close?"],"prefix":"10.1007","volume":"10","author":[{"given":"Alessandra","family":"Di Pierro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Herbert","family":"Wiklicky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,5,18]]},"reference":[{"key":"107_CR1","unstructured":"ABE\u201908: Workshop on Approximate Behavioural Equivalences (2008) http:\/\/www.cse.yorku.ca\/abe08"},{"key":"107_CR2","doi-asserted-by":"crossref","unstructured":"Agat, J.: Transforming out timing leaks. In: Proceedings of POPL\u201900, pp. 40\u201353. ACM Press, New York (2000)","DOI":"10.1145\/325694.325702"},{"key":"107_CR3","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bravetti, M., Di Pierro, A., Gorrieri, R., Hankin, H., Wiklicky, H.: Two formal approaches for approximating noninterference properties. In: Foundations of Security Analysis and Design II\u2014Tutorial Lectures, vol. 2946 of Lecture Notes in Computer Science, pp. 1\u201346. Springer, Berlin (2002)","DOI":"10.1007\/978-3-540-24631-2_1"},{"issue":"2","key":"107_CR4","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur R., Dill D.L.: A theory of timed automata. Theor. Comput. Sci. 126(2), 183\u2013235 (1994)","journal-title":"Theor. Comput. Sci."},{"key":"107_CR5","volume-title":"Optima and Equilibria\u2014An Introduction to Nonlinear Analysis, vol. 140 of Graduate Texts in Mathematics","author":"J.-P. Aubin","year":"1993","unstructured":"Aubin J.-P.: Optima and Equilibria\u2014An Introduction to Nonlinear Analysis, vol. 140 of Graduate Texts in Mathematics. Springer, Berlin (1993)"},{"key":"107_CR6","doi-asserted-by":"crossref","unstructured":"Boreale, M.: Quantifying information leakage in process calculi. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) Proceedings of ICALP\u201906, vol. 4052 of Lecture Notes in Computer Science, pp. 119\u2013131. Springer, Berlin (2006)","DOI":"10.1007\/11787006_11"},{"key":"107_CR7","doi-asserted-by":"crossref","unstructured":"Clarkson, M.R., Myers, A.C., Schneider, F.B.: Belief in information flow. In: Proceedings of 18th Computer Security Foundations Workshop, IEEE, pp. 31\u201345 (2005)","DOI":"10.1109\/CSFW.2005.10"},{"issue":"2","key":"107_CR8","doi-asserted-by":"crossref","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. J. Log. Comput. 15(2), 181\u2013199 (2005)","journal-title":"J. Log. Comput."},{"issue":"6","key":"107_CR9","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/S0020-0190(03)00343-0","volume":"87","author":"S. Derisavi","year":"2003","unstructured":"Derisavi S., Hermanns H., Sanders W.H.: Optimal state-space lumping in Markov chains. Inf. Process. Lett. 87(6), 309\u2013315 (2003)","journal-title":"Inf. Process. Lett."},{"key":"107_CR10","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: Metrics for labeled Markov systems. In: Proceedings of CONCUR\u201999, vol. 1664 of Lecture Notes in Computer Science, pp. 258\u2013273. Springer, Berlin (1999)","DOI":"10.1007\/3-540-48320-9_19"},{"key":"107_CR11","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proceedings of LICS\u201902, IEEE, pp. 413\u2013422 (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"key":"107_CR12","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Approximate non- interference. In: Proceedings of CSFW\u201902, IEEE Computer Society, pp. 3\u201317. (2002)","DOI":"10.1109\/CSFW.2002.1021803"},{"key":"107_CR13","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Quantitative relations and approximate process equivalences. In: Lugiez, D. (ed.) Proceedings of CONCUR\u201903, vol. 2761 of Lecture Notes in Computer Science, pp. 508\u2013522. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-45187-7_33"},{"issue":"1","key":"107_CR14","doi-asserted-by":"crossref","first-page":"37","DOI":"10.3233\/JCS-2004-12103","volume":"12","author":"A. Di Pierro","year":"2004","unstructured":"Di Pierro A., Hankin C., Wiklicky H.: Approximate non- interference. J. Comput. Secur. 12(1), 37\u201381 (2004)","journal-title":"J. Comput. Secur."},{"issue":"1","key":"107_CR15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.tcs.2005.03.002","volume":"340","author":"A. Di Pierro","year":"2005","unstructured":"Di Pierro A., Hankin C., Wiklicky H.: Measuring the confinement of probabilistic systems. Theor. Comp. Sci. 340(1), 3\u201356 (2005)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"107_CR16","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.jlap.2007.02.007","volume":"72","author":"A. Di Pierro","year":"2007","unstructured":"Di Pierro A., Hankin C., Siveroni I., Wiklicky H.: Tempus fugit: How to plug it. J. Log. Algebr. Program. 72(2), 173\u2013190 (2007)","journal-title":"J. Log. Algebr. Program."},{"key":"107_CR17","doi-asserted-by":"crossref","unstructured":"Di Pierro, A., Hankin, C., Wiklicky, H.: Quantifying timing leaks and cost optimisation. In: Chen, L., Ryan, M.D., Wang, G. (eds.) Proceedings of 10th International Conference on Information and Communications Security, vol. 5308 of Lecture Notes in Computer Science, pp. 81\u201396. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-88625-9_6"},{"issue":"1\u20133","key":"107_CR18","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1016\/S0304-3975(03)00361-X","volume":"311","author":"A. Dovier","year":"2004","unstructured":"Dovier A., Piazza C., Policriti A.: An efficient algorithm for computing bisimulation equivalence. Theor. Comp. Sci. 311(1\u20133), 221\u2013256 (2004)","journal-title":"Theor. Comp. Sci."},{"key":"107_CR19","unstructured":"Eaton, J.W.: Octave. Technical report, Free Software Foundation, Boston, MA (2005)"},{"key":"107_CR20","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties (Part I: Information flow). In: Foundations of Security Analysis and Design\u2014Tutorial Lectures, vol. 2171 of Lecture Notes in Computer Science, pp. 331\u2013396. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45608-2_6"},{"key":"107_CR21","doi-asserted-by":"crossref","unstructured":"Goguen, J., Meseguer, J.: Security policies and security models. In: Symposium on Security and Privacy, IEEE, pp. 11\u201320 (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"107_CR22","volume-title":"Introduction to Operations Research","author":"F.S. Hiller","year":"2001","unstructured":"Hiller F.S., Lieberman G.J.: Introduction to Operations Research, 7th edn. McGraw-Hill, Maidenherd (2001)","edition":"7"},{"key":"107_CR23","first-page":"685","volume-title":"Probabilistic Extentions of Process Algebras","author":"B. Jonsson","year":"2001","unstructured":"Jonsson B., Yi W., Larsen K: Probabilistic Extentions of Process Algebras, pp. 685\u2013710. Elsevier Science, Amsterdam (2001)"},{"key":"107_CR24","doi-asserted-by":"crossref","unstructured":"Kocher, P.: Timing attacks on implementations of Diffie-Hellman, RSA, DSS, and other systems. In: Proceedings of CRYPTO \u201996, vol. 1109 of Lecture Notes in Computer Science, pp. 104\u2013113. Springer, Berlin (1996)","DOI":"10.1007\/3-540-68697-5_9"},{"key":"107_CR25","doi-asserted-by":"crossref","unstructured":"K\u00f6pf B., D\u00fcrmuth, M.: A provably secure and efficient countermeasure against timing attack. In: Proceedings of 22nd Computer Security Foundations Symposium, IEEE (2009)","DOI":"10.1109\/CSF.2009.21"},{"key":"107_CR26","doi-asserted-by":"crossref","unstructured":"Kwiatkowska, M., Norman, G., Sproston, J., Wang, F.: Symbolic model checking for probabilistic timed automata. In: Lakhnech, Y., Yovine, S. (eds.) Proceedings of FORMATS\/FTRTFT\u201904, vol. 3253 of Lecture Notes in Computer Science, pp. 293\u2013308. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-30206-3_21"},{"key":"107_CR27","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K. Larsen","year":"1991","unstructured":"Larsen K., Skou A.: Bisimulation through probabilistic testing. Inf. Comput. 94, 1\u201328 (1991)","journal-title":"Inf. Comput."},{"key":"107_CR28","doi-asserted-by":"crossref","unstructured":"Lowe, G.: Quantifying information flow. In: Proceedings of 15th Computer Security Foundations Workshop, IEEE, pp. 18\u201331 (2002)","DOI":"10.1109\/CSFW.2002.1021804"},{"key":"107_CR29","doi-asserted-by":"crossref","unstructured":"Mclean, J.: Security models and information flow. In: Proceedings of IEEE Symposium on Security and Privacy, pp. 180\u2013189. (1990)","DOI":"10.21236\/ADA462529"},{"issue":"6","key":"107_CR30","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1137\/0216062","volume":"16","author":"R. Paige","year":"1987","unstructured":"Paige R., Tarjan R.: Three partition refinement algorithms. SIAM J. Comput. 16(6), 973\u2013989 (1987)","journal-title":"SIAM J. Comput."},{"issue":"1\/2","key":"107_CR31","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/JCS-2001-91-204","volume":"9","author":"P. Ryan","year":"2001","unstructured":"Ryan P., Schneider S.: Process algebra and non-interference. J. Comput. Secur. 9(1\/2), 75\u2013103 (2001) Special Issue on CSFW-12","journal-title":"J. Comput. Secur."},{"key":"107_CR32","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511813627","volume-title":"Probability and Random Variables","author":"D. Stirzaker","year":"1999","unstructured":"Stirzaker D.: Probability and Random Variables. Cambridge University Press, Cambridge (1999)"},{"key":"107_CR33","doi-asserted-by":"crossref","unstructured":"Smith, G.: On the foundations of quantitative information flow. In: De Alfero, L. (ed.) Proceedings of FOSSACS\u201909, vol. 5504 of Lecture Notes in Computer Science, pp. 288\u2013302. Springer, Berlin (2009)","DOI":"10.1007\/978-3-642-00596-1_21"},{"key":"107_CR34","doi-asserted-by":"crossref","unstructured":"Smith, G., Volpano, D.: Secure information flow in a multi-threaded imperative language. In: Proceedings of POPL\u201998, pp. 355\u2013364. ACM Press, New York (1998)","DOI":"10.1145\/268946.268975"},{"key":"107_CR35","unstructured":"Software Bugtraps: Software that makes software better. Economist 386(8570) (March 2008)"},{"issue":"3","key":"107_CR36","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1145\/300307.300311","volume":"29","author":"D. Volpano","year":"1998","unstructured":"Volpano D., Smith G.: Confinement properties for programming languages. SIGACT News 29(3), 33\u201342 (1998)","journal-title":"SIGACT News"},{"key":"107_CR37","doi-asserted-by":"crossref","unstructured":"van Breugel, F.: A behavioural pseudometric for metric labelled transition systems. In: Abadi, M., de Alfaro, L. (eds.) Proceedings of CONCUR\u201905, vol. 3653 of Lecture Notes in Computer Science, pp. 141\u2013155. Springer, Berlin (2005)","DOI":"10.1007\/11539452_14"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0107-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-010-0107-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-010-0107-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,20]],"date-time":"2025-02-20T22:27:15Z","timestamp":1740090435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-010-0107-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,18]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,6]]}},"alternative-id":["107"],"URL":"https:\/\/doi.org\/10.1007\/s10207-010-0107-0","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2010,5,18]]}}}