{"id":"https://openalex.org/W1994225657","doi":"https://doi.org/10.1016/s1571-0661(04)00240-3","title":"On the Symbolic Reduction of Processes with Cryptographic Functions","display_name":"On the Symbolic Reduction of Processes with Cryptographic Functions","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1994225657","doi":"https://doi.org/10.1016/s1571-0661(04)00240-3","mag":"1994225657"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(04)00240-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00240-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(04)00240-3","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001192034","display_name":"Roberto M. Amadio","orcid":null},"institutions":[{"id":"https://openalex.org/I4210115196","display_name":"Laboratoire d\u2019Informatique Fondamentale de Marseille","ror":"https://ror.org/022my8t07","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I21491767","https://openalex.org/I4210115196","https://openalex.org/I4210142724","https://openalex.org/I4210159245"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Roberto Amadio","raw_affiliation_strings":["CMI (LIF) Universit\u00e9 de Provence 39 rue Joliot-Curie, F-13453, Marseille, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CMI (LIF) Universit\u00e9 de Provence 39 rue Joliot-Curie, F-13453, Marseille, France","institution_ids":["https://openalex.org/I4210115196"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5001192034"],"corresponding_institution_ids":["https://openalex.org/I4210115196"],"apc_list":null,"apc_paid":null,"fwci":4.1802,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.9398066,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"55","issue":"1","first_page":"1","last_page":"2"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9944999814033508,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9904000163078308,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/cryptographic-primitive","display_name":"Cryptographic primitive","score":0.6391065120697021},{"id":"https://openalex.org/keywords/security-of-cryptographic-hash-functions","display_name":"Security of cryptographic hash functions","score":0.6326308250427246},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.6308150887489319},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.593707263469696},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5809023976325989},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5782965421676636},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5644251108169556},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.45789653062820435},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.4503523111343384},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.42835062742233276},{"id":"https://openalex.org/keywords/cryptographic-protocol","display_name":"Cryptographic protocol","score":0.42578011751174927},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.41728076338768005},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3674365282058716},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.32776516675949097},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.29657524824142456},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2815091907978058}],"concepts":[{"id":"https://openalex.org/C15927051","wikidata":"https://www.wikidata.org/wiki/Q246593","display_name":"Cryptographic primitive","level":4,"score":0.6391065120697021},{"id":"https://openalex.org/C165511393","wikidata":"https://www.wikidata.org/wiki/Q7252276","display_name":"Security of cryptographic hash functions","level":5,"score":0.6326308250427246},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.6308150887489319},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.593707263469696},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5809023976325989},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5782965421676636},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5644251108169556},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.45789653062820435},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.4503523111343384},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.42835062742233276},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.42578011751174927},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.41728076338768005},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3674365282058716},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.32776516675949097},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.29657524824142456},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2815091907978058},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1016/s1571-0661(04)00240-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00240-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:hdl:10068/46226","is_oa":false,"landing_page_url":"http://hdl.handle.net/10068/46226","pdf_url":null,"source":{"id":"https://openalex.org/S4377196900","display_name":"OpenGrey (Institut de l'Information Scientifique et Technique)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1295345811","host_organization_name":"Institut de l'Information Scientifique et Technique","host_organization_lineage":["https://openalex.org/I1295345811"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"R - Report"},{"id":"pmh:oai:HAL:hal-00147013v1","is_oa":false,"landing_page_url":"https://hal.science/hal-00147013","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theoretical Computer Science, 2003, 290, pp.695-740","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:inria-00072478v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00072478","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"RR-4147, INRIA. 2001","raw_type":"info:eu-repo/semantics/report"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(04)00240-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(04)00240-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.8100000023841858}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3138980809","https://openalex.org/W2949627086","https://openalex.org/W1596041124","https://openalex.org/W4300333639","https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W2332709766","https://openalex.org/W2084570980","https://openalex.org/W2186150309"],"abstract_inverted_index":{"We":[0,16,48],"study":[1],"the":[2,46,51,103,116,120,123,134,174],"reachability":[3],"problem":[4,135],"for":[5,60,66,143],"cryptographic":[6,14],"protocols":[7,176],"represented":[8],"as":[9,35,76],"processes":[10,62,148,172],"relying":[11],"on":[12,153,159],"perfect":[13],"functions.":[15],"introduce":[17],"a":[18,56,64,77,90,99,144,169],"symbolic":[19,52,70,104],"reduction":[20,53,71,105],"system":[21,54,72,106],"that":[22,50,98,133,149],"can":[23,73],"handle":[24],"hashing":[25],"functions,":[26],"symmetric":[27],"keys,":[28],"and":[29,63,140,165,183],"public":[30],"keys.":[31],"Desirable":[32],"properties":[33],"such":[34],"secrecy":[36],"or":[37,127],"authenticity":[38],"are":[39],"specified":[40],"by":[41,180],"inserting":[42],"logical":[43],"assertions":[44],"in":[45,112,138,141,178],"processes.":[47],"show":[49,132],"provides":[55],"flexible":[57],"decision":[58],"procedure":[59],"finite":[61,128],"reference":[65],"sound":[67],"implementations.":[68],"The":[69],"be":[74],"regarded":[75],"variant":[78],"of":[79,93,102,119,125,146,162,171],"syntactic":[80],"unification":[81],"which":[82],"is":[83,136,157],"compatible":[84],"with":[85],"certain":[86],"set-membership":[87],"constraints.":[88],"For":[89],"significant":[91],"fragment":[92],"our":[94],"formalism,":[95],"we":[96,131],"argue":[97],"dag":[100],"implementation":[101],"leads":[107],"to":[108,168],"an":[109],"algorithm":[110],"running":[111],"nptime":[113],"thus":[114],"matching":[115],"lower":[117],"bound":[118],"problem.":[121],"In":[122],"case":[124],"iterated":[126,147],"control":[129],"processes,":[130],"undecidable":[137],"general":[139],"ptime":[142],"subclass":[145],"do":[150],"not":[151],"rely":[152],"pairing.":[154],"Our":[155],"technique":[156],"based":[158],"rational":[160],"transductions":[161],"regular":[163],"languages":[164],"it":[166],"applies":[167],"class":[170],"containing":[173],"ping-pong":[175],"studied":[177],"1982":[179],"Dolev,":[181],"Even":[182],"Karp.":[184]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}