Atomic Secure Multi-party Multiplication with Low Communication [chapter]

Ronald Cramer, Ivan Damgård, Robbert de Haan
<span title="">2007</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 the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir's secret sharing scheme and it can be viewed as a practical variation on one of the central techniques in the foundational results of Ben-Or, Goldwasser, and Wigderson and Chaum, Crépeau, and Damgaard on secure multi-party computation. Rabin's idea is a key ingredient to virtually all practical protocols in threshold cryptography. Given a passive t-adversary in the secure
more &raquo; ... s model with synchronous communication, for example, secure multiplication of two secretshared elements from a finite field K based on this idea uses one communication round and has the network exchange O(n 2 ) field elements, if t = Θ(n) and t < n/2 and if n is the number of players. This is because each of O(n) players must perform Shamir secret sharing as part of the protocol. This paper demonstrates that under a few restrictions much more efficient protocols are possible; even at the level of a single multiplication. We demonstrate a twist on Rabin's idea that enables one-round secure multiplication with just O(n) bandwidth in certain settings, thus reducing it from quadratic to linear. The ideas involved can additionally be employed in the evaluation of arithmetic circuits, where under appropriate circumstances similar efficiency gains can be obtained. Ronald Cramer's research has been partially supported by NWO VICI. Robbert de Haan's research has been partially funded by the Dutch BSIK/BRICKS project PDC1.
<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-72540-4_19">doi:10.1007/978-3-540-72540-4_19</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ipjkvqhxqfeezksp524f4vopm4">fatcat:ipjkvqhxqfeezksp524f4vopm4</a> </span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170820044925/https://link.springer.com/content/pdf/10.1007%2F978-3-540-72540-4_19.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/fc/ebfcfa620be3ffda225ca78ccc9d598459cad61e.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-540-72540-4_19"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> springer.com </button> </a>