Reasoning about cryptographic protocols in the spi calculus
The spi calculus is an extension of the pi calculus with constructs for encryption and decryption. This paper develops the theory of the spi calculus, focusing on techniques for establishing testing equivalence, and applying these techniques to the proof of authenticity and secrecy properties of cry...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 73 |
|---|---|
| container_issue | |
| container_start_page | 59 |
| container_title | |
| container_volume | |
| creator | Abadi, Martín Gordon, Andrew D. |
| description | The spi calculus is an extension of the pi calculus with constructs for encryption and decryption. This paper develops the theory of the spi calculus, focusing on techniques for establishing testing equivalence, and applying these techniques to the proof of authenticity and secrecy properties of cryptographic protocols. |
| doi_str_mv | 10.1007/3-540-63141-0_5 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_2731709</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2731709</sourcerecordid><originalsourceid>FETCH-LOGICAL-p222t-b3ebf5cdd21ed3eeb6118fdb4a5ffc1acb7b8695ae35199a8cab4794f0db05633</originalsourceid><addsrcrecordid>eNotkM1PAyEQxfErsdaeve7BKwo7sCzxZBq_kiYmRs8EWGhX14XA9tD_Xtr6LpPMe5k3-SF0Q8kdJUTcA-aM4AYoo5gofoIWUrRQdo2kbctO0Yw2lGIAJs_Q1cHYZ8k5mhEgNZaCwSVa5PxNiqAughl6-HA6h7Ef15U2YTtVNu3iFNZJx01vq5jCFGwYctWP1bRxVY59ZfVgt8M2X6MLr4fsFv9zjr6enz6Xr3j1_vK2fFzhWDombMAZz23X1dR14Jwpb7a-M0xz7y3V1gjTNpJrB5xKqVurDROSedIZwhuAObo93o06l26f9Gj7rGLqf3XaqVoAFUSWGD7GcnHGtUvKhPCTFSVqD1CBKkzUAYoqAOEPt4lfFw</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Reasoning about cryptographic protocols in the spi calculus</title><source>Springer Books</source><creator>Abadi, Martín ; Gordon, Andrew D.</creator><contributor>Mazurkiewicz, Antoni ; Winkowski, Józef</contributor><creatorcontrib>Abadi, Martín ; Gordon, Andrew D. ; Mazurkiewicz, Antoni ; Winkowski, Józef</creatorcontrib><description>The spi calculus is an extension of the pi calculus with constructs for encryption and decryption. This paper develops the theory of the spi calculus, focusing on techniques for establishing testing equivalence, and applying these techniques to the proof of authenticity and secrecy properties of cryptographic protocols.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540631410</identifier><identifier>ISBN: 9783540631415</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540691884</identifier><identifier>EISBN: 354069188X</identifier><identifier>DOI: 10.1007/3-540-63141-0_5</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Algorithmics. Computability. Computer arithmetics ; Applied sciences ; Closed Process ; Computer science; control theory; systems ; Cryptographic Protocol ; Digital Equipment Corporation ; Exact sciences and technology ; Operational Semantic ; Security Property ; Theoretical computing</subject><ispartof>CONCUR '97: Concurrency Theory, 1997, p.59-73</ispartof><rights>Springer-Verlag Berlin Heidelberg 1997</rights><rights>1997 INIST-CNRS</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/3-540-63141-0_5$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/3-540-63141-0_5$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=2731709$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Mazurkiewicz, Antoni</contributor><contributor>Winkowski, Józef</contributor><creatorcontrib>Abadi, Martín</creatorcontrib><creatorcontrib>Gordon, Andrew D.</creatorcontrib><title>Reasoning about cryptographic protocols in the spi calculus</title><title>CONCUR '97: Concurrency Theory</title><description>The spi calculus is an extension of the pi calculus with constructs for encryption and decryption. This paper develops the theory of the spi calculus, focusing on techniques for establishing testing equivalence, and applying these techniques to the proof of authenticity and secrecy properties of cryptographic protocols.</description><subject>Algorithmics. Computability. Computer arithmetics</subject><subject>Applied sciences</subject><subject>Closed Process</subject><subject>Computer science; control theory; systems</subject><subject>Cryptographic Protocol</subject><subject>Digital Equipment Corporation</subject><subject>Exact sciences and technology</subject><subject>Operational Semantic</subject><subject>Security Property</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540631410</isbn><isbn>9783540631415</isbn><isbn>9783540691884</isbn><isbn>354069188X</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1997</creationdate><recordtype>conference_proceeding</recordtype><recordid>eNotkM1PAyEQxfErsdaeve7BKwo7sCzxZBq_kiYmRs8EWGhX14XA9tD_Xtr6LpPMe5k3-SF0Q8kdJUTcA-aM4AYoo5gofoIWUrRQdo2kbctO0Yw2lGIAJs_Q1cHYZ8k5mhEgNZaCwSVa5PxNiqAughl6-HA6h7Ef15U2YTtVNu3iFNZJx01vq5jCFGwYctWP1bRxVY59ZfVgt8M2X6MLr4fsFv9zjr6enz6Xr3j1_vK2fFzhWDombMAZz23X1dR14Jwpb7a-M0xz7y3V1gjTNpJrB5xKqVurDROSedIZwhuAObo93o06l26f9Gj7rGLqf3XaqVoAFUSWGD7GcnHGtUvKhPCTFSVqD1CBKkzUAYoqAOEPt4lfFw</recordid><startdate>19970101</startdate><enddate>19970101</enddate><creator>Abadi, Martín</creator><creator>Gordon, Andrew D.</creator><general>Springer Berlin Heidelberg</general><general>Springer-Verlag</general><scope>IQODW</scope></search><sort><creationdate>19970101</creationdate><title>Reasoning about cryptographic protocols in the spi calculus</title><author>Abadi, Martín ; Gordon, Andrew D.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-p222t-b3ebf5cdd21ed3eeb6118fdb4a5ffc1acb7b8695ae35199a8cab4794f0db05633</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1997</creationdate><topic>Algorithmics. Computability. Computer arithmetics</topic><topic>Applied sciences</topic><topic>Closed Process</topic><topic>Computer science; control theory; systems</topic><topic>Cryptographic Protocol</topic><topic>Digital Equipment Corporation</topic><topic>Exact sciences and technology</topic><topic>Operational Semantic</topic><topic>Security Property</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Abadi, Martín</creatorcontrib><creatorcontrib>Gordon, Andrew D.</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Abadi, Martín</au><au>Gordon, Andrew D.</au><au>Mazurkiewicz, Antoni</au><au>Winkowski, Józef</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Reasoning about cryptographic protocols in the spi calculus</atitle><btitle>CONCUR '97: Concurrency Theory</btitle><date>1997-01-01</date><risdate>1997</risdate><spage>59</spage><epage>73</epage><pages>59-73</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540631410</isbn><isbn>9783540631415</isbn><eisbn>9783540691884</eisbn><eisbn>354069188X</eisbn><abstract>The spi calculus is an extension of the pi calculus with constructs for encryption and decryption. This paper develops the theory of the spi calculus, focusing on techniques for establishing testing equivalence, and applying these techniques to the proof of authenticity and secrecy properties of cryptographic protocols.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/3-540-63141-0_5</doi><tpages>15</tpages></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | CONCUR '97: Concurrency Theory, 1997, p.59-73 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_2731709 |
| source | Springer Books |
| subjects | Algorithmics. Computability. Computer arithmetics Applied sciences Closed Process Computer science control theory systems Cryptographic Protocol Digital Equipment Corporation Exact sciences and technology Operational Semantic Security Property Theoretical computing |
| title | Reasoning about cryptographic protocols in the spi calculus |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-10T21%3A12%3A57IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-pascalfrancis_sprin&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Reasoning%20about%20cryptographic%20protocols%20in%20the%20spi%20calculus&rft.btitle=CONCUR%20'97:%20Concurrency%20Theory&rft.au=Abadi,%20Mart%C3%ADn&rft.date=1997-01-01&rft.spage=59&rft.epage=73&rft.pages=59-73&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540631410&rft.isbn_list=9783540631415&rft_id=info:doi/10.1007/3-540-63141-0_5&rft_dat=%3Cpascalfrancis_sprin%3E2731709%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540691884&rft.eisbn_list=354069188X&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |