Filters








211,317 Hits in 3.0 sec

A proof of protocol correctness

J. Pachl
<span title="">1994</span> <i title="EDP Sciences"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/foywj2stzfcwdln5izx2cxkroe" style="color: black;">RAIRO - Theoretical Informatics and Applications</a> </i> &nbsp;
The present paper contains a formai proof that the protocol described in [3] is indeed "correct" (in the sense defined below).  ...  R p = Ri u , S p = S h u where p = uN + i, 0 < i < N, A protocol defines each S* u in terms of (data* JO < j < z), ( J | O (S;|iO When we discuss the correctness of protocols in this setting* it is useful  ...  Summing over k from 2 to L(V 2 ) ^J we g et Proof of the theorem in section 3: In view of Lemma 11, it is enough to prove that if u > ro, 0 < i < N 9 T(u) < 1 and send* (i, u) then SEND» [i + 1, N -1]  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/ita/1994283-402131">doi:10.1051/ita/1994283-402131</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mgknyqzf7zduzmr3kjr6vfbow4">fatcat:mgknyqzf7zduzmr3kjr6vfbow4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190428213058/https://www.rairo-ita.org/articles/ita/pdf/1994/05/ita1994283-402131.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/4d/56/4d56c44313417a8c210b5f8feb51c0ab25ee5886.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1051/ita/1994283-402131"> <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>

A Proof of Correctness for the Tardis Cache Coherence Protocol [article]

Xiangyao Yu, Muralidaran Vijayaraghavan, Srinivas Devadas
<span title="2015-05-24">2015</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We prove the correctness of a recently-proposed cache coherence protocol, Tardis, which is simple, yet scalable to high processor counts, because it only requires O(logN) storage per cacheline for an N-processor  ...  Our proof is based on simple and intuitive invariants of the system and thus applies to any system scale and many variants of Tardis.  ...  Conclusion We provided simple, yet rigorous proofs of correctness for a recently-proposed scalable cache coherence protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.06459v1">arXiv:1505.06459v1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/lnbbfidlsnfjjd5iwyjetpfe7e">fatcat:lnbbfidlsnfjjd5iwyjetpfe7e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200908232050/https://arxiv.org/pdf/1505.06459v1.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/f3/66/f3661f31b467ed122865d3467f20f87213052df3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1505.06459v1" 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>

A Correctness Proof of the Bakery Protocol in μCRL [chapter]

Jan Friso Groote, Henri Korver
<span title="">1995</span> <i title="Springer London"> Workshops in Computing </i> &nbsp;
Then the protocol is proven correct using a proof system that has been developed for CRL.  ...  A speci cation of the bakery protocol is given in CRL. We p r o vide a simple correctness criterion for the protocol.  ...  d ) With this speci cation of a queue the correctness of the bakery protocol is stated as follows. n > 0 !  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4471-2120-6_3">doi:10.1007/978-1-4471-2120-6_3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vbtgvpaujfchxk7jlt2ga4i45i">fatcat:vbtgvpaujfchxk7jlt2ga4i45i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20180725223723/https://dspace.library.uu.nl/bitstream/handle/1874/26265/preprint80.pdf;jsessionid=BC7A320959D00EBC3EE920E5ACD5B4F0?sequence=1" 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/ea/2d/ea2d2ebec477fc98f087e6e5e1b1965b9a971791.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-1-4471-2120-6_3"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A Correctness Proof of a One-bit Sliding Window Protocol in CRL

M. A. Bezem
<span title="1994-04-01">1994</span> <i title="Oxford University Press (OUP)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/bf4qaipmsrghrjyxonrsmqevie" style="color: black;">Computer journal</a> </i> &nbsp;
We model a one-bit sliding window protocol and prove that its external behaviour is a bi-directional bu er of capacity 2 . The proof is given in CRL, which is a process algebra extended with data.  ...  Both concepts seem promising as tools for the veri cation of larger and more complex protocols.  ...  In this paper we p r o vide a correctness proof for a bidirectional sliding window protocol that has bu er size 1.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comjnl/37.4.289">doi:10.1093/comjnl/37.4.289</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/atfjcwt53vb7pgtgwhwknwbxue">fatcat:atfjcwt53vb7pgtgwhwknwbxue</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190222091438/http://pdfs.semanticscholar.org/3654/3618e579fbb45776c48e14ae35c57e58f3e5.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/36/54/36543618e579fbb45776c48e14ae35c57e58f3e5.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1093/comjnl/37.4.289"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> oup.com </button> </a>

A little knowledge goes a long way: knowledge-based derivations and correctness proofs for a family of protocols

Joseph Y. Halpern, Lenore D. Zuck
<span title="1992-07-01">1992</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;
Ideally, the design and verification of a protocol would be closely related and one could straightforwardly derive correctness proofs from the design methodology.  ...  Although the proofs in the papers cited do indeed demonstrate correctness, they do not usually help the reader to understand why the protocol is correct.  ...  We would particularly like to thank Brent Hailpern, who started us thinking about the AUY protocols. We also thank Ron Fagin  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/146637.146638">doi:10.1145/146637.146638</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/vhqwfxhmbjgrbfbnt3eegw5ske">fatcat:vhqwfxhmbjgrbfbnt3eegw5ske</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20040928164827/http://pdptlg.csie.nctu.edu.tw:80/paper/Common%20KnowledgechenssJACMv39i3p449.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/7b/34/7b346e2654cb39d55a8a6629eb95f122c346c905.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/146637.146638"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Analysis of a Multi-party Fair Exchange Protocol and Formal Proof of Correctness in the Strand Space Model [chapter]

Aybek Mukhamedov, Steve Kremer, Eike Ritter
<span title="">2005</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;
We identify flaws in the fixed version of the protocol, propose a corrected version, and give a formal proof of correctness in the strand space model.  ...  A multi-party fair exchange protocol is a cryptographic protocol allowing several parties to exchange commodities in such a way that everyone gives an item away if and only if it receives an item in return  ...  We come up with a fixed version and give a proof of correctness in the strand space model [21] . Proving this protocol correct introduces several challenges.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11507840_23">doi:10.1007/11507840_23</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/n6ispsr4dnet7pv5k33eaqfepu">fatcat:n6ispsr4dnet7pv5k33eaqfepu</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417181234/http://www.cs.bham.ac.uk/~exr/papers/strand.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/a8/4c/a84c338ce4cb7f8145da2c6aa74dcbf159644a17.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11507840_23"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A type system for resource protocol verification and its correctness proof

Corneliu Popeea, Wei-Ngan Chin
<span title="">2004</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/4inzarpn6bccxa4a445nlydsbi" style="color: black;">Proceedings of the 2004 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation - PEPM &#39;04</a> </i> &nbsp;
We formalise an operational semantics for the language and provide a correctness proof which confirms that well-typed programs conform to the specified protocol of each resource type.  ...  We present a new method, based on a form of dependent typing, to verify the correct usage of resources in a program.  ...  The anonymous referees provided many valuable comments that helped streamline the presentation of the paper.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1014007.1014021">doi:10.1145/1014007.1014021</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pepm/PopeeaC04.html">dblp:conf/pepm/PopeeaC04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a34g6eo74nderob36co2w5omda">fatcat:a34g6eo74nderob36co2w5omda</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100713111301/http://www.mpi-sws.org/~cpopeea/research/resources.pepm04.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/37/ca/37ca23cbb1da78bb7fc8eddaeb63119acafa6821.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1014007.1014021"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

A correctness proof of a cache coherence protocol

A. Felty, F. Stomp
<i title="IEEE"> Proceedings of 11th Annual Conference on Computer Assurance. COMPASS &#39;96 </i> &nbsp;
The proof is carried out within LTL and uses history variables. Structuring of the proof is achieved by means of auxiliary predicates.  ...  In this paper we model part of SCI by a program written in a UNITY-like programming language. This part of SCI is formally specified in Manna and Pnueli's Linear Time Temporal Logic (LTL).  ...  His original model has served as a basis for both our model as well for the models studied by Holzmann, Kurshan, and McMillan.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cmpass.1996.507881">doi:10.1109/cmpass.1996.507881</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/hdpcnk6nqfhubgbwute6q2zrgy">fatcat:hdpcnk6nqfhubgbwute6q2zrgy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170921213208/http://www.site.uottawa.ca/%7Eafelty/dist/compass96.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/f6/55/f655f4839964cf34ee8ef02f91ad8b110d231c72.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/cmpass.1996.507881"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Efficient Oblivious Proofs of Correct Exponentiation [chapter]

Markus Jakobsson, Claus Peter Schnorr
<span title="">1999</span> <i title="Springer US"> Secure Information Networks </i> &nbsp;
We study the notion of meta-proofs, which, as the name indicates, are proofs about proofs. We employ the notion of meta-proofs to produce a highly efficient oblivous proof of correct exponentiation.  ...  It is minimumknowledge independently of whether the input is valid or not, a property that does not hold for many other protocols (that are zero-knowledge only for valid inputs.)  ...  Proof of Theorem 2: We only consider the correctness of the main protocol, and refer to the proof of theorem 4 for the correctness of the DLEQ signature.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35568-9_5">doi:10.1007/978-0-387-35568-9_5</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/amqt7xcg7jd35nifrfd5vmgub4">fatcat:amqt7xcg7jd35nifrfd5vmgub4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170909160012/https://link.springer.com/content/pdf/10.1007%2F978-0-387-35568-9_5.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/8a/898a4d29d918c24a5cdddb6bacd9b059dc3bb8bb.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-0-387-35568-9_5"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Analysis and Design of ECC-based RFID Grouping-proof Protocol

Kang Hong-yan
<span title="2015-09-30">2015</span> <i title="Bentham Science Publishers Ltd."> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/shtihqig3rdutlyvbolgxyric4" style="color: black;">Open Automation and Control Systems Journal</a> </i> &nbsp;
Aiming at the issues of the existing RFID grouping-proof protocol in security and privacy, an ECC-based RFID grouping-proof protocol is proposed based on the privacy model and the identification protocol  ...  This article describes the proposed grouping-proof protocol and demonstrates in correctness, soundness and privacy.  ...  ACKNOWLEDGEMENTS This work is supported by scientific research project of Heze University (No. XY12KJ09) and the science and technology project of the Shandong province universities (No. J14LN21).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2174/1874444301507011523">doi:10.2174/1874444301507011523</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jsfpyeesvndf5iw3xzb7qroqdq">fatcat:jsfpyeesvndf5iw3xzb7qroqdq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190427204041/https://benthamopen.com/contents/pdf/TOAUTOCJ/TOAUTOCJ-7-1523.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/6c/71/6c71ebb6bf6d8a33ed51d6c2559ec70681381f0b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.2174/1874444301507011523"> <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>

Privacy-Preserving Multi-Party Reconciliation Secure in the Malicious Model [chapter]

Georg Neugebauer, Lucas Brutschy, Ulrike Meyer, Susanne Wetzel
<span title="">2014</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;
Our newly proposed protocols are shown to be secure in the malicious model based on a variety of novel non-interactive zero-knowledge-proofs.  ...  The problem of fair and privacy-preserving ordered set reconciliation arises in a variety of applications like auctions, e-voting, and appointment reconciliation.  ...  proofs and proofs of correct decryption cannot be forged, then in the MPROS MR protocol in Algorithm 2, for any coalition Γ of at most n − 1 colluding players, there is a player (or group of players)  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-54568-9_12">doi:10.1007/978-3-642-54568-9_12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/2icc264vmfdwpjeigzwuo4hvtm">fatcat:2icc264vmfdwpjeigzwuo4hvtm</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20151022134202/http://eprint.iacr.org/2013/655.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/db/30/db30f5bb0fcfb94fb37937f29ca9f40e2592642a.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-54568-9_12"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Private and verifiable interdomain routing decisions

Mingchen Zhao, Wenchao Zhou, Alexander J.T. Gurney, Andreas Haeberlen, Micah Sherr, Boon Thau Loo
<span title="">2012</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/6mtaqkuatjbxjnu4pbbyvwphgi" style="color: black;">Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication - SIGCOMM &#39;12</a> </i> &nbsp;
., send to a correct consumer) a route that had not been previously offered in step 1 of the protocol.  ...  If the elector is correct, it can produce a bit proof for any bit of the commitment. Proof. A bit proof for any bit i of the commitment consists of b i , x i , and for all j = i, H(b j ||x j ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2342356.2342434">doi:10.1145/2342356.2342434</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/sigcomm/ZhaoZGHSL12.html">dblp:conf/sigcomm/ZhaoZGHSL12</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/5h4cg4d6h5e5bdyr2eocu7ww24">fatcat:5h4cg4d6h5e5bdyr2eocu7ww24</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809175302/http://www.seas.upenn.edu/%7Eahae/papers/pvr-tr.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/bc/66bc98dc3a12a13e959fb1f22d291f2697d909b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2342356.2342434"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Private and Verifiable Interdomain Routing Decisions

Mingchen Zhao, Wenchao Zhou, Alexander J. T. Gurney, Andreas Haeberlen, Micah Sherr, Boon Thau Loo
<span title="">2016</span> <i title="Institute of Electrical and Electronics Engineers (IEEE)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/wn5qtqh7ejhpfdjtrxhija73bq" style="color: black;">IEEE/ACM Transactions on Networking</a> </i> &nbsp;
., send to a correct consumer) a route that had not been previously offered in step 1 of the protocol.  ...  If the elector is correct, it can produce a bit proof for any bit of the commitment. Proof. A bit proof for any bit i of the commitment consists of b i , x i , and for all j = i, H(b j ||x j ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tnet.2015.2409233">doi:10.1109/tnet.2015.2409233</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/dpfushqefrejlk7gtr2rre4qjy">fatcat:dpfushqefrejlk7gtr2rre4qjy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809175302/http://www.seas.upenn.edu/%7Eahae/papers/pvr-tr.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/bc/66bc98dc3a12a13e959fb1f22d291f2697d909b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/tnet.2015.2409233"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Private and verifiable interdomain routing decisions

Mingchen Zhao, Wenchao Zhou, Alexander J.T. Gurney, Andreas Haeberlen, Micah Sherr, Boon Thau Loo
<span title="2012-09-24">2012</span> <i title="Association for Computing Machinery (ACM)"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/g4bof3rzarbpjigq5zxjkozv2u" style="color: black;">Computer communication review</a> </i> &nbsp;
., send to a correct consumer) a route that had not been previously offered in step 1 of the protocol.  ...  If the elector is correct, it can produce a bit proof for any bit of the commitment. Proof. A bit proof for any bit i of the commitment consists of b i , x i , and for all j = i, H(b j ||x j ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2377677.2377755">doi:10.1145/2377677.2377755</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6srnjza7sbg57ltmqsu45oxc6m">fatcat:6srnjza7sbg57ltmqsu45oxc6m</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809175302/http://www.seas.upenn.edu/%7Eahae/papers/pvr-tr.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/bc/66bc98dc3a12a13e959fb1f22d291f2697d909b2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/2377677.2377755"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Certificate Validation in Secure Computation and Its Use in Verifiable Linear Programming [chapter]

Sebastiaan de Hoogh, Berry Schoenmakers, Meilof Veeningen
<span title="">2016</span> <i title="Springer International Publishing"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/2w3awgokqne6te4nvlofavy5a4" style="color: black;">Lecture Notes in Computer Science</a> </i> &nbsp;
compared to protocols providing no correctness guarantees at all.  ...  For the validation of a certificate we design particularly efficient distributed-prover zero-knowledge proofs, fully exploiting the fact that we can use ElGamal encryption for this purpose, hence avoiding  ...  For our purposes, we need three Σ-protocols: proof of plaintext knowledge Σ PK , proof of correct multiplication Σ CM , and proof of correct decryption Σ CD .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-31517-1_14">doi:10.1007/978-3-319-31517-1_14</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/yarywvnplvg23ct65vgm67nfme">fatcat:yarywvnplvg23ct65vgm67nfme</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170716185451/https://eprint.iacr.org/2015/339.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/28/c5284b1e10981bd16d2d1230aef088dadf53e218.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-319-31517-1_14"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>
&laquo; Previous Showing results 1 &mdash; 15 out of 211,317 results