Filters








4,870 Hits in 3.9 sec

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions [chapter]

Sandro Coretti, Juan Garay, Martin Hirt, Vassilis Zikas
<span title="">2016</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;
Secure multi-party computation (MPC) allows several mutually distrustful parties to securely compute a joint function of their inputs and exists in two main variants: In synchronous MPC parties are connected  ...  the parties wish to compute.  ...  using a (non-constant-round) asynchronous MPC protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-53890-6_33">doi:10.1007/978-3-662-53890-6_33</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/g5sznzm5jjaclgu6qp6cv2c3xq">fatcat:g5sznzm5jjaclgu6qp6cv2c3xq</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170716014552/https://eprint.iacr.org/2016/208.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/0e/f8/0ef8c1d023b0e6a141212099fea699ee040a752f.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-662-53890-6_33"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity [chapter]

Arpita Patra
<span title="">2011</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;
By adapting our techniques from asynchronous settings, we present new error-free reduction in synchronous world that is constant-round and calls for only ( 2 ) instances of protocols for single bit which  ...  Our protocols are multi-valued, meaning that they deal with ℓ bit input and achieve communication complexity of ( ℓ) bits for large enough ℓ for a set of ≥ 3 +1 parties in which at most can be Byzantine  ...  However, the reduction of [FH06] is constant-round, as opposed to the reduction of [LV11] which has a round complexity of ( √ ℓ + 2 ), where ℓ = Ω( 6 ).  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-642-25873-2_4">doi:10.1007/978-3-642-25873-2_4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/cwxk4mlpxjdg5puw5sz6tlz55i">fatcat:cwxk4mlpxjdg5puw5sz6tlz55i</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20120507230038/http://eprint.iacr.org/2011/313.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/4e/9b/4e9b1aa0bae7b5f93c9d19c259ebee4b8d976541.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-25873-2_4"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Network Extractor Protocols

Yael Tauman Kalai, Xin Li, Anup Rao, David Zuckerman
<span title="">2008</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/v4uclqixrrhlnk5pbw4wii6cfq" style="color: black;">2008 49th Annual IEEE Symposium on Foundations of Computer Science</a> </i> &nbsp;
This yields an efficient protocol for secure multi-party computation with imperfect randomness, when the number of parties is at least polylog(n) and where the parties only have access to an independent  ...  For a computationally unbounded adversary, we construct protocols in both the synchronous and asynchronous settings.  ...  Despite this, under a strong variant of the Decisional Diffie-Hellman (DDH) Assumption, we give a protocol for secure multi-party computation when the number of parties is at least polylog(n), even if  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2008.73">doi:10.1109/focs.2008.73</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/focs/KalaiLRZ08.html">dblp:conf/focs/KalaiLRZ08</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/tlcpoxupjjgztjwmlzkygcgvja">fatcat:tlcpoxupjjgztjwmlzkygcgvja</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170809002648/http://www.cs.jhu.edu/~lixints/network.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/12/27/12270c420390c94a40bc18996ae01232a1814dcd.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/focs.2008.73"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Secure and Efficient Asynchronous Broadcast Protocols [chapter]

Christian Cachin, Klaus Kursawe, Frank Petzold, Victor Shoup
<span title="">2001</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 present a randomized atomic broadcast protocol based on a new, efficient multi-valued asynchronous Byzantine agreement primitive with an external validity condition.  ...  Apparently, no such efficient asynchronous atomic broadcast protocol maintaining liveness and safety in the Byzantine model has appeared previously in the literature.  ...  In particular, there are randomized solutions that use only a constant expected number of asynchronous "rounds" to reach agreement [15, 7, 3] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/3-540-44647-8_31">doi:10.1007/3-540-44647-8_31</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/6tcue5nvt5er5pxwjdefgjjxai">fatcat:6tcue5nvt5er5pxwjdefgjjxai</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190504121343/https://link.springer.com/content/pdf/10.1007%2F3-540-44647-8_31.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/5a/3a/5a3ac9ac8f52cd463335f0135dea96acfc090c66.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-44647-8_31"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

A New Approach to Multi-Party Peer-to-Peer Communication Complexity

Adi Rosén, Florent Urrutia, Michael Wagner
<span title="2018-12-21">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 introduce new models and new information theoretic measures for the study of communication complexity in the natural peer-to-peer, multi-party, number-in-hand setting.  ...  The other one is a tight lower bound of Ω(kn) on the multi-party peer-to-peer randomized communication complexity of the k-player, n-bit bitwise parity function, Par n k .  ...  without any notion of global rounds. 7 Tools for the study of multi-party communication protocols In this section we consider two important tools for the study of peer-to-peer multi-party communication  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.4230/lipics.itcs.2019.64">doi:10.4230/lipics.itcs.2019.64</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/innovations/RosenU19.html">dblp:conf/innovations/RosenU19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bwuky2ajkzexjgyoqpd7xbwpk4">fatcat:bwuky2ajkzexjgyoqpd7xbwpk4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220308204102/https://drops.dagstuhl.de/opus/volltexte/2018/10157/pdf/LIPIcs-ITCS-2019-64.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/c6/41/c6414ecc7e60e1535e2af4441345932bdb8df602.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.2019.64"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> Publisher / doi.org </button> </a>

Multi-objective optimization based privacy preserving distributed data mining in Peer-to-Peer networks

Kamalika Das, Kanishka Bhaduri, Hillol Kargupta
<span title="2010-06-22">2010</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/grqe3h6ptvdu5mdn4u5vdt3iby" style="color: black;">Peer-to-Peer Networking and Applications</a> </i> &nbsp;
Unlike most multi-party privacy-preserving data mining algorithms, this approach works in an asynchronous manner through local interactions and it is highly scalable.  ...  Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacy-preserving clustering,  ...  Unlike most secure multi-party computation protocols, our algorithm does not assume semi-honest adversary [5] .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12083-010-0075-1">doi:10.1007/s12083-010-0075-1</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/q5c7tpckxbc47kq4ixkglingg4">fatcat:q5c7tpckxbc47kq4ixkglingg4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20100613110231/http://www.csee.umbc.edu/~kdas1/papers/Privacy_PPNA.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/a0/05/a0053910db45a81900d8dd26ab11ed8d3273b64b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s12083-010-0075-1"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing [chapter]

Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart
<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;
By applying this technique, we achieve O(n) communication complexity per multiplication for a wide class of robust practical Multi-Party Computation (MPC) protocols.  ...  The broadcast round is then replaced by each party sending their masked values to the reconstructor, who then reconstructs the value and then sends it to each party.  ...  Asynchronous Multi-Party Computation with Quadratic Communication. In ICALP, LNCS 5126, pages 473-485. Springer Verlag, 2008. 31. J. Katz and C. Y. Koo.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-319-44618-9_8">doi:10.1007/978-3-319-44618-9_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/a6ymetazazh6jlnaxgl56w6spi">fatcat:a6ymetazazh6jlnaxgl56w6spi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160729190819/http://eprint.iacr.org/2015/705.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/4a/50/4a502b6967a2bcec48fa6cda4750c4ad65184222.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-44618-9_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Reaching Consensus for Asynchronous Distributed Key Generation [article]

Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu
<span title="2021-06-04">2021</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand f<n/3 faulty parties), has a constant expected number of rounds, has Õ(n^3) expected communication  ...  With constant probability the elected proposal was proposed by a non-faulty party.  ...  The combination of NWH with the constant probability of success for PE guarantee termination in an expected constant number of asynchronous rounds.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.09041v3">arXiv:2102.09041v3</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/rknhty57vzbrbfnsdfyfy3swi4">fatcat:rknhty57vzbrbfnsdfyfy3swi4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210606022138/https://arxiv.org/pdf/2102.09041v2.pdf" title="fulltext PDF download [not primary version]" 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] <span style="color: #f43e3e;">&#10033;</span> <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/f4/f1/f4f1fe718eb5b79e6d911e5656911d78be7c5b19.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2102.09041v3" 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>

Reaching Consensus for Asynchronous Distributed Key Generation

Ittai Abraham, Philipp Jovanovic, Mary Maller, Sarah Meiklejohn, Gilad Stern, Alin Tomescu
<span title="2021-07-21">2021</span> <i title="ACM"> Proceedings of the 2021 ACM Symposium on Principles of Distributed Computing </i> &nbsp;
We give a protocol for Asynchronous Distributed Key Generation (A-DKG) that is optimally resilient (can withstand < 3 faulty parties), has a constant expected number of rounds, has ˜ ( 3 ) expected communication  ...  With constant probability the elected proposal was proposed by a nonfaulty party.  ...  A DKG can be viewed as a specific form of a Multi-Party Computation (MPC) protocol.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3465084.3467914">doi:10.1145/3465084.3467914</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/mbdbjjijvraexoleup52vzbyvy">fatcat:mbdbjjijvraexoleup52vzbyvy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20210820125650/https://discovery.ucl.ac.uk/id/eprint/10133255/1/2102.09041v3.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/1c/181c98d0806ffff897664183ca72f0f2352250c9.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/3465084.3467914"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Bounded-concurrent secure multi-party computation with a dishonest majority

Rafael Pass
<span title="">2004</span> <i title="ACM Press"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/jlc5kugafjg4dl7ozagimqfcbm" style="color: black;">Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC &#39;04</a> </i> &nbsp;
Even though our main focus is on feasibility of concurrent multi-party computation we actually obtain a protocol using only a constant number of communication rounds.  ...  As a consequence our protocol yields the first construction of constant-round stand-alone secure multi-party computation with a dishonest majority, proven secure under standard (polynomial-time) hardness  ...  Corollary 1 gives the first constant-round construction for (stand-alone) secure multi-party computation under standard polynomial-time hardness assumptions. 2 The only pre-vious constant-round solution  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1007352.1007393">doi:10.1145/1007352.1007393</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/stoc/Pass04.html">dblp:conf/stoc/Pass04</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/zq2zrxbhnrfa7j5yrlg422cufa">fatcat:zq2zrxbhnrfa7j5yrlg422cufa</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705125331/http://www.nada.kth.se/~rafael/papers/concsecmult.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/ce/38/ce381e4b0904918b552fc10a7a64ad53d3c002c3.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1145/1007352.1007393"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> acm.org </button> </a>

Efficient Asynchronous Byzantine Agreement without Private Setups [article]

Yingzi Gao, Yuan Lu, Zhenliang Lu, Qiang Tang, Jing Xu, Zhenfeng Zhang
<span title="2022-04-27">2022</span> <i > arXiv </i> &nbsp; <span class="release-stage" >pre-print</span>
This gives us a reasonably fair random leader election protocol with expected O(λ n^3) communication and expected constant rounds.  ...  It costs only O(λ n^3) bits and O(1) rounds, and ensures that with at least 1/3 probability, all honest parties can output a common bit that is as if randomly flipped.  ...  The leader election protocol costs expected O(λn 3 ) bits and expected constant asynchronous rounds, and can directly be plugged in all existing VBA protocols (i.e., multi-valued Byzantine agreement with  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.07831v4">arXiv:2106.07831v4</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jwa4eli4aze25fbva5oyy6hqdi">fatcat:jwa4eli4aze25fbva5oyy6hqdi</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20220503140601/https://arxiv.org/pdf/2106.07831v4.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/23/9a/239ad3fc837c78e6d69563c07c8b547d45eb1215.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="https://arxiv.org/abs/2106.07831v4" 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 local distributed peer-to-peer algorithm using multi-party optimization based privacy preservation for data mining primitive computation

Kamalika Das, Hillol Kargupta, Kanishka Bhaduri
<span title="">2009</span> <i title="IEEE"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/ob4nyu5my5hp5hj6r33huq53xu" style="color: black;">2009 IEEE Ninth International Conference on Peer-to-Peer Computing</a> </i> &nbsp;
Unlike most multi-party privacy-preserving data mining algorithms, this approach works in an asynchronous manner through local interactions and therefore, is highly scalable.  ...  Since distributed sum computation is a frequently used primitive, the proposed approach is likely to have significant impact on many data mining tasks such as multi-party privacypreserving clustering,  ...  Below we extend this privacy framework for a distributed multi-party scenario. Definition 2.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/p2p.2009.5284514">doi:10.1109/p2p.2009.5284514</a> <a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/p2p/DasBK09.html">dblp:conf/p2p/DasBK09</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/jwbgdjujvbbelmblpujikmrssy">fatcat:jwbgdjujvbbelmblpujikmrssy</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170922235144/https://www.csee.umbc.edu/~kanishk1/papers/P2P_09_Privacy.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/94/08/9408d310bc6a436a98c59593e98ab23e5646748e.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/p2p.2009.5284514"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>

Cryptographic Asynchronous Multi-party Computation with Optimal Resilience [chapter]

Martin Hirt, Jesper Buus Nielsen, Bartosz Przydatek
<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 consider secure multi-party computation in the asynchronous model and present an efficient protocol with optimal resilience.  ...  For n parties, up to t < n/3 of them being corrupted, and security parameter κ, a circuit with c gates can be securely computed with communication complexity O(cn 3 κ) bits.  ...  Introduction Secure multi-party computation.  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11426639_19">doi:10.1007/11426639_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/l2qcmqk4pfg7lb63jlr56isa2a">fatcat:l2qcmqk4pfg7lb63jlr56isa2a</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20190217101123/https://static.aminer.org/pdf/20170130/pdfs/eurocrypt/ldzekaoszcx23l6pypnqnydxcu7v4t0q.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/8e/52/8e52d2363f866436608c05ed76a91659919c25f2.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/11426639_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Asynchronous Secure Multiparty Computation in Constant Time [chapter]

Ran Cohen
<span title="">2016</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;
In the setting of secure multiparty computation, a set of mutually distrusting parties wish to securely compute a joint function.  ...  Using a concurrent ABA protocol that runs in constant expected time, we obtain a constant expected time asynchronous MPC protocol, secure facing static malicious adversaries, assuming t < n/3.  ...  Acknowledgements We would like to thank Yehuda Lindell and Ran Canetti for helpful discussions on modeling asynchronous MPC in the UC framework, and to Juan Garay for pointing us to the paper of Ben-Or  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-662-49387-8_8">doi:10.1007/978-3-662-49387-8_8</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/pb5dkepxhbcutk5346c4cofv3e">fatcat:pb5dkepxhbcutk5346c4cofv3e</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20160806012452/http://eprint.iacr.org/2015/1238.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/94/20/9420e5fd9727625a4cae090784011ef64ad7a803.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-662-49387-8_8"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>

Secure Multi-Party Computation without Agreement

Shafi Goldwasser, Yehuda Lindell
<span title="2005-05-20">2005</span> <i title="Springer Nature"> <a target="_blank" rel="noopener" href="https://fatcat.wiki/container/7jmi32x7o5hfnpkgh2irnuqpim" style="color: black;">Journal of Cryptology</a> </i> &nbsp;
That is, we show that secure multi-party computation for this definition can be achieved for any number of corrupted parties and without a broadcast channel (or trusted preprocessing phase as required  ...  We remark that it was accepted folklore that the use of a broadcast channel (or authenticated Byzantine agreement) is actually essential for achieving meaningful secure multi-party computation whenever  ...  Since there are no known (expected) constant-round protocols for authenticated Byzantine agreement, we have that the resulting protocol for secure computation is not constant-round. .  ... 
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z">doi:10.1007/s00145-005-0319-z</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/i2narlrnsjahplxte6po2wo4by">fatcat:i2narlrnsjahplxte6po2wo4by</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20070417163751/http://eprint.iacr.org/2002/040.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/84/2484330f40e318036d81c63974b5c28fe9c31f99.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/s00145-005-0319-z"> <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 4,870 results