{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T06:41:27Z","timestamp":1761979287271,"version":"build-2065373602"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452208"},{"type":"electronic","value":"9783642452215"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45221-5_41","type":"book-chapter","created":{"date-parts":[[2013,12,5]],"date-time":"2013-12-05T09:28:23Z","timestamp":1386235703000},"page":"619-635","source":"Crossref","is-referenced-by-count":3,"title":["Defining Privacy Is Supposed to Be Easy"],"prefix":"10.1007","author":[{"given":"Sebastian A.","family":"M\u00f6dersheim","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Gro\u00df","sequence":"additional","affiliation":[]},{"given":"Luca","family":"Vigan\u00f2","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/3-540-36467-6_3","volume-title":"Privacy Enhancing Technologies","author":"M. Abadi","year":"2003","unstructured":"Abadi, M.: Private authentication. In: Dingledine, R., Syverson, P.F. (eds.) PET 2002. LNCS, vol.\u00a02482, pp. 27\u201340. Springer, Heidelberg (2003)"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Abadi, M., Cortier, V.: Deciding knowledge in security protocols under (many more) equational theories. In: CSFW, pp. 62\u201376. IEEE CS (2005)","DOI":"10.1109\/CSFW.2005.14"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: POPL, pp. 104\u2013115. ACM Press (2001)","DOI":"10.1145\/373243.360213"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: CSFW, pp. 82\u201396. IEEE CS (2001)","DOI":"10.1109\/CSFW.2001.930138"},{"issue":"1","key":"41_CR5","first-page":"3","volume":"75","author":"B. Blanchet","year":"2008","unstructured":"Blanchet, B., Abadi, M., Fournet, C.: Automated verification of selected equivalences for security protocols. JLAP\u00a075(1), 3\u201351 (2008)","journal-title":"JLAP"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Cortier, V., Rusinowitch, M., Zalinescu, E.: Relating two standard notions of secrecy. Logical Methods in Computer Science\u00a03(3) (2007)","DOI":"10.2168\/LMCS-3(3:2)2007"},{"key":"41_CR7","series-title":"IFIP","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-0-387-09428-1_17","volume-title":"Trust Management II","author":"S. Delaune","year":"2008","unstructured":"Delaune, S., Ryan, M., Smyth, B.: Automatic verification of privacy properties in the applied pi-calculus. In: Karabulut, Y., Mitchell, J., Herrmann, P., Jensen, C.D. (eds.) Trust Management II. IFIP, vol.\u00a0263, pp. 263\u2013278. Springer, Boston (2008)"},{"issue":"2","key":"41_CR8","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"29","author":"D. Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public key protocols. IEEE Transactions on Information Theory\u00a029(2), 198\u2013208 (1983)","journal-title":"IEEE Transactions on Information Theory"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-79228-4_1","volume-title":"Theory and Applications of Models of Computation","author":"C. Dwork","year":"2008","unstructured":"Dwork, C.: Differential Privacy: A Survey of Results. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 1\u201319. Springer, Heidelberg (2008)"},{"key":"41_CR10","doi-asserted-by":"crossref","unstructured":"Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical logic. Springer (1994)","DOI":"10.1007\/978-1-4757-2355-7"},{"issue":"6","key":"41_CR11","doi-asserted-by":"crossref","first-page":"1247","DOI":"10.3233\/JCS-2009-0395","volume":"18","author":"J. Goubault-Larrecq","year":"2010","unstructured":"Goubault-Larrecq, J.: Finite models for formal security proofs. J. Comput. Secur.\u00a018(6), 1247\u20131299 (2010)","journal-title":"J. Comput. Secur."},{"key":"41_CR12","unstructured":"Hinrichs, T., Genesereth, M.: Herbrand logic. Technical Report LG-2006-02, Stanford Univ., USA (2006), http:\/\/logic.stanford.edu\/reports\/LG-2006-02.pdf"},{"key":"41_CR13","unstructured":"IBM Research \u2013 Zurich. Specification of the identity mixer cryptographic library. version 2.3.4. Technical report, IBM Research (2012)"},{"key":"41_CR14","doi-asserted-by":"crossref","unstructured":"M\u00f6dersheim, S., Gro\u00df, T., Vigan\u00f2, L.: Defining Privacy is Supposed to be Easy (Extended Version). Technical Report 2013-21, DTU Compute, Denmark (2013)","DOI":"10.1007\/978-3-642-45221-5_41"},{"key":"41_CR15","unstructured":"Ryan, P., Schneider, S.: Process algebra and non-interference. In: CSFW. IEEE CS (1999)"},{"key":"41_CR16","doi-asserted-by":"crossref","unstructured":"Selinger, P.: Models for an Adversary-Centric Protocol Logic. ENTCS\u00a055 (2003)","DOI":"10.1016\/S1571-0661(04)00245-2"},{"issue":"5","key":"41_CR17","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L. Sweeney","year":"2002","unstructured":"Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems\u00a010(5), 557\u2013570 (2002)","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"41_CR18","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/3-540-48660-7_29","volume-title":"Automated Deduction - CADE-16","author":"C. Weidenbach","year":"1999","unstructured":"Weidenbach, C.: Towards an Automatic Analysis of Security Protocols in First-Order Logic. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 314\u2013328. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45221-5_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T02:08:21Z","timestamp":1746065301000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45221-5_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452208","9783642452215"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45221-5_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}