A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs
We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buchkapitel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 263 |
|---|---|
| container_issue | |
| container_start_page | 252 |
| container_title | |
| container_volume | |
| creator | Corin, Ricardo den Hartog, Jerry |
| description | We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal. |
| doi_str_mv | 10.1007/11787006_22 |
| format | Book Chapter |
| fullrecord | <record><control><sourceid>pascalfrancis_sprin</sourceid><recordid>TN_cdi_pascalfrancis_primary_19993489</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>19993489</sourcerecordid><originalsourceid>FETCH-LOGICAL-j322t-528f31884629f7e94368b7a30169e6183337d70eb9697e61b77360636a83dd9b3</originalsourceid><addsrcrecordid>eNpNkD9PwzAUxM0_ibZ04gtkYWAIPPultt9YqtIiRYIBZstunJKS1pGdpd-eoILEdNL97m44xm45PHAA9ci50gpAGiHO2JSUxlkBOCPQ_JyNuOQ8Ryzogo3_gKJLNgIEkZMq8JqNU9oBgFAkRmw5z95icNY1bZP6ZpOtg40-T_2x9VkZtoNTh5it7N7nTzb5KlvEY9eHbbTd5wCHcqjTDbuqbZv89Fcn7ON5-b5Y5-Xr6mUxL_MdCtHnM6Fr5FoXUlCtPBUotVMWgUvykmtEVJUC70iSGgynFEqQKK3GqiKHE3Z32u1s2ti2jvawaZLpYrO38Wg4EWGhacjdn3JpQIetj8aF8JUMB_Nzovl3In4DmyRcXQ</addsrcrecordid><sourcetype>Index Database</sourcetype><iscdi>true</iscdi><recordtype>book_chapter</recordtype></control><display><type>book_chapter</type><title>A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs</title><source>Springer Books</source><creator>Corin, Ricardo ; den Hartog, Jerry</creator><contributor>Preneel, Bart ; Bugliesi, Michele ; Wegener, Ingo ; Sassone, Vladimiro</contributor><creatorcontrib>Corin, Ricardo ; den Hartog, Jerry ; Preneel, Bart ; Bugliesi, Michele ; Wegener, Ingo ; Sassone, Vladimiro</creatorcontrib><description>We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.</description><identifier>ISSN: 0302-9743</identifier><identifier>ISBN: 3540359079</identifier><identifier>ISBN: 9783540359074</identifier><identifier>ISBN: 3540359044</identifier><identifier>ISBN: 9783540359043</identifier><identifier>EISSN: 1611-3349</identifier><identifier>EISBN: 9783540359081</identifier><identifier>EISBN: 3540359087</identifier><identifier>DOI: 10.1007/11787006_22</identifier><language>eng</language><publisher>Berlin, Heidelberg: Springer Berlin Heidelberg</publisher><subject>Applied sciences ; Automata. Abstract machines. Turing machines ; Computer science; control theory; systems ; Deterministic State ; Exact sciences and technology ; Probabilistic Choice ; Security Notion ; Security Proof ; Signature Scheme ; Theoretical computing</subject><ispartof>Automata, Languages and Programming, 2006, p.252-263</ispartof><rights>Springer-Verlag Berlin Heidelberg 2006</rights><rights>2008 INIST-CNRS</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><relation>Lecture Notes in Computer Science</relation></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://link.springer.com/content/pdf/10.1007/11787006_22$$EPDF$$P50$$Gspringer$$H</linktopdf><linktohtml>$$Uhttps://link.springer.com/10.1007/11787006_22$$EHTML$$P50$$Gspringer$$H</linktohtml><link.rule.ids>309,310,775,776,780,785,786,789,4036,4037,27902,38232,41418,42487</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=19993489$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><contributor>Preneel, Bart</contributor><contributor>Bugliesi, Michele</contributor><contributor>Wegener, Ingo</contributor><contributor>Sassone, Vladimiro</contributor><creatorcontrib>Corin, Ricardo</creatorcontrib><creatorcontrib>den Hartog, Jerry</creatorcontrib><title>A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs</title><title>Automata, Languages and Programming</title><description>We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.</description><subject>Applied sciences</subject><subject>Automata. Abstract machines. Turing machines</subject><subject>Computer science; control theory; systems</subject><subject>Deterministic State</subject><subject>Exact sciences and technology</subject><subject>Probabilistic Choice</subject><subject>Security Notion</subject><subject>Security Proof</subject><subject>Signature Scheme</subject><subject>Theoretical computing</subject><issn>0302-9743</issn><issn>1611-3349</issn><isbn>3540359079</isbn><isbn>9783540359074</isbn><isbn>3540359044</isbn><isbn>9783540359043</isbn><isbn>9783540359081</isbn><isbn>3540359087</isbn><fulltext>true</fulltext><rsrctype>book_chapter</rsrctype><creationdate>2006</creationdate><recordtype>book_chapter</recordtype><recordid>eNpNkD9PwzAUxM0_ibZ04gtkYWAIPPultt9YqtIiRYIBZstunJKS1pGdpd-eoILEdNL97m44xm45PHAA9ci50gpAGiHO2JSUxlkBOCPQ_JyNuOQ8Ryzogo3_gKJLNgIEkZMq8JqNU9oBgFAkRmw5z95icNY1bZP6ZpOtg40-T_2x9VkZtoNTh5it7N7nTzb5KlvEY9eHbbTd5wCHcqjTDbuqbZv89Fcn7ON5-b5Y5-Xr6mUxL_MdCtHnM6Fr5FoXUlCtPBUotVMWgUvykmtEVJUC70iSGgynFEqQKK3GqiKHE3Z32u1s2ti2jvawaZLpYrO38Wg4EWGhacjdn3JpQIetj8aF8JUMB_Nzovl3In4DmyRcXQ</recordid><startdate>2006</startdate><enddate>2006</enddate><creator>Corin, Ricardo</creator><creator>den Hartog, Jerry</creator><general>Springer Berlin Heidelberg</general><general>Springer</general><scope>IQODW</scope></search><sort><creationdate>2006</creationdate><title>A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs</title><author>Corin, Ricardo ; den Hartog, Jerry</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-j322t-528f31884629f7e94368b7a30169e6183337d70eb9697e61b77360636a83dd9b3</frbrgroupid><rsrctype>book_chapters</rsrctype><prefilter>book_chapters</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Applied sciences</topic><topic>Automata. Abstract machines. Turing machines</topic><topic>Computer science; control theory; systems</topic><topic>Deterministic State</topic><topic>Exact sciences and technology</topic><topic>Probabilistic Choice</topic><topic>Security Notion</topic><topic>Security Proof</topic><topic>Signature Scheme</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Corin, Ricardo</creatorcontrib><creatorcontrib>den Hartog, Jerry</creatorcontrib><collection>Pascal-Francis</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Corin, Ricardo</au><au>den Hartog, Jerry</au><au>Preneel, Bart</au><au>Bugliesi, Michele</au><au>Wegener, Ingo</au><au>Sassone, Vladimiro</au><format>book</format><genre>bookitem</genre><ristype>CHAP</ristype><atitle>A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs</atitle><btitle>Automata, Languages and Programming</btitle><seriestitle>Lecture Notes in Computer Science</seriestitle><date>2006</date><risdate>2006</risdate><spage>252</spage><epage>263</epage><pages>252-263</pages><issn>0302-9743</issn><eissn>1611-3349</eissn><isbn>3540359079</isbn><isbn>9783540359074</isbn><isbn>3540359044</isbn><isbn>9783540359043</isbn><eisbn>9783540359081</eisbn><eisbn>3540359087</eisbn><abstract>We extend a Probabilistic Hoare-style logic to formalize game-based cryptographic proofs. Our approach provides a systematic and rigorous framework, thus preventing errors from being introduced. We illustrate our technique by proving semantic security of ElGamal.</abstract><cop>Berlin, Heidelberg</cop><pub>Springer Berlin Heidelberg</pub><doi>10.1007/11787006_22</doi><tpages>12</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0302-9743 |
| ispartof | Automata, Languages and Programming, 2006, p.252-263 |
| issn | 0302-9743 1611-3349 |
| language | eng |
| recordid | cdi_pascalfrancis_primary_19993489 |
| source | Springer Books |
| subjects | Applied sciences Automata. Abstract machines. Turing machines Computer science control theory systems Deterministic State Exact sciences and technology Probabilistic Choice Security Notion Security Proof Signature Scheme Theoretical computing |
| title | A Probabilistic Hoare-style Logic for Game-Based Cryptographic Proofs |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-08T00%3A49%3A33IST&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=bookitem&rft.atitle=A%20Probabilistic%20Hoare-style%20Logic%20for%20Game-Based%20Cryptographic%20Proofs&rft.btitle=Automata,%20Languages%20and%20Programming&rft.au=Corin,%20Ricardo&rft.date=2006&rft.spage=252&rft.epage=263&rft.pages=252-263&rft.issn=0302-9743&rft.eissn=1611-3349&rft.isbn=3540359079&rft.isbn_list=9783540359074&rft.isbn_list=3540359044&rft.isbn_list=9783540359043&rft_id=info:doi/10.1007/11787006_22&rft_dat=%3Cpascalfrancis_sprin%3E19993489%3C/pascalfrancis_sprin%3E%3Curl%3E%3C/url%3E&rft.eisbn=9783540359081&rft.eisbn_list=3540359087&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |