{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:33Z","timestamp":1762458573463},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T00:00:00Z","timestamp":1192492800000},"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":[[2008,6]]},"DOI":"10.1007\/s10207-007-0050-x","type":"journal-article","created":{"date-parts":[[2007,10,15]],"date-time":"2007-10-15T02:03:36Z","timestamp":1192413816000},"page":"219-242","source":"Crossref","is-referenced-by-count":15,"title":["Estimating the maximum information leakage"],"prefix":"10.1007","volume":"7","author":[{"given":"Alessandro","family":"Aldini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessandra","family":"Di Pierro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,10,16]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1016\/j.scico.2005.07.010","volume":"63","author":"A. Aldini","year":"2006","unstructured":"Aldini A. (2006). Classification of security properties in a linda-like process algebra. Sci. Comput. Program. 63: 16\u201338","journal-title":"Sci. Comput. Program."},{"key":"50_CR2","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bernardo, M.: An integrated view of security analysis and performance evaluation: Trading qos with covert channel bandwidth. In: SAFECOMP\u201904: Proceedings of the 23rd International Conference on Computer Safety, Reliability and Security, Lecture Notes in Computer Science, vol. 3219, pp. 283\u2013296. Springer (2004)","DOI":"10.1007\/978-3-540-30138-7_24"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Aldini, A., Bravetti, M., Di Pierro, A., Gorrieri, R., Hankin, C., Wiklicky, H.: Two formal approaches for approximating noninterference properties. In: Focardi and Gorrieri [18], pp. 1\u201343","DOI":"10.1007\/978-3-540-24631-2_1"},{"issue":"1","key":"50_CR4","doi-asserted-by":"crossref","first-page":"191","DOI":"10.3233\/JCS-2004-12202","volume":"12","author":"A. Aldini","year":"2004","unstructured":"Aldini A., Bravetti M. and Gorrieri R. (2004). A process algebraic approach for the analysis of probabilistic non-inetrference. J. Comput. Security 12(1): 191\u2013245","journal-title":"J. Comput. Security"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Aldini, A., Di Pierro, A.: A quantitative approach to noninterference for probabilistic systems. In: Bravetti M., Gorrieri G. (eds.) Proceedings of the MEFISTO Project 2003, Formal Methods for Security and Time, Electronic Notes in Theoretical Computer Science, vol. 99, pp. 155\u2013182. Elsevier (2004)","DOI":"10.1016\/j.entcs.2004.02.007"},{"key":"50_CR6","doi-asserted-by":"crossref","unstructured":"Aldini, A., Di Pierro, A.: On quantitative analysis of probabilistic protocols. In: Cerone, A., Pierro, A.D. (eds.) QAPL 2004, 2nd Workshop on Quantitative Aspects of Programming Languages, Electronic Notes in Theoretical Computer Science, vol. 112, pp. 131\u2013148. Elsevier (2005)","DOI":"10.1016\/j.entcs.2004.01.019"},{"key":"50_CR7","unstructured":"Aldini, A., Di Pierro, A.: Noninterference and the most powerful probabilistic adversary. In: WITS 2006, 6th International Workshop on Issues in the Theory of Security (2006)"},{"key":"50_CR8","doi-asserted-by":"crossref","unstructured":"Aldini, A., Gorrieri, R.: Security analysis of a probabilistic non-repudiation protocol. In: PAPM-PROBMIV 2002, 2nd Joint International Workshop on Process Algebra and Performance Modelling, Probabilistic Methods in Verification, Lecture Notes in Computer Science, vol. 2399, pp. 17\u201336. Springer (2002)","DOI":"10.1007\/3-540-45605-8_3"},{"key":"50_CR9","doi-asserted-by":"crossref","unstructured":"Backes, M.: Quantifying probabilistic information flow in computational reactive systems. In: De Capitani di Vimercati, S., Syverson, P.F., Gollmann, D. (eds.) ESORICS \u201905: Proceedings of the 10th European Symposium on Research in Computer Security, Lecture Notes in Computer Science, vol. 3679, pp. 336\u2013354. Springer (2005)","DOI":"10.1007\/11555827_20"},{"key":"50_CR10","doi-asserted-by":"crossref","unstructured":"Backes, M., Pfitzmann, B., Waidner, M.: A composable yptographic library with nested operations. In: CCS\u201903: Proceedings of the 10th ACM conference on Computer and Communications Security, pp. 220\u2013230. ACM Press, New York, (2003). doi: 10.1145\/948109.948140","DOI":"10.1145\/948109.948140"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Baier, C., Hermanns, H.: Weak bisimulation for fully probabilistic processes. In: Proceedings of the 9th International Conference on Computer Aided Verification, Lecture Notes in Computer Science, vol. 1254, pp. 119\u2013130. Springer (1997)","DOI":"10.1007\/3-540-63166-6_14"},{"key":"50_CR12","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1016\/S0304-3975(01)00344-9","volume":"290","author":"M. Bravetti","year":"2003","unstructured":"Bravetti M. and Aldini A. (2003). Disete time generative-reactive probabilistic processes with different advancing speeds. Theor. Comput. Sci. 290: 355\u2013406","journal-title":"Theor. Comput. Sci."},{"key":"50_CR13","first-page":"40","volume":"63","author":"R. Canetti","year":"2005","unstructured":"Canetti R., Cheung L., Kaynar D., Liskov M., Lynch N., Pereira O. and Segala R. (2005). Using probabilistic I\/O automata to improve the analysis of cryptographic protocols. ERCIM News 63: 40\u201341","journal-title":"ERCIM News"},{"key":"50_CR14","unstructured":"Deng, Y., Palamidessi, C., Pang, J.: Weak probabilistic anonymity. In: SecCo 2005, 2nd International Workshop on Security Issues in Coordination Models, Languages, and Systems, Electronic Notes in Theoretical Computer Science (2005)"},{"issue":"1","key":"50_CR15","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. and Wiklicky H. (2004). Approximate non-interference. J. Comput. Security 12(1): 37\u201381","journal-title":"J. Comput. Security"},{"issue":"1","key":"50_CR16","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. and Wiklicky H. (2005). Measuring the confinement of probabilistic systems. Theoretical Computer Science 340(1): 3\u201356","journal-title":"Theoretical Computer Science"},{"key":"50_CR17","doi-asserted-by":"crossref","first-page":"5","DOI":"10.3233\/JCS-1994\/1995-3103","volume":"3","author":"R. Focardi","year":"1995","unstructured":"Focardi R. and Gorrieri R. (1995). A classification of security properties. J. Comput. Security 3: 5\u201333","journal-title":"J. Comput. Security"},{"key":"50_CR18","unstructured":"Focardi, R., Gorrieri, R. (eds.): Lecture Notes in Computer Science, vol. 2946. Springer (2004)"},{"key":"50_CR19","doi-asserted-by":"crossref","unstructured":"Focardi, R., Gorrieri, R., Martinelli, F.: Classification of security properties (part ii: Network security). In: Focardi and Gorrieri [18], pp. 139\u2013185","DOI":"10.1007\/978-3-540-24631-2_4"},{"key":"50_CR20","doi-asserted-by":"crossref","unstructured":"Goguen, J., Meseguer, J.: Security policy and security models. In: IEEE Symp. on Security and Privacy (SSP\u201982), pp. 11\u201320 (1982)","DOI":"10.1109\/SP.1982.10014"},{"key":"50_CR21","unstructured":"Guttman, J., Nadel, M.E.: What needs securing. In: 1st IEEE Computer Security Foundations Workshop (CSFW-1 1988), pp. 34\u201357. New Hampshire, USA (1988)"},{"key":"50_CR22","volume-title":"Dynamic Probabilistic Systems","author":"R. Howard","year":"1971","unstructured":"Howard R. (1971). Dynamic Probabilistic Systems. Wiley, New York"},{"key":"50_CR23","doi-asserted-by":"crossref","unstructured":"Wittbold, J.T., Johnson, D.J.: Information flow in nondeterministic systems. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP\u201990), pp. 144\u2013161. IEEE Computer Society (1990)","DOI":"10.1109\/RISP.1990.63846"},{"key":"50_CR24","volume-title":"Queueing Systems","author":"L. Kleinrock","year":"1975","unstructured":"Kleinrock L. (1975). Queueing Systems. Wiley, New York"},{"key":"50_CR25","volume-title":"Communication and Concurrency","author":"R. Milner","year":"1989","unstructured":"Milner R. (1989). Communication and Concurrency. Prentice Hall, New Jersey"},{"key":"50_CR26","unstructured":"Markowitch, O., Roggeman, Y.R.: Probabilistic non-repudiation without trusted third party. In: Conference on Security in Communication Networks (SCN\u201999) (1999)"},{"key":"50_CR27","unstructured":"Erd\u00f6s, P., Graham, R.G.: Old and new problems and results in combinatorial number theory. Monographies de L\u2019Enseignement Math\u00e9matique 28 (1980)"},{"key":"50_CR28","doi-asserted-by":"crossref","unstructured":"Ramanathan, A., Mitchell, J.C., Scedrov, A., Teague, V.: Probabilistic bisimulation and equivalence for security analysis of network protocols. In: FoSSaCS 2004, Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 2987, pp. 468\u2013483. Springer (2004)","DOI":"10.1007\/978-3-540-24727-2_33"},{"key":"50_CR29","doi-asserted-by":"crossref","unstructured":"Roscoe, A.: Csp and determinism in security modelling. In: Proceedings of the IEEE Symposium on Security and Privacy (SSP\u201995), pp. 114\u2013127. IEEE Computer Society (1995)","DOI":"10.1109\/SECPRI.1995.398927"},{"key":"50_CR30","doi-asserted-by":"crossref","unstructured":"Ryan, P., Schneider, S.: Process algebra and non-interference. J. Comput. Security 9(1\/2), 75\u2013103 (2001). Special Issue on CSFW-12","DOI":"10.3233\/JCS-2001-91-204"},{"key":"50_CR31","doi-asserted-by":"crossref","unstructured":"Sabelfeld, A., Sands, D.: Probabilistic noninterference for multi-threaded programs. In: Proceedings of the 13th IEEE Computer Security Foundations Workshop, pp. 200\u2013214 (2000)","DOI":"10.1109\/CSFW.2000.856937"},{"key":"50_CR32","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-7091-9123-1_10","volume":"4","author":"W.H. Sanders","year":"1991","unstructured":"Sanders W.H. and Meyer J.F. (1991). A unified approach for specifying measures of performance, dependability and performability. Dependable Comput. Fault-Tolerant Syst. Dependable Comput. Critical Appl. 4: 215\u2013237","journal-title":"Dependable Comput. Fault-Tolerant Syst. Dependable Comput. Critical Appl."},{"key":"50_CR33","unstructured":"Segala, R.: Modeling and verification of randomized distributed real-time systems. Ph.D. thesis, MIT, Boston (MA) (1995)"},{"key":"50_CR34","first-page":"250","volume":"2","author":"R. Segala","year":"1995","unstructured":"Segala R. and Lynch N. (1995). Probabilistic simulations for probabilistic processes. Nordic J. Comput. 2: 250\u2013273","journal-title":"Nordic J. Comput."},{"key":"50_CR35","doi-asserted-by":"crossref","unstructured":"Smith, G.: Probabilistic noninterference through weak probabilistic bisimulation. In: Proceedings of the 16th IEEE Computer Security Foundations Workshop (CSFW-16 2003), pp. 3\u201313. IEEE Computer Society, Pacific Grove, (2003)","DOI":"10.1109\/CSFW.2003.1212701"},{"key":"50_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1006\/inco.1995.1123","volume":"121","author":"R. van Glabbeek","year":"1995","unstructured":"van Glabbeek R., Smolka S. and Steffen B. (1995). Reactive, generative and stratified models of probabilistic processes. Inf. Comput. 121: 59\u201380","journal-title":"Inf. Comput."},{"key":"50_CR37","doi-asserted-by":"crossref","unstructured":"Volpano, D., Smith, G.: Probabilistic noninterference in a concurrent language. In: Proceedings of the 11th IEEE Computer Security Foundations Workshop (CSFW \u201998), pp. 34\u201343. IEEE, Washington (1998)","DOI":"10.1109\/CSFW.1998.683153"},{"key":"50_CR38","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0304-3975(97)00056-X","volume":"176","author":"S. Wu","year":"1997","unstructured":"Wu S., Smolka S. and Stark E. (1997). Composition and behaviors of probabilistic i\/o automata. Theor. Comput. Sci. 176: 1\u201338","journal-title":"Theor. Comput. Sci."},{"key":"50_CR39","unstructured":"Zhu, Y., Bettati, R.: Anonymity vs. information leakage in anonymity systems. In: ICDCS 2005, 25th IEEE International Conference on Distributed Computing Systems, pp. 514\u2013524. IEEE Computer Society (2005)"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-007-0050-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10207-007-0050-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-007-0050-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:01:23Z","timestamp":1559113283000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10207-007-0050-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,10,16]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s10207-007-0050-x","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"value":"1615-5262","type":"print"},{"value":"1615-5270","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,10,16]]}}}