{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T03:15:36Z","timestamp":1773717336423,"version":"3.50.1"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030299583","type":"print"},{"value":"9783030299590","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29959-0_28","type":"book-chapter","created":{"date-parts":[[2019,9,14]],"date-time":"2019-09-14T23:04:10Z","timestamp":1568502250000},"page":"577-594","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Breaking Unlinkability of the ICAO 9303 Standard for e-Passports Using Bisimilarity"],"prefix":"10.1007","author":[{"given":"Ihor","family":"Filimonov","sequence":"first","affiliation":[]},{"given":"Ross","family":"Horne","sequence":"additional","affiliation":[]},{"given":"Sjouke","family":"Mauw","sequence":"additional","affiliation":[]},{"given":"Zach","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,15]]},"reference":[{"key":"28_CR1","unstructured":"Machine readable travel documents. part 11: Security mechanisms for MRTDs. Technical report Doc 9303. Seventh Edition, International Civil Aviation Organization (ICAO) (2015). https:\/\/www.icao.int\/publications\/Documents\/9303_p11_cons_en.pdf"},{"key":"28_CR2","unstructured":"ISO 15408\u20132: Common criteria for information technology security evaluation. part 2: Security functional requirements. Technical report. CCMB-2017-04-002, ISO\/IEC standard (2017). https:\/\/www.commoncriteriaportal.org\/files\/ccfiles\/CCPART2V3.1R5.pdf"},{"issue":"1","key":"28_CR3","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/3127586","volume":"65","author":"M Abadi","year":"2017","unstructured":"Abadi, M., Blanchet, B., Fournet, C.: The applied pi calculus: mobile values, new names, and secure communication. J. ACM 65(1), 1:1\u20131:41 (2017)","journal-title":"J. ACM"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: 2010 23rd IEEE Computer Security Foundations Symposium (CSF), pp. 107\u2013121. IEEE (2010)","DOI":"10.1109\/CSF.2010.15"},{"issue":"3","key":"28_CR5","doi-asserted-by":"publisher","first-page":"47:1","DOI":"10.1145\/2825026","volume":"48","author":"G Avoine","year":"2016","unstructured":"Avoine, G., Beaujeant, A., Hernandez-Castro, J., Demay, L., Teuwen, P.: A survey of security and privacy issues in epassport protocols. ACM Comput. Surv. 48(3), 47:1\u201347:37 (2016)","journal-title":"ACM Comput. Surv."},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-642-04474-8_3","volume-title":"Information Security","author":"J Bender","year":"2009","unstructured":"Bender, J., Fischlin, M., K\u00fcgler, D.: Security analysis of the PACE key-agreement protocol. In: Samarati, P., Yung, M., Martinelli, F., Ardagna, C.A. (eds.) ISC 2009. LNCS, vol. 5735, pp. 33\u201348. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04474-8_3"},{"issue":"3","key":"28_CR7","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2007.07.010","volume":"386","author":"S Briais","year":"2007","unstructured":"Briais, S., Nestmann, U.: Open bisimulation, revisited. Theor. Comput. Sci. 386(3), 236\u2013271 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-642-41157-1_9","volume-title":"Trustworthy Global Computing","author":"M Brus\u00f3","year":"2013","unstructured":"Brus\u00f3, M., Chatzikokolakis, K., Etalle, S., den Hartog, J.: Linking unlinkability. In: Palamidessi, C., Ryan, M.D. (eds.) TGC 2012. LNCS, vol. 8191, pp. 129\u2013144. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-41157-1_9"},{"key":"28_CR9","unstructured":"Cheval, V.: Automatic verification of cryptographic protocols: privacy-type properties. PhD thesis, Laboratoire Sp\u00e9cification et V\u00e9rification, ENS Cachan (2012)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1007\/978-3-642-54862-8_50","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"V Cheval","year":"2014","unstructured":"Cheval, V.: APTE: an algorithm for proving trace equivalence. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 587\u2013592. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_50"},{"issue":"Part 1","key":"28_CR11","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1016\/j.ic.2017.05.004","volume":"255","author":"V Cheval","year":"2017","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: A procedure for deciding symbolic equivalence between sets of constraint systems. Inf. Comput. 255(Part 1), 94\u2013125 (2017)","journal-title":"Inf. Comput."},{"key":"28_CR12","doi-asserted-by":"crossref","unstructured":"Cheval, V., Kremer, S., Rakotonirina, I.: DEEPSEC: Deciding equivalence properties in security protocols theory and practice. In: 2018 IEEE Symposium on Security and Privacy (S&P), pp. 529\u2013546 (2018)","DOI":"10.1109\/SP.2018.00033"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/11888116_9","volume-title":"Formal Techniques for Networked and Distributed Systems - FORTE 2006","author":"T Chothia","year":"2006","unstructured":"Chothia, T.: Analysing the MUTE anonymous file-sharing system using the pi-calculus. In: Najm, E., Pradat-Peyre, J.-F., Donzeau-Gouge, V.V. (eds.) FORTE 2006. LNCS, vol. 4229, pp. 115\u2013130. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11888116_9"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-642-14577-3_5","volume-title":"Financial Cryptography and Data Security","author":"T Chothia","year":"2010","unstructured":"Chothia, T., Smirnov, V.: A traceability attack against e-passports. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 20\u201334. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14577-3_5"},{"issue":"3","key":"28_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2168\/LMCS-3(3:2)2007","volume":"3","author":"V Cortier","year":"2007","unstructured":"Cortier, V., Rusinowitch, M., Zalinescu, E.: Relating two standard notions of secrecy. Log. Methods Comput. Sci. 3(3), 1\u201329 (2007)","journal-title":"Log. Methods Comput. Sci."},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-540-70545-1_38","volume-title":"Computer Aided Verification","author":"CJF Cremers","year":"2008","unstructured":"Cremers, C.J.F.: The scyther tool: verification, falsification, and analysis of security protocols. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 414\u2013418. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_38"},{"issue":"29","key":"28_CR17","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1109\/TIT.1983.1056650","volume":"2","author":"D Dolev","year":"1983","unstructured":"Dolev, D., Yao, A.: On the security of public-key protocols. IEEE Trans. Inf. Theory 2(29), 198\u2013208 (1983)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-540-28632-5_26","volume-title":"Cryptographic Hardware and Embedded Systems - CHES 2004","author":"M Feldhofer","year":"2004","unstructured":"Feldhofer, M., Dominikus, S., Wolkerstorfer, J.: Strong authentication for RFID systems using the AES algorithm. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 357\u2013370. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28632-5_26"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Hirschi, L., Baelde, D., Delaune, S.: A method for verifying privacy-type properties: the unbounded case. In: 2016 IEEE Symposium on Security and Privacy (S&P), pp. 564\u2013581. IEEE (2016)","DOI":"10.1109\/SP.2016.40"},{"issue":"3","key":"28_CR20","doi-asserted-by":"publisher","first-page":"277","DOI":"10.3233\/JCS-171070","volume":"27","author":"L Hirschi","year":"2019","unstructured":"Hirschi, L., Baelde, D., Delaune, S.: A method for unbounded verification of privacy-type properties. J. Comput. Secur. 27(3), 277\u2013342 (2019)","journal-title":"J. Comput. Secur."},{"key":"28_CR21","unstructured":"Horne, R.: A bisimilarity congruence for the applied $$\\pi $$-calculus sufficiently coarse to verify privacy properties, (arXiv:1811.02536) (2018), https:\/\/arxiv.org\/abs\/1811.02536"},{"key":"28_CR22","doi-asserted-by":"crossref","unstructured":"Horne, R., Ahn, K.Y., Lin, S.W., Tiu, A.: Quasi-open bisimilarity with mismatch is intuitionistic. In: Dawar, A., Gr\u00e4del, E. (eds.) Proceedings of 33rd Annual ACM\/IEEE Symposium on Logic in Computer Science, Oxford, United Kingdom, 9\u201312 July 2018, pp. 26\u201335 (2018)","DOI":"10.1145\/3209108.3209125"},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0890-5401(90)90025-D","volume":"86","author":"PC Kanellakis","year":"1990","unstructured":"Kanellakis, P.C., Smolka, S.A.: CCS expressions, finite state processes, and three problems of equivalence. Inf. Comput. 86(1), 43\u201368 (1990)","journal-title":"Inf. Comput."},{"issue":"1","key":"28_CR24","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/0304-3975(93)90156-N","volume":"114","author":"R Milner","year":"1993","unstructured":"Milner, R., Parrow, J., Walker, D.: Modal logics for mobile processes. Theor. Comput. Sci. 114(1), 149\u2013171 (1993)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"28_CR25","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s002360050036","volume":"33","author":"D Sangiorgi","year":"1996","unstructured":"Sangiorgi, D.: A theory of bisimulation for the $$\\pi $$-calculus. Acta Informatica 33(1), 69\u201397 (1996)","journal-title":"Acta Informatica"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Tiu, A., Dawson, J.: Automating open bisimulation checking for the spi calculus. In: 2010 23rd IEEE Computer Security Foundations Symposium. pp. 307\u2013321. IEEE (2010)","DOI":"10.1109\/CSF.2010.28"}],"container-title":["Lecture Notes in Computer Science","Computer Security \u2013 ESORICS 2019"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29959-0_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T00:07:50Z","timestamp":1726358870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-29959-0_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030299583","9783030299590"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29959-0_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"15 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ESORICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Symposium on Research in Computer Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/conf.laas.fr\/esorics\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"344","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"67","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3,2","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"11","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}