{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,12]],"date-time":"2025-08-12T21:24:02Z","timestamp":1755033842348},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642411564"},{"type":"electronic","value":"9783642411571"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-41157-1_13","type":"book-chapter","created":{"date-parts":[[2013,9,4]],"date-time":"2013-09-04T10:23:39Z","timestamp":1378290219000},"page":"198-212","source":"Crossref","is-referenced-by-count":3,"title":["Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus"],"prefix":"10.1007","author":[{"given":"Lili","family":"Xu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-642-12002-2_32","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M.E. Andr\u00e9s","year":"2010","unstructured":"Andr\u00e9s, M.E., Palamidessi, C., van Rossum, P., Smith, G.: Computing the leakage of information-hiding systems. In: Esparza, J., Majumdar, R. (eds.) TACAS 2010. LNCS, vol.\u00a06015, pp. 373\u2013389. Springer, Heidelberg (2010)"},{"key":"13_CR2","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_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/11539452_16","volume-title":"CONCUR 2005 \u2013 Concurrency Theory","author":"M. Bhargava","year":"2005","unstructured":"Bhargava, M., Palamidessi, C.: Probabilistic anonymity. In: Abadi, M., de Alfaro, L. (eds.) CONCUR 2005. LNCS, vol.\u00a03653, pp. 171\u2013185. Springer, Heidelberg (2005)"},{"key":"13_CR4","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)"},{"issue":"1-2","key":"13_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/j.tcs.2006.08.033","volume":"367","author":"K. Chatzikokolakis","year":"2006","unstructured":"Chatzikokolakis, K., Palamidessi, C.: Probable innocence revisited. Theor. Comp. Sci.\u00a0367(1-2), 123\u2013138 (2006)","journal-title":"Theor. Comp. Sci."},{"key":"13_CR6","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_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/3-540-44702-4_4","volume-title":"Designing Privacy Enhancing Technologies","author":"I. Clarke","year":"2001","unstructured":"Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Federrath, H. (ed.) Anonymity 2000. LNCS, vol.\u00a02009, pp. 44\u201366. Springer, Heidelberg (2001)"},{"key":"13_CR8","doi-asserted-by":"crossref","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory. J. Wiley & Sons, Inc. (1991)","DOI":"10.1002\/0471200611"},{"key":"13_CR9","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_CR10","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, Part II. LNCS, vol.\u00a04052, pp. 1\u201312. Springer, Heidelberg (2006)"},{"issue":"1","key":"13_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1866739.1866758","volume":"54","author":"C. Dwork","year":"2011","unstructured":"Dwork, C.: A firm foundation for private data analysis. Communications of the ACM\u00a054(1), 86\u201396 (2011)","journal-title":"Communications of the ACM"},{"key":"13_CR12","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lei, J.: Differential privacy and robust statistics. In: Proc. of the 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 371\u2013380. ACM (2009)","DOI":"10.1145\/1536414.1536466"},{"issue":"3","key":"13_CR13","doi-asserted-by":"crossref","first-page":"483","DOI":"10.3233\/JCS-2005-13305","volume":"13","author":"J.Y. Halpern","year":"2005","unstructured":"Halpern, J.Y., O\u2019Neill, K.R.: Anonymity and information hiding in multiagent systems. J. of Comp. Security\u00a013(3), 483\u2013512 (2005)","journal-title":"J. of Comp. Security"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-12459-4_11","volume-title":"Formal Aspects in Security and Trust","author":"S. Hamadou","year":"2010","unstructured":"Hamadou, S., Palamidessi, C., Sassone, V., ElSalamouny, E.: Probable innocence in the presence of independent knowledge. In: Degano, P., Guttman, J.D. (eds.) FAST 2009. LNCS, vol.\u00a05983, pp. 141\u2013156. Springer, Heidelberg (2010)"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"McSherry, F.: Privacy integrated queries: an extensible platform for privacy-preserving data analysis. In: Proc. of the ACM SIGMOD Int. Conf. on Management of Data, pp. 19\u201330. ACM (2009)","DOI":"10.1145\/1559845.1559850"},{"key":"13_CR16","unstructured":"Milner, R.: Communication and Concurrency. Series in Comp. Sci. Prentice Hall (1989)"},{"key":"13_CR17","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_CR18","doi-asserted-by":"crossref","unstructured":"Reed, J., Pierce, B.C.: Distance makes the types grow stronger: a calculus for differential privacy. In: Proceeding of the 15th ACM SIGPLAN International Conference on Functional Programming (ICFP), pp. 157\u2013168. ACM (2010)","DOI":"10.1145\/1863543.1863568"},{"issue":"1","key":"13_CR19","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/290163.290168","volume":"1","author":"M.K. Reiter","year":"1998","unstructured":"Reiter, M.K., Rubin, A.D.: Crowds: anonymity for Web transactions. ACM Trans. on Information and System Security\u00a01(1), 66\u201392 (1998)","journal-title":"ACM Trans. on Information and System Security"},{"key":"13_CR20","unstructured":"Roy, I., Setty, S.T.V., Kilzer, A., Shmatikov, V., Witchel, E.: Airavat: security and privacy for MapReduce. In: Proc. of the 7th USENIX Symposium on Networked Systems Design and Implementation (NSDI), pp. 297\u2013312. USENIX Association (2010)"},{"key":"13_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/978-3-642-15640-3_7","volume-title":"Trustworthly Global Computing","author":"V. Sassone","year":"2010","unstructured":"Sassone, V., ElSalamouny, E., Hamadou, S.: Trust in crowds: Probabilistic behaviour in anonymity protocols. In: Wirsing, M., Hofmann, M., Rauschmayer, A. (eds.) TGC 2010, LNCS, vol.\u00a06084, pp. 88\u2013102. Springer, Heidelberg (2010)"},{"key":"13_CR22","unstructured":"Segala, R.: Modeling and Verification of Randomized Distributed Real-Time Systems. PhD thesis, Tech. Rep. MIT\/LCS\/TR-676 (1995)"},{"key":"13_CR23","unstructured":"Syverson, P.F., Goldschlag, D.M., Reed, M.G.: Anonymous connections and onion routing. In: Proc. of S&P, pp. 44\u201354 (1997)"},{"key":"13_CR24","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.entcs.2011.09.015","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). Electron. Notes Theor. Comput. Sci.\u00a0276, 61\u201379 (2011)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR25","unstructured":"Xu, L.: Modular Reasoning about Differential Privacy in a Probabilistic Process Calculus (full version). Research report, INRIA (2012), \n                  \n                    http:\/\/hal.inria.fr\/hal-00691284"}],"container-title":["Lecture Notes in Computer Science","Trustworthy Global Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41157-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T22:07:58Z","timestamp":1558303678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41157-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642411564","9783642411571"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41157-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}