<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Mpc on Ryan Orban</title><link>https://ryanorban.com/categories/mpc/</link><description>Recent content in Mpc on Ryan Orban</description><generator>Hugo</generator><language>en-us</language><managingEditor>me@ryanorban.com (Ryan Orban)</managingEditor><webMaster>me@ryanorban.com (Ryan Orban)</webMaster><copyright>Ryan Orban</copyright><lastBuildDate>Wed, 10 Aug 2022 00:00:00 +0000</lastBuildDate><atom:link href="https://ryanorban.com/categories/mpc/index.xml" rel="self" type="application/rss+xml"/><item><title>Piranha: A GPU Platform for Secure Computation</title><link>https://ryanorban.com/notes/piranha-gpu-secure-multiparty-computation/</link><pubDate>Wed, 10 Aug 2022 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/piranha-gpu-secure-multiparty-computation/</guid><description>&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;Jean-Luc Watson, Sameer Wagh, and Raluca Ada Popa at UC Berkeley present Piranha — a GPU-accelerated platform for secure multi-party computation (MPC) that achieves 10–15× speedup over CPU-based MPC systems (USENIX Security 2022). The core insight: MPC protocols like secret sharing-based arithmetic (used in 2PC, 3PC, and 4PC settings) consist largely of matrix multiplications and element-wise operations — precisely the workloads GPUs were designed to accelerate. The obstacle has been that MPC protocols operate over custom finite fields, not the floating-point arithmetic GPU vendor libraries expect.&lt;/p&gt;</description></item><item><title>CrypTen: Secure Multi-Party Computation Meets Machine Learning</title><link>https://ryanorban.com/notes/crypten-secure-mpc-meets-machine-learning/</link><pubDate>Tue, 19 Apr 2022 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/crypten-secure-mpc-meets-machine-learning/</guid><description>&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;Secure multi-party computation (MPC) lets parties compute jointly on their combined data without revealing what each party holds. The obstacle to adoption in machine learning has always been that MPC frameworks speak the language of circuit compilers and cryptographic protocols — not the language of tensors, backpropagation, and neural network modules. CrypTen from Facebook AI Research (NeurIPS 2021) fixes this by implementing an MPC computation layer that mirrors the PyTorch API almost exactly: same tensor ops, same autograd, same &lt;code&gt;nn.Module&lt;/code&gt; structure. In principle you change one import and your code runs over encrypted data.&lt;/p&gt;</description></item><item><title>Secure Multiparty Computation (MPC)</title><link>https://ryanorban.com/notes/secure-multiparty-computation-lindell/</link><pubDate>Tue, 19 Apr 2022 00:00:00 +0000</pubDate><author>me@ryanorban.com (Ryan Orban)</author><guid>https://ryanorban.com/notes/secure-multiparty-computation-lindell/</guid><description>&lt;h3 id="summary" class="scroll-mt-8 group"&gt;
 Summary
 
 &lt;a href="#summary"
 class="no-underline hidden opacity-50 hover:opacity-100 !text-inherit group-hover:inline-block"
 aria-hidden="true" title="Link to this heading" tabindex="-1"&gt;
 &lt;svg
 xmlns="http://www.w3.org/2000/svg"
 width="16"
 height="16"
 fill="none"
 stroke="currentColor"
 stroke-linecap="round"
 stroke-linejoin="round"
 stroke-width="2"
 class="lucide lucide-link w-4 h-4 block"
 viewBox="0 0 24 24"
&gt;
 &lt;path d="M10 13a5 5 0 0 0 7.54.54l3-3a5 5 0 0 0-7.07-7.07l-1.72 1.71" /&gt;
 &lt;path d="M14 11a5 5 0 0 0-7.54-.54l-3 3a5 5 0 0 0 7.07 7.07l1.71-1.71" /&gt;
&lt;/svg&gt;

 &lt;/a&gt;
 
&lt;/h3&gt;
&lt;p&gt;Yehuda Lindell (Bar-Ilan University / Unbound Tech) wrote this survey as an accessible introduction to secure multiparty computation (MPC) — the branch of cryptography that asks: how can a group of parties jointly compute a function over their private inputs, without any party learning anything beyond the output? The canonical example is a private auction: bidders can determine the winner and winning price without anyone learning others&amp;rsquo; bids.&lt;/p&gt;</description></item></channel></rss>