On the power of multi-prover interactive protocols
We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracle...
Gespeichert in:
| Veröffentlicht in: | Theoretical computer science 1994-11, Vol.134 (2), p.545-557 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Artikel |
| Sprache: | eng |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 557 |
|---|---|
| container_issue | 2 |
| container_start_page | 545 |
| container_title | Theoretical computer science |
| container_volume | 134 |
| creator | Fortnow, Lance Rompel, John Sipser, Michael |
| description | We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracles as provers. We also show that every language accepted by these models lies in nondeterministic exponential time. We exhibit a relativized world where a co-NP language does not have multiple prover interactive proofs. Finally, we show a simple example that one cannot parallelize multiple prover protocols as easily as the single prover model. |
| doi_str_mv | 10.1016/0304-3975(94)90251-8 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_26494308</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>0304397594902518</els_id><sourcerecordid>26494308</sourcerecordid><originalsourceid>FETCH-LOGICAL-c447t-ffbb477743341e7b9fd98b720a937390710c1fcde78c13b443834fb975789a493</originalsourceid><addsrcrecordid>eNp9kE9LAzEQxYMoWKvfwMOeRA_RZDNtkosgxX9Q6EXPYTc7wch2U5O04rc3a8WjcxkGfu_NvCHknLNrzvj8hgkGVGg5u9RwpVk941QdkAlXUtO61nBIJn_IMTlJ6Z2Vmsn5hNSrocpvWG3CJ8YquGq97bOnmxh2ZfZDxtjY7HeFiCEHG_p0So5c0yc8--1T8vpw_7J4osvV4_PibkktgMzUubYFKSUIARxlq12nVStr1mghhWaSM8ud7VAqy0ULIJQA15YTpdINaDElF3vfsvljiymbtU8W-74ZMGyTqeegQTBVQNiDNoaUIjqziX7dxC_DmRkfZMb0ZkxvNJifB5lRdruXYQmx8xhNsh4Hi52PaLPpgv_f4BsNQWuS</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>26494308</pqid></control><display><type>article</type><title>On the power of multi-prover interactive protocols</title><source>Elsevier ScienceDirect Journals Complete</source><source>EZB-FREE-00999 freely available EZB journals</source><creator>Fortnow, Lance ; Rompel, John ; Sipser, Michael</creator><creatorcontrib>Fortnow, Lance ; Rompel, John ; Sipser, Michael</creatorcontrib><description>We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracles as provers. We also show that every language accepted by these models lies in nondeterministic exponential time. We exhibit a relativized world where a co-NP language does not have multiple prover interactive proofs. Finally, we show a simple example that one cannot parallelize multiple prover protocols as easily as the single prover model.</description><identifier>ISSN: 0304-3975</identifier><identifier>EISSN: 1879-2294</identifier><identifier>DOI: 10.1016/0304-3975(94)90251-8</identifier><language>eng</language><publisher>Elsevier B.V</publisher><ispartof>Theoretical computer science, 1994-11, Vol.134 (2), p.545-557</ispartof><rights>1994</rights><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c447t-ffbb477743341e7b9fd98b720a937390710c1fcde78c13b443834fb975789a493</citedby><cites>FETCH-LOGICAL-c447t-ffbb477743341e7b9fd98b720a937390710c1fcde78c13b443834fb975789a493</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://dx.doi.org/10.1016/0304-3975(94)90251-8$$EHTML$$P50$$Gelsevier$$Hfree_for_read</linktohtml><link.rule.ids>314,780,784,3550,27924,27925,45995</link.rule.ids></links><search><creatorcontrib>Fortnow, Lance</creatorcontrib><creatorcontrib>Rompel, John</creatorcontrib><creatorcontrib>Sipser, Michael</creatorcontrib><title>On the power of multi-prover interactive protocols</title><title>Theoretical computer science</title><description>We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracles as provers. We also show that every language accepted by these models lies in nondeterministic exponential time. We exhibit a relativized world where a co-NP language does not have multiple prover interactive proofs. Finally, we show a simple example that one cannot parallelize multiple prover protocols as easily as the single prover model.</description><issn>0304-3975</issn><issn>1879-2294</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1994</creationdate><recordtype>article</recordtype><recordid>eNp9kE9LAzEQxYMoWKvfwMOeRA_RZDNtkosgxX9Q6EXPYTc7wch2U5O04rc3a8WjcxkGfu_NvCHknLNrzvj8hgkGVGg5u9RwpVk941QdkAlXUtO61nBIJn_IMTlJ6Z2Vmsn5hNSrocpvWG3CJ8YquGq97bOnmxh2ZfZDxtjY7HeFiCEHG_p0So5c0yc8--1T8vpw_7J4osvV4_PibkktgMzUubYFKSUIARxlq12nVStr1mghhWaSM8ud7VAqy0ULIJQA15YTpdINaDElF3vfsvljiymbtU8W-74ZMGyTqeegQTBVQNiDNoaUIjqziX7dxC_DmRkfZMb0ZkxvNJifB5lRdruXYQmx8xhNsh4Hi52PaLPpgv_f4BsNQWuS</recordid><startdate>19941121</startdate><enddate>19941121</enddate><creator>Fortnow, Lance</creator><creator>Rompel, John</creator><creator>Sipser, Michael</creator><general>Elsevier B.V</general><scope>6I.</scope><scope>AAFTH</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>19941121</creationdate><title>On the power of multi-prover interactive protocols</title><author>Fortnow, Lance ; Rompel, John ; Sipser, Michael</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c447t-ffbb477743341e7b9fd98b720a937390710c1fcde78c13b443834fb975789a493</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1994</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Fortnow, Lance</creatorcontrib><creatorcontrib>Rompel, John</creatorcontrib><creatorcontrib>Sipser, Michael</creatorcontrib><collection>ScienceDirect Open Access Titles</collection><collection>Elsevier:ScienceDirect:Open Access</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>Theoretical computer science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fortnow, Lance</au><au>Rompel, John</au><au>Sipser, Michael</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>On the power of multi-prover interactive protocols</atitle><jtitle>Theoretical computer science</jtitle><date>1994-11-21</date><risdate>1994</risdate><volume>134</volume><issue>2</issue><spage>545</spage><epage>557</epage><pages>545-557</pages><issn>0304-3975</issn><eissn>1879-2294</eissn><abstract>We look at complexity issues of interactive proof systems with multiple provers separated from each other. This model, developed by Ben-Or et al. (1988) allows the verifier to play the provers off each other. We show this model equivalent to an alternative interactive proof system model using oracles as provers. We also show that every language accepted by these models lies in nondeterministic exponential time. We exhibit a relativized world where a co-NP language does not have multiple prover interactive proofs. Finally, we show a simple example that one cannot parallelize multiple prover protocols as easily as the single prover model.</abstract><pub>Elsevier B.V</pub><doi>10.1016/0304-3975(94)90251-8</doi><tpages>13</tpages><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0304-3975 |
| ispartof | Theoretical computer science, 1994-11, Vol.134 (2), p.545-557 |
| issn | 0304-3975 1879-2294 |
| language | eng |
| recordid | cdi_proquest_miscellaneous_26494308 |
| source | Elsevier ScienceDirect Journals Complete; EZB-FREE-00999 freely available EZB journals |
| title | On the power of multi-prover interactive protocols |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-02T08%3A27%3A34IST&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=On%20the%20power%20of%20multi-prover%20interactive%20protocols&rft.jtitle=Theoretical%20computer%20science&rft.au=Fortnow,%20Lance&rft.date=1994-11-21&rft.volume=134&rft.issue=2&rft.spage=545&rft.epage=557&rft.pages=545-557&rft.issn=0304-3975&rft.eissn=1879-2294&rft_id=info:doi/10.1016/0304-3975(94)90251-8&rft_dat=%3Cproquest_cross%3E26494308%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=26494308&rft_id=info:pmid/&rft_els_id=0304397594902518&rfr_iscdi=true |