Filters








605,555 Hits in 4.0 sec

Trade-Offs in Distributed Interactive Proofs

Pierluigi Crescenzi, Pierre Fraigniaud, Ami Paz, Michael Wagner
<span title="2019-10-11">2019</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2pcluxp32rfojgwekdrryxoaqu" style="color: black;">International Symposium on Distributed Computing</a> </i> &nbsp;
In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs.  ...  Our results also connect distributed interactive proofs with the established field of distributed verification.  ...  Our Results In this paper, we study the power of distributed interactive proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.13">doi:10.4230/lipics.disc.2019.13</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/wdag/CrescenziFP19.html">dblp:conf/wdag/CrescenziFP19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/izw5mr56vfdqdl3m6aer3jjoxa">fatcat:izw5mr56vfdqdl3m6aer3jjoxa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220307212158/https://drops.dagstuhl.de/opus/volltexte/2019/11320/pdf/LIPIcs-DISC-2019-13.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/0c/31/0c31d770343a468e89756ab50899e3c30f91f206.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.disc.2019.13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Trade-offs in Distributed Interactive Proofs [article]

Pierluigi Crescenzi and Pierre Fraigniaud and Ami Paz
<span title="2019-08-09">2019</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In the spirit of sequential interactive proofs theory, we study the power of distributed interactive proofs.  ...  Our results also connect distributed interactive proofs with the established field of distributed verification.  ...  . ◭ Since Σ 1 LD ⊆ dAM ∩ dMA, an immediate corollary of this theorem is that every distributed language on d-regular graphs with O(1)-bit inputs belongs to dAM( O(n), O(dn)).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.03363v1">arXiv:1908.03363v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/glgjime6mzeqvgv6m3pgsiydwu">fatcat:glgjime6mzeqvgv6m3pgsiydwu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908044615/https://arxiv.org/pdf/1908.03363v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/ed/5c/ed5ce6253f4816c96b2eefe69340f662802c3ac8.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1908.03363v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Shared vs Private Randomness in Distributed Interactive Proofs [article]

Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport
<span title="2020-06-29">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Our results also connect shared randomness in distributed interactive proofs with distributed verification, and new lower bounds are obtained.  ...  In distributed interactive proofs, the nodes of a graph G interact with a powerful but untrustable prover who tries to convince them, in a small number of rounds and through short messages, that G satisfies  ...  This contradicts the fact that P was a correct distributed interactive proof for amos.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.16191v1">arXiv:2006.16191v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/xy3awlagcfbr7entqm4y7elj5q">fatcat:xy3awlagcfbr7entqm4y7elj5q</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200708150913/https://arxiv.org/pdf/2006.16191v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/d4/ee/d4ee498107976df75ca47451bd0f23996f4bc2dc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2006.16191v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

The Power of Distributed Verifiers in Interactive Proofs [article]

Moni Naor and Merav Parter and Eylon Yogev
<span title="2018-12-28">2018</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
In this work, we provide a new general framework for distributed interactive proofs that allows one to translate standard interactive protocols to ones where the verifier is distributed with short proof  ...  This interactive model was introduced by Kol, Oshman and Saxena (PODC 2018) as a generalization of non-interactive distributed proofs.  ...  Rothblum and for in depth discussion about interactive protocols and in particular for the work on Theorem 10 which is joint with him. We also thank Ron D.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.10917v1">arXiv:1812.10917v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dzanv6guibbh7jm6bkgqfqsjgq">fatcat:dzanv6guibbh7jm6bkgqfqsjgq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908114807/https://arxiv.org/pdf/1812.10917v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/cf/be/cfbe879634d9f658a467a0c61d10be502240a7dc.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1812.10917v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Distributed Interactive Proofs for the Recognition of Some Geometric Intersection Graph Classes [article]

Benjamin Jauregui, Pedro Montealegre, Ivan Rapaport
<span title="2021-12-06">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
Recently, in the context of distributed certification and distributed interactive proofs, the recognition of graph classes has started to be intensively studied.  ...  For the other two classes, we give three-round distributed interactive protocols that use messages and certificates of size 𝒪(log n).  ...  The distributed interactive proof model is clearly more powerful than the PLS model.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.03206v1">arXiv:2112.03206v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tjdh5mpu4zc23kzoenkzbnomp4">fatcat:tjdh5mpu4zc23kzoenkzbnomp4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20211208145550/https://arxiv.org/pdf/2112.03206v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/00/ed/00ed4af4b57a69d62099247494e7459816882c59.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2112.03206v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Compact Distributed Interactive Proofs for the Recognition of Cographs and Distance-Hereditary Graphs [article]

Pedro Montealegre, Diego Ramírez-Romero, Iván Rapaport
<span title="2020-12-06">2020</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
First, we show that there exists a distributed interactive proof for the recognition of cographs with two rounds of interaction.  ...  We present compact distributed interactive proofs for the recognition of two important graph classes, well-studied in the context of centralized algorithms, namely complement reducible graphs and distance-hereditary  ...  In [8, 34] the role of shared and private randomness in distributed interactive proofs is studied.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2012.03185v1">arXiv:2012.03185v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mdk34athmzh53ihez34ff3lvky">fatcat:mdk34athmzh53ihez34ff3lvky</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201209055721/https://arxiv.org/pdf/2012.03185v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/46/45/4645d9b3c8dd57cecd3d14fcb41ebbbea6e8ad4d.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2012.03185v1" title="arxiv.org access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> arxiv.org </button> </a>

Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments [chapter]

Masayuki Abe, Ronald Cramer, Serge Fehr
<span title="">2002</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
Next we show how to construct non-interactive proofs of partial knowledge [8] in this distributed setting.  ...  We also show how to construct efficient non-interactive zero-knowledge proofs for circuit satisfiability in the distributed setting.  ...  A distributed verifier proof is called non-interactive, if the structure of the protocol is as follows.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36178-2_13">doi:10.1007/3-540-36178-2_13</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/iht5tyrvdvg4zbzmorvul6ve4u">fatcat:iht5tyrvdvg4zbzmorvul6ve4u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811100222/https://www.iacr.org/cryptodb/archive/2002/ASIACRYPT/40/40.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c5/49/c549f66aca1f25f44be71cbfc40481fc06adb106.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-36178-2_13"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Identification of Chicken GITR and GITR Ligand, Proof of Their Mutual Interaction, and Analysis of Chicken GITR Tissue Distribution by a Novel Antibody That Reveals Expression on Activated T Cells and Erythrocytes

Stephanie Scherer, Daniela Huhle, Thomas W. Göbel
<span title="2018-11-01">2018</span> <i title="The American Association of Immunologists"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/w7j4lsw2cfbjzd64e47jksbnri" style="color: black;">ImmunoHorizons</a> </i> &nbsp;
Identification of Chicken GITR and GITR Ligand, Proof of Their INTRODUCTION Members of the TNFR superfamily (TNFRSF) and their respective ligands create a communications system, which ensures the development  ...  Recombinant expression and interaction of soluble chGITRL and membrane-bound chGITR To further explore the interaction of GITR and its ligand, we cloned and expressed both genes. chGITRL was successfully  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4049/immunohorizons.1800065">doi:10.4049/immunohorizons.1800065</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/54ttunf3ondvrasbmi33iddx2u">fatcat:54ttunf3ondvrasbmi33iddx2u</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190430182951/http://www.immunohorizons.org/content/immunohorizon/2/10/324.full.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/89/7f/897f45500e2ffcb82d53ccfe960e093fe5405ba7.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4049/immunohorizons.1800065"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Shared vs Private Randomness in Distributed Interactive Proofs

Pedro Montealegre, Diego Ramírez-Romero, Ivan Rapaport, Yixin Cao, Siu-Wing Cheng, Minming Li
<span title="2020-12-04">2020</span>
Our results also connect shared randomness in distributed interactive proofs with distributed verification, and new lower bounds are obtained.  ...  In distributed interactive proofs, the nodes of a graph G interact with a powerful but untrustable prover who tries to convince them, in a small number of rounds and through short messages, that G satisfies  ...  In [5] , the authors explore the role of shared randomness in distributed interactive proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.isaac.2020.51">doi:10.4230/lipics.isaac.2020.51</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gghl3ap22fakpfldyd725d6sle">fatcat:gghl3ap22fakpfldyd725d6sle</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20201212133255/https://drops.dagstuhl.de/opus/volltexte/2020/13395/pdf/LIPIcs-ISAAC-2020-51.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/66/56/6656b1995ee78a1c62c0dc71a86586b9e7cbb375.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.isaac.2020.51"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Proofs of Proximity for Distribution Testing

Alessandro Chiesa, Tom Gur, Marc Herbstritt
<span title="2018-01-05">2018</span> <i > <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/cjckxhgqp5dobfucnrxpxnsy4u" style="color: black;">Innovations in Theoretical Computer Science</a> </i> &nbsp;
We also study IP distribution testers, a more general notion where the tester interacts with an all-powerful untrusted prover.  ...  We initiate a study of proofs of proximity for properties of distributions.  ...  We thank Clément Canonne for many discussions concerning distribution testing and for offering advice regarding several specific topics.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.itcs.2018.53">doi:10.4230/lipics.itcs.2018.53</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/innovations/ChiesaG18.html">dblp:conf/innovations/ChiesaG18</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ytaqgkqgpjd2nfx6siju5j6xzq">fatcat:ytaqgkqgpjd2nfx6siju5j6xzq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220124023547/https://drops.dagstuhl.de/opus/volltexte/2018/8311/pdf/LIPIcs-ITCS-2018-53.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/2d/20/2d20de7bdd386de5b5f7b1f81613c916b30e601b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.itcs.2018.53"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Using Zero-Knowledge Proof for Secure Data Transmission on Distributed Network

E. Jansirani, Dr. N. Kowsalya
<span title="2022-03-10">2022</span> <i title="Technoscience Academy"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/zondmso2kjfrzbdtowoynb6yoe" style="color: black;">International Journal of Scientific Research in Science and Technology</a> </i> &nbsp;
So in this paper we discuss about Zero-Knowledge Proof (ZKP) which is also based on cryptographic technique. ZKP is also useful in secure data transmission without sharing key values between users.  ...  Based on this Zero Knowledge Proof has divided into two main categories. i) Interactive Zero Knowledge Proof ii) Non-interactive Zero Knowledge Proof A.  ...  Interactive Zero Knowledge Proof: In this type of ZKP needs interaction between users for each and every transaction.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32628/ijsrst229211">doi:10.32628/ijsrst229211</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/kbvesgoti5crja6ihfqbqnccjy">fatcat:kbvesgoti5crja6ihfqbqnccjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220508133048/https://ijsrst.com/paper/9336.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/90/de/90def964c3b81d5e6a446602f13089c2f7af5e92.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.32628/ijsrst229211"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

Interactive Parallel Analysis on the ALICE Grid with the PROOF Framework [chapter]

Marco Meoni
<span title="">2009</span> <i title="Springer Berlin Heidelberg"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
PROOF enables interactive parallel processing of data distributed on clusters of computers or multi-core machines.  ...  The ALICE experiment at CERN LHC is intensively using a PROOF cluster for fast analysis and reconstruction.  ...  The distributed nature of the PROOF setup is hidden.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-01970-8_12">doi:10.1007/978-3-642-01970-8_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zw46fykt6zckvifysehd422a3m">fatcat:zw46fykt6zckvifysehd422a3m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20181030104523/https://link.springer.com/content/pdf/10.1007%2F978-3-642-01970-8_12.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/24/e4/24e4723e2e9b785ab898a1dbe70af01f3e3ca378.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-01970-8_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems

Oded Goldreich, Silvio Micali, Avi Wigderson
<span title="1991-07-01">1991</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/r72grtxx6jad5hjzl7fxcunwhi" style="color: black;">Journal of the ACM</a> </i> &nbsp;
have zero-knowledge interactive proofs.  ...  The mere existence of an interactive proof for graph nonisomorphism is interesting, since graph nonisomorphism is not known to be in NP and hence no efficient proofs were known before for demonstrating  ...  WHAT Is AN INTERACTIVE PROOF?  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/116825.116852">doi:10.1145/116825.116852</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/snodcvveqnez3c2zc5fqcyrmsm">fatcat:snodcvveqnez3c2zc5fqcyrmsm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20140701234507/http://nakamotoinstitute.org/static/docs/zero-knowledge-proofs.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/eb/a8/eba8a236ca3afa59bba5c86b12611d00eea6e5ba.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/116825.116852"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Distributed Online Judge System for Interactive Theorem Provers

Takahisa Mizuno, Shin-ya Nishizaki, Ford Lumban Gaol
<span title="">2014</span> <i title="EDP Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/oduy4e4fvfhovftixyndrlkomi" style="color: black;">EPJ Web of Conferences</a> </i> &nbsp;
The distinctive feature of this architecture is that our online judge system is distributed on the network and especially involves volunteer computing.  ...  In this paper, we propose a new software design of an online judge system for interactive theorem proving.  ...  In comparison with the existing proof-checkers, our proposed system has a merit that it can be used in the open distributed environment safely.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/epjconf/20146800016">doi:10.1051/epjconf/20146800016</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/4jaqbtjim5aybo2x2k4xi6lq3a">fatcat:4jaqbtjim5aybo2x2k4xi6lq3a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170814091453/https://www.epj-conferences.org/articles/epjconf/pdf/2014/05/epjconf_icas2013_00016.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/18/21/18210519f9770994a1c8c10a50b09363c84dbc24.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/epjconf/20146800016"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="unlock alternate icon" style="background-color: #fb971f;"></i> Publisher / doi.org </button> </a>

On transformation of interactive proofs that preserve the prover's complexity

Salil Vadhan
<span title="">2000</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the thirty-second annual ACM symposium on Theory of computing - STOC &#39;00</a> </i> &nbsp;
[FGM · 89] from interactive proofs to ones with perfect completeness.  ...  On transformations of interactive proofs that preserve the prover's complexity.  ...  Interactive Proofs.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/335305.335330">doi:10.1145/335305.335330</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Vadhan00.html">dblp:conf/stoc/Vadhan00</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/37wn3ym4zrdbnddwgv6lb5cmey">fatcat:37wn3ym4zrdbnddwgv6lb5cmey</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180722140250/https://dash.harvard.edu/bitstream/handle/1/4728403/Vadhan_ProversComplexity.pdf?sequence=2" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/c0/f2/c0f23455bb15a193fb24a617e763c64565f3ba34.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/335305.335330"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 605,555 results