{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T09:40:05Z","timestamp":1751794805194,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319990729"},{"type":"electronic","value":"9783319990736"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-99073-6_19","type":"book-chapter","created":{"date-parts":[[2018,8,10]],"date-time":"2018-08-10T18:09:38Z","timestamp":1533924578000},"page":"385-405","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["POR for Security Protocol Equivalences"],"prefix":"10.1007","author":[{"given":"David","family":"Baelde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"St\u00e9phanie","family":"Delaune","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucca","family":"Hirschi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,8]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abadi, M., Fournet, C.: Mobile values, new names, and secure communication. In: Proceedings of the 28th Symposium on Principles of Programming Languages (POPL 2001), pp. 104\u2013115. ACM Press (2001)","key":"19_CR1","DOI":"10.1145\/360204.360213"},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.tcs.2003.12.023","volume":"322","author":"M Abadi","year":"2004","unstructured":"Abadi, M., Fournet, C.: Private authentication. Theor. Comput. Sci. 322(3), 427\u2013476 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"19_CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1145\/2578855.2535845","volume":"49","author":"P Abdulla","year":"2014","unstructured":"Abdulla, P., Aronis, S., Jonsson, B., Sagonas, K.: Optimal dynamic partial order reduction. ACM SIGPLAN Not. 49(1), 373\u2013384 (2014)","journal-title":"ACM SIGPLAN Not."},{"doi-asserted-by":"crossref","unstructured":"Arapinis, M., Chothia, T., Ritter, E., Ryan, M.: Analysing unlinkability and anonymity using the applied pi calculus. In: Proceedings of 23rd Computer Security Foundations Symposium (CSF 2010), pp. 107\u2013121. IEEE Computer Society Press (2010)","key":"19_CR4","DOI":"10.1109\/CSF.2010.15"},{"doi-asserted-by":"crossref","unstructured":"Armando, A., Carbone, R., Compagna, L., Cuellar, J., Abad, L.T.: Formal analysis of SAML 2.0 web browser single sign-on: breaking the SAML-based single sign-on for Google apps. In: Proceedings of the 6th ACM Workshop on Formal Methods in Security Engineering (FMSE 2008), pp. 1\u201310 (2008)","key":"19_CR5","DOI":"10.1145\/1456396.1456397"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/11513988_27","volume-title":"Computer Aided Verification","author":"A Armando","year":"2005","unstructured":"Armando, A., et al.: The AVISPA tool for the automated validation of internet security protocols and applications. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 281\u2013285. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11513988_27"},{"unstructured":"Baelde, D., Delaune, S., Hirschi, L.: Porridge, an OCaml library implementing POR techniques for checking trace equivalence of security protocols. https:\/\/hal.inria.fr\/hal-01821474","key":"19_CR7"},{"unstructured":"Baelde, D., Delaune, S., Hirschi, L.: Partial order reduction for security protocols. In: Proceedings of the 26th International Conference on Concurrency Theory (CONCUR 2015). LIPIcs, Madrid, Spain, vol. 42, pp. 497\u2013510. Leibniz-Zentrum f\u00fcr Informatik (2015)","key":"19_CR8"},{"issue":"2:8","key":"19_CR9","first-page":"1","volume":"13","author":"D Baelde","year":"2017","unstructured":"Baelde, D., Delaune, S., Hirschi, L.: A reduced semantics for deciding trace equivalence. Log. Methods Comput. Sci. 13(2:8), 1\u201348 (2017)","journal-title":"Log. Methods Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Baelde, D., Delaune, S., Hirschi, L.: POR for security protocols equivalences: beyond action-determinism. Technical report (2018). https:\/\/arxiv.org\/abs\/1804.03650","key":"19_CR10","DOI":"10.1007\/978-3-319-99073-6_19"},{"key":"19_CR11","volume-title":"Principles of Model Checking (Representation and Mind Series)","author":"C Baier","year":"2008","unstructured":"Baier, C., Katoen, J.-P.: Principles of Model Checking (Representation and Mind Series). The MIT Press, Cambridge (2008)"},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"50:1","DOI":"10.1145\/3182657","volume":"51","author":"R Baldoni","year":"2018","unstructured":"Baldoni, R., Coppa, E., D\u2019Elia, D.C., Demetrescu, C., Finocchi, I.: A survey of symbolic execution techniques. ACM Comput. Surv. 51(3), 50:1\u201350:39 (2018). https:\/\/doi.org\/10.1145\/3182657. ISSN 0360-0300","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"19_CR13","doi-asserted-by":"publisher","first-page":"817","DOI":"10.3233\/JCS-130472","volume":"21","author":"D Basin","year":"2013","unstructured":"Basin, D., Cremers, C., Meier, S.: Provably repairing the ISO\/IEC 9798 standard for entity authentication. J. Comput. Secur. 21(6), 817\u2013846 (2013)","journal-title":"J. Comput. Secur."},{"doi-asserted-by":"crossref","unstructured":"Basin, D., Dreier, J., Sasse, R.: Automated symbolic proofs of observational equivalence. In: Proceedings of the 22nd ACM Conference on Computer and Communications Security (CCS 2015), pp. 1144\u20131155. ACM (2015)","key":"19_CR14","DOI":"10.1145\/2810103.2813662"},{"doi-asserted-by":"crossref","unstructured":"Blanchet, B.: An efficient cryptographic protocol verifier based on prolog rules. In: Proceedings of the 14th Computer Security Foundations Workshop (CSFW 2001), pp. 82\u201396. IEEE Computer Society Press (2001)","key":"19_CR15","DOI":"10.1109\/CSFW.2001.930138"},{"doi-asserted-by":"crossref","unstructured":"Bruso, M., Chatzikokolakis, K., den Hartog, J.: Formal verification of privacy for RFID systems. In: Proceedings of the 23rd IEEE Computer Security Foundations Symposium (CSF 2010). IEEE Computer Society Press (2010)","key":"19_CR16","DOI":"10.1109\/CSF.2010.13"},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/978-3-642-28869-2_6","volume-title":"Programming Languages and Systems","author":"R Chadha","year":"2012","unstructured":"Chadha, R., Ciob\u00e2c\u0103, \u015e., Kremer, S.: Automated verification of equivalence properties of cryptographic protocols. In: Seidl, H. (ed.) ESOP 2012. LNCS, vol. 7211, pp. 108\u2013127. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28869-2_6"},{"key":"19_CR18","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"},{"doi-asserted-by":"crossref","unstructured":"Cheval, V., Comon-Lundh, H., Delaune, S.: Trace equivalence decision: negative tests and non-determinism. In: Proceedings of the 18th Conference on Computer and Communications Security (CCS 2011). ACM Press (2011)","key":"19_CR19","DOI":"10.1145\/2046707.2046744"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2013.04.016","volume":"492","author":"V Cheval","year":"2013","unstructured":"Cheval, V., Cortier, V., Delaune, S.: Deciding equivalence-based properties using constraint solving. Theor. Comput. Sci. 492, 1\u201339 (2013)","journal-title":"Theor. Comput. Sci."},{"doi-asserted-by":"crossref","unstructured":"Cheval, V., Kremer, S., Rakotonirina, I.: DEEPSEC: deciding equivalence properties in security protocols - theory and practice. In: Proceedings of the 39th IEEE Symposium on Security and Privacy (S&P 2018). IEEE Computer Society Press (2018)","key":"19_CR21","DOI":"10.1109\/SP.2018.00033"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/3-540-46419-0_34","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Jha, S., Marrero, W.: Partial order reductions for security protocol verification. In: Graf, S., Schwartzbach, M. (eds.) TACAS 2000. LNCS, vol. 1785, pp. 503\u2013518. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-46419-0_34"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/978-3-540-31810-1_12","volume-title":"System Analysis and Modeling","author":"CJF Cremers","year":"2005","unstructured":"Cremers, C.J.F., Mauw, S.: Checking secrecy by means of partial order reduction. In: Amyot, D., Williams, A.W. (eds.) SAM 2004. LNCS, vol. 3319, pp. 171\u2013188. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-31810-1_12"},{"key":"19_CR24","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.jlamp.2016.10.005","volume":"87","author":"S Delaune","year":"2017","unstructured":"Delaune, S., Hirschi, L.: A survey of symbolic methods for establishing equivalence-based properties in cryptographic protocols. J. Log. Algebraic Methods Program. 87, 127\u2013144 (2017)","journal-title":"J. Log. Algebraic Methods Program."},{"key":"19_CR25","first-page":"435","volume":"4","author":"S Delaune","year":"2008","unstructured":"Delaune, S., Kremer, S., Ryan, M.D.: Verifying privacy-type properties of electronic voting protocols. J. Comput. Secur. 4, 435\u2013487 (2008)","journal-title":"J. Comput. Secur."},{"key":"19_CR26","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":"19_CR27","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1145\/1047659.1040315","volume":"40","author":"C Flanagan","year":"2005","unstructured":"Flanagan, C., Godefroid, P.: Dynamic partial-order reduction for model checking software. ACM SIGPLAN Not. 40, 110\u2013121 (2005)","journal-title":"ACM SIGPLAN Not."},{"doi-asserted-by":"crossref","unstructured":"Godefroid, P.: Partial-order methods for the verification of concurrent systems. Ph.D. thesis, Universit\u00e9 de Li\u00e8ge (1995)","key":"19_CR28","DOI":"10.1007\/3-540-60761-7"},{"doi-asserted-by":"crossref","unstructured":"Hirschi, L., Baelde, D., Delaune, S.: A method for verifying privacy-type properties: the unbounded case. In: Proceedings of the 37th IEEE Symposium on Security and Privacy (S&P 2016), San Jose, California, USA, pp. 564\u2013581, May 2016","key":"19_CR29","DOI":"10.1109\/SP.2016.40"},{"key":"19_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-61042-1_43","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"G Lowe","year":"1996","unstructured":"Lowe, G.: Breaking and fixing the needham-schroeder public-key protocol using FDR. In: Margaria, T., Steffen, B. (eds.) TACAS 1996. LNCS, vol. 1055, pp. 147\u2013166. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61042-1_43"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"696","DOI":"10.1007\/978-3-642-39799-8_48","volume-title":"Computer Aided Verification","author":"S Meier","year":"2013","unstructured":"Meier, S., Schmidt, B., Cremers, C., Basin, D.: The TAMARIN prover for the symbolic analysis of security protocols. In: Sharygina, N., Veith, H. (eds.) CAV 2013. LNCS, vol. 8044, pp. 696\u2013701. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39799-8_48"},{"issue":"4","key":"19_CR32","doi-asserted-by":"publisher","first-page":"575","DOI":"10.3233\/JCS-2009-0351","volume":"18","author":"S M\u00f6dersheim","year":"2010","unstructured":"M\u00f6dersheim, S., Vigan\u00f2, L., Basin, D.: Constraint differentiation: search-space reduction for the constraint-based analysis of security protocols. J. Comput. Secur. 18(4), 575\u2013618 (2010)","journal-title":"J. Comput. Secur."},{"key":"19_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BFb0028727","volume-title":"Computer Aided Verification","author":"D Peled","year":"1998","unstructured":"Peled, D.: Ten years of partial order reduction. In: Hu, A.J., Vardi, M.Y. (eds.) CAV 1998. LNCS, vol. 1427, pp. 17\u201328. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0028727"}],"container-title":["Lecture Notes in Computer Science","Computer Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99073-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T08:59:05Z","timestamp":1751792345000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99073-6_19"}},"subtitle":["Beyond Action-Determinism"],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319990729","9783319990736"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99073-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"8 August 2018","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":"Barcelona","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 September 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 September 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"esorics2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2018.upc.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}