{"id":"https://openalex.org/W2588140814","doi":"https://doi.org/10.3233/jcs-0560","title":"Time, computational complexity, and\u00a0probability in the analysis of\u00a0distance-bounding protocols","display_name":"Time, computational complexity, and\u00a0probability in the analysis of\u00a0distance-bounding protocols","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2588140814","doi":"https://doi.org/10.3233/jcs-0560","mag":"2588140814"},"language":"en","primary_location":{"id":"doi:10.3233/jcs-0560","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcs-0560","pdf_url":null,"source":{"id":"https://openalex.org/S106992369","display_name":"Journal of Computer Security","issn_l":"0926-227X","issn":["0926-227X","1875-8924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Security","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1702.03504","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Max Kanovich","orcid":null},"institutions":[{"id":"https://openalex.org/I45129253","display_name":"University College London","ror":"https://ror.org/02jx3x895","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I45129253"]},{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]}],"countries":["GB","RU"],"is_corresponding":true,"raw_author_name":"Max Kanovich","raw_affiliation_strings":["Department of Computer Science (UCL-CS), University College London, London, UK. E-mail:\u00a0m.kanovich@ucl.ac.uk","Faculty of Computer Science, National Research University Higher School of Economics, Moscow, Russian Federation"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science (UCL-CS), University College London, London, UK. E-mail:\u00a0m.kanovich@ucl.ac.uk","institution_ids":["https://openalex.org/I45129253"]},{"raw_affiliation_string":"Faculty of Computer Science, National Research University Higher School of Economics, Moscow, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Tajana Ban Kirigin","orcid":null},"institutions":[{"id":"https://openalex.org/I154347574","display_name":"University of Rijeka","ror":"https://ror.org/05r8dqr10","country_code":"HR","type":"education","lineage":["https://openalex.org/I154347574"]}],"countries":["HR"],"is_corresponding":false,"raw_author_name":"Tajana Ban Kirigin","raw_affiliation_strings":["Department of Mathematics, University of Rijeka, Rijeka, Croatia. E-mail:\u00a0bank@math.uniri.hr"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Rijeka, Rijeka, Croatia. E-mail:\u00a0bank@math.uniri.hr","institution_ids":["https://openalex.org/I154347574"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Vivek Nigam","orcid":null},"institutions":[{"id":"https://openalex.org/I169045520","display_name":"Universidade Federal da Para\u00edba","ror":"https://ror.org/00p9vpz11","country_code":"BR","type":"education","lineage":["https://openalex.org/I169045520"]},{"id":"https://openalex.org/I4210134795","display_name":"Fortiss","ror":"https://ror.org/042x1tp92","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I4210134795"]}],"countries":["BR","DE"],"is_corresponding":false,"raw_author_name":"Vivek Nigam","raw_affiliation_strings":["Computer Science Department, Federal University of Para\u00edba, Jo\u00e3o Pessoa, Brazil. E-mail:\u00a0vivek@ci.ufpb.br","fortiss, Munich, Germany"],"affiliations":[{"raw_affiliation_string":"Computer Science Department, Federal University of Para\u00edba, Jo\u00e3o Pessoa, Brazil. E-mail:\u00a0vivek@ci.ufpb.br","institution_ids":["https://openalex.org/I169045520"]},{"raw_affiliation_string":"fortiss, Munich, Germany","institution_ids":["https://openalex.org/I4210134795"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Andre Scedrov","orcid":null},"institutions":[{"id":"https://openalex.org/I118501908","display_name":"National Research University Higher School of Economics","ror":"https://ror.org/055f7t516","country_code":"RU","type":"education","lineage":["https://openalex.org/I118501908"]},{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["RU","US"],"is_corresponding":false,"raw_author_name":"Andre Scedrov","raw_affiliation_strings":["Department of Mathematics, University of Pennsylvania, Philadelphia, PA, USA. E-mail:\u00a0scedrov@math.upenn.edu","Faculty of Computer Science, National Research University Higher School of Economics, Moscow, Russian Federation"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Pennsylvania, Philadelphia, PA, USA. E-mail:\u00a0scedrov@math.upenn.edu","institution_ids":["https://openalex.org/I79576946"]},{"raw_affiliation_string":"Faculty of Computer Science, National Research University Higher School of Economics, Moscow, Russian Federation","institution_ids":["https://openalex.org/I118501908"]}]},{"author_position":"last","author":{"id":null,"display_name":"Carolyn Talcott","orcid":null},"institutions":[{"id":"https://openalex.org/I1298353152","display_name":"SRI International","ror":"https://ror.org/05s570m15","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1298353152"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Carolyn Talcott","raw_affiliation_strings":["Computer Science Laboratory, SRI International, Menlo Park, CA, USA. E-mail:\u00a0clt@csl.sri.com"],"affiliations":[{"raw_affiliation_string":"Computer Science Laboratory, SRI International, Menlo Park, CA, USA. E-mail:\u00a0clt@csl.sri.com","institution_ids":["https://openalex.org/I1298353152"]}]}],"institutions":[],"countries_distinct_count":6,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I118501908","https://openalex.org/I45129253"],"apc_list":null,"apc_paid":null,"fwci":1.5327,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.84717416,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"25","issue":"6","first_page":"585","last_page":"630"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9480000138282776,"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"}},"topics":[{"id":"https://openalex.org/T11504","display_name":"Advanced Authentication Protocols Security","score":0.9480000138282776,"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"}},{"id":"https://openalex.org/T10986","display_name":"RFID technology advancements","score":0.010300000198185444,"subfield":{"id":"https://openalex.org/subfields/2214","display_name":"Media Technology"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.0071000000461936,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8015999794006348},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.7800999879837036},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.5666999816894531},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5612999796867371},{"id":"https://openalex.org/keywords/cryptographic-protocol","display_name":"Cryptographic protocol","score":0.5058000087738037},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.49480000138282776},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45100000500679016},{"id":"https://openalex.org/keywords/protocol","display_name":"Protocol (science)","score":0.447299987077713},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4302999973297119},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4142000079154968}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8514000177383423},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8015999794006348},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7800999879837036},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6036999821662903},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.5666999816894531},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5612999796867371},{"id":"https://openalex.org/C33884865","wikidata":"https://www.wikidata.org/wiki/Q1254335","display_name":"Cryptographic protocol","level":3,"score":0.5058000087738037},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.49480000138282776},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45100000500679016},{"id":"https://openalex.org/C2780385302","wikidata":"https://www.wikidata.org/wiki/Q367158","display_name":"Protocol (science)","level":3,"score":0.447299987077713},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4142000079154968},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3847000002861023},{"id":"https://openalex.org/C38369872","wikidata":"https://www.wikidata.org/wiki/Q7445009","display_name":"Security analysis","level":2,"score":0.35600000619888306},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C75606506","wikidata":"https://www.wikidata.org/wiki/Q1049183","display_name":"Formal methods","level":2,"score":0.3382999897003174},{"id":"https://openalex.org/C2779623528","wikidata":"https://www.wikidata.org/wiki/Q864377","display_name":"Multiset","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32109999656677246},{"id":"https://openalex.org/C2776937656","wikidata":"https://www.wikidata.org/wiki/Q2229669","display_name":"Nesting (process)","level":2,"score":0.3190999925136566},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.314300000667572},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.3109999895095825},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.31049999594688416},{"id":"https://openalex.org/C197115733","wikidata":"https://www.wikidata.org/wiki/Q1003136","display_name":"Forcing (mathematics)","level":2,"score":0.29339998960494995},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.2842000126838684},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.27390000224113464},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C2779662365","wikidata":"https://www.wikidata.org/wiki/Q5416694","display_name":"Event (particle physics)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.25699999928474426},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.251800000667572}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.3233/jcs-0560","is_oa":false,"landing_page_url":"https://doi.org/10.3233/jcs-0560","pdf_url":null,"source":{"id":"https://openalex.org/S106992369","display_name":"Journal of Computer Security","issn_l":"0926-227X","issn":["0926-227X","1875-8924"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310318577","host_organization_name":"IOS Press","host_organization_lineage":["https://openalex.org/P4310318577"],"host_organization_lineage_names":["IOS Press"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Computer Security","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1702.03504","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.03504","pdf_url":"https://arxiv.org/pdf/1702.03504","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1702.03504","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1702.03504","pdf_url":"https://arxiv.org/pdf/1702.03504","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W1010687637","https://openalex.org/W1482486776","https://openalex.org/W1493633084","https://openalex.org/W1530255708","https://openalex.org/W1531001456","https://openalex.org/W1543653153","https://openalex.org/W1559824347","https://openalex.org/W1595740013","https://openalex.org/W1879575712","https://openalex.org/W1985229708","https://openalex.org/W1986720226","https://openalex.org/W2005648310","https://openalex.org/W2006340882","https://openalex.org/W2011329056","https://openalex.org/W2019810307","https://openalex.org/W2022472002","https://openalex.org/W2029693536","https://openalex.org/W2048551412","https://openalex.org/W2096127423","https://openalex.org/W2101638547","https://openalex.org/W2106611458","https://openalex.org/W2108516128","https://openalex.org/W2114497629","https://openalex.org/W2127785555","https://openalex.org/W2146973388","https://openalex.org/W2155032609","https://openalex.org/W2155481610","https://openalex.org/W2159796097","https://openalex.org/W2165025360","https://openalex.org/W2204535006","https://openalex.org/W2225586860","https://openalex.org/W2276185234","https://openalex.org/W2395334218"],"related_works":[],"abstract_inverted_index":{"Many":[0],"security":[1,53,193],"protocols":[2,54],"rely":[3],"on":[4,7,80,126],"the":[5,8,28,35,44,74,78,81,136,208,218,224,239,244],"assumptions":[6],"physical":[9],"properties":[10],"in":[11,62,152],"which":[12],"its":[13],"protocol":[14],"sessions":[15],"will":[16],"be":[17,102,123,203,236],"carried":[18,124],"out.":[19],"For":[20],"instance,":[21],"Distance":[22,128],"Bounding":[23,129],"Protocols":[24],"take":[25],"into":[26],"account":[27],"round":[29],"trip":[30],"time":[31,88,188],"of":[32,43,66,68,139,166,221],"messages":[33],"and":[34,64,77,89,176,198,214],"transmission":[36],"velocity":[37],"to":[38,145,205],"infer":[39],"an":[40,119],"upper":[41],"bound":[42],"distance":[45],"between":[46],"tw":[47],"o":[48],"agents.":[49],"We":[50,94,115,160,195,229],"classify":[51],"such":[52,250],"as":[55],"Cyber-Physical.":[56],"Time":[57],"plays":[58],"a":[59,147,153,163,171,182],"key":[60],"role":[61],"design":[63],"analysis":[65,82,165],"many":[67],"these":[69],"protocols.":[70,194],"This":[71],"paper":[72],"investigates":[73],"foundational":[75],"differences":[76],"impacts":[79],"when":[83,111],"using":[84,106,112,238],"models":[85,90,105],"with":[86,91,118,186],"discrete":[87,113],"dense":[92,107,187],"time.":[93,114],"show":[95,199,215,231],"that":[96,100,121,149,200,216,246],"there":[97],"are":[98],"attacks":[99],"can":[101,122,202,235],"found":[103],"by":[104],"time,":[108],"but":[109],"not":[110],"illustrate":[116],"this":[117,132,167],"attack":[120],"out":[125],"most":[127],"Protocols.":[130],"In":[131],"attack,":[133],"one":[134,142],"exploits":[135],"execution":[137],"delay":[138],"instructions":[140],"during":[141],"clock":[143],"cycle":[144],"convince":[146],"verifier":[148],"he":[150],"is":[151,227],"location":[154],"different":[155],"from":[156],"his":[157],"actual":[158],"position.":[159],"additionally":[161],"present":[162],"probabilistic":[164],"novel":[168],"attack.":[169],"As":[170],"formal":[172],"model":[173,185,234],"for":[174,190,211,217,249],"representing":[175],"analyzing":[177],"Cyber-Physical":[178],"properties,":[179],"we":[180],"propose":[181],"Multiset":[183],"Rewriting":[184],"suitable":[189],"specifying":[191],"cyber-physical":[192],"introduce":[196],"Circle-Configurations":[197],"they":[201],"used":[204],"symbolically":[206],"solve":[207],"reachability":[209,225],"problem":[210,226],"our":[212,233],"model,":[213],"important":[219],"class":[220],"balanced":[222],"theories":[223],"PSPACE-complete.":[228],"also":[230],"how":[232],"implemented":[237],"computational":[240],"rewriting":[241],"tool":[242],"Maude,":[243],"machinery":[245],"automatically":[247],"searches":[248],"attacks.":[251]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2026-03-23T07:41:27.035349","created_date":"2017-02-24T00:00:00"}