{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:24Z","timestamp":1763468184210,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662436127"},{"type":"electronic","value":"9783662436134"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43613-4_13","type":"book-chapter","created":{"date-parts":[[2014,5,20]],"date-time":"2014-05-20T07:56:40Z","timestamp":1400572600000},"page":"199-215","source":"Crossref","is-referenced-by-count":5,"title":["Metrics for Differential Privacy in Concurrent Systems"],"prefix":"10.1007","author":[{"given":"Lili","family":"Xu","sequence":"first","affiliation":[]},{"given":"Konstantinos","family":"Chatzikokolakis","sequence":"additional","affiliation":[]},{"given":"Huimin","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1998.2740","volume":"148","author":"M. Abadi","year":"1999","unstructured":"Abadi, M., Gordon, A.D.: A calculus for cryptographic protocols: The spi calculus. Inf. and Comp.\u00a0148(1), 1\u201370 (1999)","journal-title":"Inf. and Comp."},{"issue":"28","key":"13_CR2","doi-asserted-by":"publisher","first-page":"3072","DOI":"10.1016\/j.tcs.2011.02.045","volume":"412","author":"M.E. Andr\u00e9s","year":"2011","unstructured":"Andr\u00e9s, M.E., Palamidessi, C., Sokolova, A., Rossum, P.V.: Information Hiding in Probabilistic Concurrent Systems. TCS\u00a0412(28), 3072\u20133089 (2011)","journal-title":"TCS"},{"key":"13_CR3","doi-asserted-by":"crossref","unstructured":"Barthe, G., K\u00f6pf, B., Olmedo, F., B\u00e9guelin, S.Z.: Probabilistic relational reasoning for differential privacy. In: Proc. of POPL. ACM (2012)","DOI":"10.1145\/2103656.2103670"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/11787006_11","volume-title":"Automata, Languages and Programming","author":"M. Boreale","year":"2006","unstructured":"Boreale, M.: Quantifying information leakage in process calculi. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 119\u2013131. Springer, Heidelberg (2006)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-78499-9_31","volume-title":"Foundations of Software Science and Computational Structures","author":"C. Braun","year":"2008","unstructured":"Braun, C., Chatzikokolakis, K., Palamidessi, C.: Compositional methods for information-hiding. In: Amadio, R.M. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 443\u2013457. Springer, Heidelberg (2008)"},{"key":"13_CR6","unstructured":"Canetti, R., Cheung, L., Kaynar, D., Liskov, M., Lynch, N., Pereira, O., Segala, R.: Task-structured probabilistic i\/o automata. In: Proc. of WODES (2006)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-642-39077-7_5","volume-title":"Privacy Enhancing Technologies","author":"K. Chatzikokolakis","year":"2013","unstructured":"Chatzikokolakis, K., Andr\u00e9s, M.E., Bordenabe, N.E., Palamidessi, C.: Broadening the scope of differential privacy using metrics. In: De Cristofaro, E., Wright, M. (eds.) PETS 2013. LNCS, vol.\u00a07981, pp. 82\u2013102. Springer, Heidelberg (2013)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-540-74407-8_4","volume-title":"CONCUR 2007 \u2013 Concurrency Theory","author":"K. Chatzikokolakis","year":"2007","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Making random choices invisible to the scheduler. In: Caires, L., Vasconcelos, V.T. (eds.) CONCUR 2007. LNCS, vol.\u00a04703, pp. 42\u201358. Springer, Heidelberg (2007)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/BF00206326","volume":"1","author":"D. Chaum","year":"1988","unstructured":"Chaum, D.: The dining cryptographers problem: Unconditional sender and recipient untraceability. Journal of Cryptology\u00a01, 65\u201375 (1988)","journal-title":"Journal of Cryptology"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-540-73196-2_10","volume-title":"Formal Techniques for Networked and Distributed Systems \u2013 FORTE 2007","author":"D. Frutos-Escrig de","year":"2007","unstructured":"de Frutos-Escrig, D., Rosa-Velardo, F., Gregorio-Rodr\u00edguez, C.: New bisimulation semantics for distributed systems. In: Derrick, J., Vain, J. (eds.) FORTE 2007. LNCS, vol.\u00a04574, pp. 143\u2013159. Springer, Heidelberg (2007)"},{"key":"13_CR11","doi-asserted-by":"crossref","unstructured":"Deng, Y., Chothia, T., Palamidessi, C., Pang, J.: Metrics for action-labelled quantitative transition systems. In: Proc. of QAPL. ENTCS, vol.\u00a0153, pp. 79\u201396. Elsevier (2006)","DOI":"10.1016\/j.entcs.2005.10.033"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-75227-1_5","volume-title":"Formal Aspects in Security and Trust","author":"Y. Deng","year":"2007","unstructured":"Deng, Y., Pang, J., Wu, P.: Measuring anonymity with relative entropy. In: Dimitrakos, T., Martinelli, F., Ryan, P.Y.A., Schneider, S. (eds.) FAST 2006. LNCS, vol.\u00a04691, pp. 65\u201379. Springer, Heidelberg (2007)"},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Desharnais, J., Jagadeesan, R., Gupta, V., Panangaden, P.: The metric analogue of weak bisimulation for probabilistic processes. In: Proc. of LICS, pp. 413\u2013422. IEEE (2002)","DOI":"10.1109\/LICS.2002.1029849"},{"key":"13_CR14","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.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-45608-2_6","volume-title":"Foundations of Security Analysis and Design","author":"R. Focardi","year":"2001","unstructured":"Focardi, R., Gorrieri, R.: Classification of security properties (part i: Information flow). In: Focardi, R., Gorrieri, R. (eds.) FOSAD 2000. LNCS, vol.\u00a02171, pp. 331\u2013396. Springer, Heidelberg (2001)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Gaboardi, M., Haeberlen, A., Hsu, J., Narayan, A., Pierce, B.C.: Linear dependent types for differential privacy. In: POPL, pp. 357\u2013370 (2013)","DOI":"10.1145\/2480359.2429113"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BFb0039071","volume-title":"CONCUR \u201990","author":"C.-C. Jou","year":"1990","unstructured":"Jou, C.-C., Smolka, S.: Equivalences, congruences, and complete axiomatizations for probabilistic processes. In: Baeten, J.C.M., Klop, J.W. (eds.) CONCUR 1990. LNCS, vol.\u00a0458, pp. 367\u2013383. Springer, Heidelberg (1990)"},{"key":"13_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11562436_24","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2005","author":"A. Kiehn","year":"2005","unstructured":"Kiehn, A., Arun-Kumar, S.: Amortised bisimulations. In: Wang, F. (ed.) FORTE 2005. LNCS, vol.\u00a03731, pp. 320\u2013334. Springer, Heidelberg (2005)"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0890-5401(91)90030-6","volume":"94","author":"K.G. Larsen","year":"1991","unstructured":"Larsen, K.G., Skou, A.: Bisimulation through probabilistic testing. Inf. and Comp.\u00a094(1), 1\u201328 (1991)","journal-title":"Inf. and Comp."},{"key":"13_CR20","doi-asserted-by":"crossref","unstructured":"Machanavajjhala, A., Kifer, D., Abowd, J.M., Gehrke, J., Vilhuber, L.: Privacy: Theory meets practice on the map. In: Proc. of ICDE, pp. 277\u2013286. IEEE (2008)","DOI":"10.1109\/ICDE.2008.4497436"},{"key":"13_CR21","unstructured":"Milner, R.: Communication and Concurrency. Series in Comp. Sci. Prentice Hall (1989)"},{"key":"13_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-11145-7_17","volume-title":"Information and Communications Security","author":"C. Mu","year":"2009","unstructured":"Mu, C.: Measuring information flow in reactive processes. In: Qing, S., Mitchell, C.J., Wang, G. (eds.) ICICS 2009. LNCS, vol.\u00a05927, pp. 211\u2013225. Springer, Heidelberg (2009)"},{"key":"13_CR23","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: De-anonymizing social networks. In: Proc. of S&P, pp. 173\u2013187. IEEE (2009)","DOI":"10.1109\/SP.2009.22"},{"key":"13_CR24","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: a calculus for differential privacy. In: Proc. of ICFP, pp. 157\u2013168. ACM (2010)","DOI":"10.1145\/1932681.1863568"},{"issue":"1\/2","key":"13_CR25","doi-asserted-by":"crossref","first-page":"75","DOI":"10.3233\/JCS-2001-91-204","volume":"9","author":"P.Y.A. Ryan","year":"2001","unstructured":"Ryan, P.Y.A., Schneider, S.A.: Process algebra and non-interference. Journal of Computer Security\u00a09(1\/2), 75\u2013103 (2001)","journal-title":"Journal of Computer Security"},{"key":"13_CR26","doi-asserted-by":"crossref","unstructured":"Smith, G.: Probabilistic noninterference through weak probabilistic bisimulation. In: CSFW, pp. 3\u201313 (2003)","DOI":"10.1109\/CSFW.2003.1212701"},{"key":"13_CR27","first-page":"61","volume":"276","author":"M.C. Tschantz","year":"2011","unstructured":"Tschantz, M.C., Kaynar, D., Datta, A.: Formal verification of differential privacy for interactive systems (extended abstract). ENTCS\u00a0276, 61\u201379 (2011)","journal-title":"ENTCS"},{"key":"13_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-642-41157-1_13","volume-title":"Trustworthy Global Computing","author":"L. Xu","year":"2013","unstructured":"Xu, L.: Modular reasoning about differential privacy in a probabilistic process calculus. In: Palamidessi, C., Ryan, M.D. (eds.) TGC 2012. LNCS, vol.\u00a08191, pp. 198\u2013212. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Distributed Objects, Components, and Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43613-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T23:50:05Z","timestamp":1746229805000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43613-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662436127","9783662436134"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43613-4_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}