Easy intruder deduction problems with homomorphisms
We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical Dolev–Yao model by permitting the intruder to exploit these properties. More prec...
Gespeichert in:
| Veröffentlicht in: | Information processing letters 2006-03, Vol.97 (6), p.213-218 |
|---|---|
| 1. Verfasser: | |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 218 |
|---|---|
| container_issue | 6 |
| container_start_page | 213 |
| container_title | Information processing letters |
| container_volume | 97 |
| creator | Delaune, Stéphanie |
| description | We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical
Dolev–Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as
Exclusive or and
Abelian groups in combination with the homomorphism axiom. We show that the intruder deduction problem is in PTIME in both cases, improving the EXPTIME complexity results of Lafourcade, Lugiez and Treinen. |
| doi_str_mv | 10.1016/j.ipl.2005.11.008 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_journals_237287593</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020019005003248</els_id><sourcerecordid>980972481</sourcerecordid><originalsourceid>FETCH-LOGICAL-c354t-7c76e7c24bf54950b5277654a7f6613946d231642cb1c9e1582944247a3eff1d3</originalsourceid><addsrcrecordid>eNp9kEtLw0AQxxdRsFY_gLcgeEyc2WeCJyn1AQUvel6SzYZuyMvdVOm3d0sL3mQOc_k_Zn6E3CJkCCgf2sxNXUYBRIaYAeRnZIG5oqlELM7JAoBCCljAJbkKoQUAyZlaELYuwz5xw-x3tfVJbeudmd04JJMfq872Iflx8zbZjn0cP21d6MM1uWjKLtib016Sz-f1x-o13by_vK2eNqlhgs-pMkpaZSivGsELAZWgSknBS9VIiazgsqYMJaemQlNYFDktOKdclcw2DdZsSe6OufGWr50Ns27HnR9ipaZM0VyJgkURHkXGjyF42-jJu770e42gD2h0qyMafUCjEXVEEz33p-AymLJrfDkYF_6MSoCieMh-POps_PLbWa-DcXYwtnbemlnXo_un5RdiSXdG</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>237287593</pqid></control><display><type>article</type><title>Easy intruder deduction problems with homomorphisms</title><source>Elsevier ScienceDirect Journals</source><creator>Delaune, Stéphanie</creator><creatorcontrib>Delaune, Stéphanie</creatorcontrib><description>We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical
Dolev–Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as
Exclusive or and
Abelian groups in combination with the homomorphism axiom. We show that the intruder deduction problem is in PTIME in both cases, improving the EXPTIME complexity results of Lafourcade, Lugiez and Treinen.</description><identifier>ISSN: 0020-0190</identifier><identifier>EISSN: 1872-6119</identifier><identifier>DOI: 10.1016/j.ipl.2005.11.008</identifier><identifier>CODEN: IFPLAT</identifier><language>eng</language><publisher>Amsterdam: Elsevier B.V</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Artificial intelligence ; Automatic theorem proving ; Computer science; control theory; systems ; Cryptography ; Cybersecurity ; Exact sciences and technology ; Formal methods ; Information, signal and communications theory ; Learning and adaptive systems ; Logic and foundations ; Mathematical logic, foundations, set theory ; Mathematics ; Proof theory and constructive mathematics ; Protocol ; Sciences and techniques of general use ; Security protocols ; Signal and communications theory ; Studies ; Telecommunications and information theory ; Theoretical computing</subject><ispartof>Information processing letters, 2006-03, Vol.97 (6), p.213-218</ispartof><rights>2005 Elsevier B.V.</rights><rights>2006 INIST-CNRS</rights><rights>Copyright Elsevier Sequoia S.A. Mar 31, 2006</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c354t-7c76e7c24bf54950b5277654a7f6613946d231642cb1c9e1582944247a3eff1d3</citedby><cites>FETCH-LOGICAL-c354t-7c76e7c24bf54950b5277654a7f6613946d231642cb1c9e1582944247a3eff1d3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.sciencedirect.com/science/article/pii/S0020019005003248$$EHTML$$P50$$Gelsevier$$H</linktohtml><link.rule.ids>314,776,780,3537,27901,27902,65306</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=17507213$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>Delaune, Stéphanie</creatorcontrib><title>Easy intruder deduction problems with homomorphisms</title><title>Information processing letters</title><description>We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical
Dolev–Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as
Exclusive or and
Abelian groups in combination with the homomorphism axiom. We show that the intruder deduction problem is in PTIME in both cases, improving the EXPTIME complexity results of Lafourcade, Lugiez and Treinen.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Artificial intelligence</subject><subject>Automatic theorem proving</subject><subject>Computer science; control theory; systems</subject><subject>Cryptography</subject><subject>Cybersecurity</subject><subject>Exact sciences and technology</subject><subject>Formal methods</subject><subject>Information, signal and communications theory</subject><subject>Learning and adaptive systems</subject><subject>Logic and foundations</subject><subject>Mathematical logic, foundations, set theory</subject><subject>Mathematics</subject><subject>Proof theory and constructive mathematics</subject><subject>Protocol</subject><subject>Sciences and techniques of general use</subject><subject>Security protocols</subject><subject>Signal and communications theory</subject><subject>Studies</subject><subject>Telecommunications and information theory</subject><subject>Theoretical computing</subject><issn>0020-0190</issn><issn>1872-6119</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2006</creationdate><recordtype>article</recordtype><recordid>eNp9kEtLw0AQxxdRsFY_gLcgeEyc2WeCJyn1AQUvel6SzYZuyMvdVOm3d0sL3mQOc_k_Zn6E3CJkCCgf2sxNXUYBRIaYAeRnZIG5oqlELM7JAoBCCljAJbkKoQUAyZlaELYuwz5xw-x3tfVJbeudmd04JJMfq872Iflx8zbZjn0cP21d6MM1uWjKLtib016Sz-f1x-o13by_vK2eNqlhgs-pMkpaZSivGsELAZWgSknBS9VIiazgsqYMJaemQlNYFDktOKdclcw2DdZsSe6OufGWr50Ns27HnR9ipaZM0VyJgkURHkXGjyF42-jJu770e42gD2h0qyMafUCjEXVEEz33p-AymLJrfDkYF_6MSoCieMh-POps_PLbWa-DcXYwtnbemlnXo_un5RdiSXdG</recordid><startdate>20060331</startdate><enddate>20060331</enddate><creator>Delaune, Stéphanie</creator><general>Elsevier B.V</general><general>Elsevier Science</general><general>Elsevier Sequoia S.A</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20060331</creationdate><title>Easy intruder deduction problems with homomorphisms</title><author>Delaune, Stéphanie</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c354t-7c76e7c24bf54950b5277654a7f6613946d231642cb1c9e1582944247a3eff1d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Artificial intelligence</topic><topic>Automatic theorem proving</topic><topic>Computer science; control theory; systems</topic><topic>Cryptography</topic><topic>Cybersecurity</topic><topic>Exact sciences and technology</topic><topic>Formal methods</topic><topic>Information, signal and communications theory</topic><topic>Learning and adaptive systems</topic><topic>Logic and foundations</topic><topic>Mathematical logic, foundations, set theory</topic><topic>Mathematics</topic><topic>Proof theory and constructive mathematics</topic><topic>Protocol</topic><topic>Sciences and techniques of general use</topic><topic>Security protocols</topic><topic>Signal and communications theory</topic><topic>Studies</topic><topic>Telecommunications and information theory</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Delaune, Stéphanie</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information processing letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Delaune, Stéphanie</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Easy intruder deduction problems with homomorphisms</atitle><jtitle>Information processing letters</jtitle><date>2006-03-31</date><risdate>2006</risdate><volume>97</volume><issue>6</issue><spage>213</spage><epage>218</epage><pages>213-218</pages><issn>0020-0190</issn><eissn>1872-6119</eissn><coden>IFPLAT</coden><abstract>We present complexity results for the verification of security protocols. Since the perfect cryptography assumption is unrealistic for cryptographic primitives with visible algebraic properties, we extend the classical
Dolev–Yao model by permitting the intruder to exploit these properties. More precisely, we are interested in theories such as
Exclusive or and
Abelian groups in combination with the homomorphism axiom. We show that the intruder deduction problem is in PTIME in both cases, improving the EXPTIME complexity results of Lafourcade, Lugiez and Treinen.</abstract><cop>Amsterdam</cop><pub>Elsevier B.V</pub><doi>10.1016/j.ipl.2005.11.008</doi><tpages>6</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0020-0190 |
| ispartof | Information processing letters, 2006-03, Vol.97 (6), p.213-218 |
| issn | 0020-0190 1872-6119 |
| language | eng |
| recordid | cdi_proquest_journals_237287593 |
| source | Elsevier ScienceDirect Journals |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Automatic theorem proving Computer science control theory systems Cryptography Cybersecurity Exact sciences and technology Formal methods Information, signal and communications theory Learning and adaptive systems Logic and foundations Mathematical logic, foundations, set theory Mathematics Proof theory and constructive mathematics Protocol Sciences and techniques of general use Security protocols Signal and communications theory Studies Telecommunications and information theory Theoretical computing |
| title | Easy intruder deduction problems with homomorphisms |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-05T01%3A48%3A37IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Easy%20intruder%20deduction%20problems%20with%20homomorphisms&rft.jtitle=Information%20processing%20letters&rft.au=Delaune,%20St%C3%A9phanie&rft.date=2006-03-31&rft.volume=97&rft.issue=6&rft.spage=213&rft.epage=218&rft.pages=213-218&rft.issn=0020-0190&rft.eissn=1872-6119&rft.coden=IFPLAT&rft_id=info:doi/10.1016/j.ipl.2005.11.008&rft_dat=%3Cproquest_cross%3E980972481%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=237287593&rft_id=info:pmid/&rft_els_id=S0020019005003248&rfr_iscdi=true |