{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:53Z","timestamp":1742914313998,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662480533"},{"type":"electronic","value":"9783662480540"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-662-48054-0_46","type":"book-chapter","created":{"date-parts":[[2015,8,10]],"date-time":"2015-08-10T11:57:29Z","timestamp":1439207849000},"page":"555-566","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Active Linking Attacks"],"prefix":"10.1007","author":[{"given":"Henning","family":"Schnoor","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Woizekowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,11]]},"reference":[{"issue":"3","key":"46_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1145\/320083.320091","volume":"4","author":"AV Aho","year":"1979","unstructured":"Aho, A.V., Beeri, C., Ullman, J.D.: The theory of joins in relational databases. ACM Trans. Database Syst. 4(3), 297\u2013314 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"46_CR2","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: CSF, pp. 107\u2013121. IEEE Computer Society (2010)","DOI":"10.1109\/CSF.2010.15"},{"key":"46_CR3","doi-asserted-by":"crossref","unstructured":"Bhargavan, K., Corin, R., Fournet, C., Gordon, A.D.: Secure sessions for web services. ACM Trans. Inf. Syst. Secur. 10(2) (2007)","DOI":"10.1145\/1237500.1237504"},{"key":"46_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-642-27375-9_4","volume-title":"Theory of Security and Applications","author":"M Backes","year":"2012","unstructured":"Backes, M., Maffei, M., Pecina, K., Reischuk, R.M.: G2C: cryptographic protocols from goal-driven specifications. In: M\u00f6dersheim, S., Palamidessi, C. (eds.) TOSCA 2011. LNCS, vol. 6993, pp. 57\u201377. Springer, Heidelberg (2012)"},{"key":"46_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-642-33167-1_27","volume-title":"Computer Security \u2013 ESORICS 2012","author":"A Biryukov","year":"2012","unstructured":"Biryukov, A., Pustogarov, I., Weinmann, R.-P.: TorScan: tracing long-lived connections and differential scanning attacks. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 469\u2013486. Springer, Heidelberg (2012)"},{"key":"46_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-642-33167-1_19","volume-title":"Computer Security \u2013 ESORICS 2012","author":"N Dong","year":"2012","unstructured":"Dong, N., Jonker, H., Pang, J.: Formal analysis of privacy in an ehealth protocol. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 325\u2013342. Springer, Heidelberg (2012)"},{"key":"46_CR7","doi-asserted-by":"crossref","unstructured":"Eigner, F., Maffei, M.: Differential privacy by typing in security protocols. In: CSF, pp. 272\u2013286. IEEE (2013)","DOI":"10.1109\/CSF.2013.25"},{"issue":"4","key":"46_CR8","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1145\/320107.320115","volume":"4","author":"D Maier","year":"1979","unstructured":"Maier, D., Mendelzon, A.O., Sagiv, Y.: Testing implications of data dependencies. ACM Trans. Database Syst. 4(4), 455\u2013469 (1979)","journal-title":"ACM Trans. Database Syst."},{"key":"46_CR9","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Robust de-anonymization of large sparse datasets. In: IEEE Symposium on Security and Privacy, pp. 111\u2013125. IEEE Computer Society (2008)","DOI":"10.1109\/SP.2008.33"},{"issue":"299","key":"46_CR10","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1016\/S0304-3975(02)00490-5","volume":"1\u20133","author":"M Rusinowitch","year":"2003","unstructured":"Rusinowitch, M., Turuani, M.: Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theoret. Comput. Sci. 1\u20133(299), 451\u2013475 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"46_CR11","unstructured":"Schnoor, H., Woizekowski, O.: Active linkability attacks. CoRR, abs\/1311.7236 (2014)"},{"issue":"5","key":"46_CR12","doi-asserted-by":"publisher","first-page":"571","DOI":"10.1142\/S021848850200165X","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: Achieving $$k$$-anonymity privacy protection using generalization and suppression. Int. J. Fuzziness Knowl. Based Syst. 10(5), 571\u2013588 (2002)","journal-title":"Int. J. Fuzziness Knowl. Based Syst."},{"key":"46_CR13","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-38323-6_1","volume-title":"Trust Management VII","author":"M Veeningen","year":"2013","unstructured":"Veeningen, M., de Weger, B., Zannone, N.: Symbolic privacy analysis through linkability and detectability. In: Fern\u00e1ndez-Gago, C., Martinelli, F., Pearson, S., Agudo, I. (eds.) Trust Management VII. IFIP AICT, vol. 401, pp. 1\u201316. Springer, Heidelberg (2013)"},{"key":"46_CR14","series-title":"Texts in theoretical computer science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03927-4","volume-title":"Introduction to Circuit Complexity - A Uniform Approach","author":"H Vollmer","year":"1999","unstructured":"Vollmer, H.: Introduction to Circuit Complexity - A Uniform Approach. Texts in theoretical computer science. Springer, Heidelberg (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48054-0_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T11:28:55Z","timestamp":1676028535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-48054-0_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662480533","9783662480540"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48054-0_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"11 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}