<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0">
  <channel>
    <title>InfoQ - Algorithms - Articles</title>
    <link>https://www.infoq.com</link>
    <description>InfoQ Algorithms Articles feed</description>
    <item>
      <title>Article: How to Compute without Looking: a Sneak Peek into Secure Multi-Party Computation</title>
      <link>https://www.infoq.com/articles/secure-multi-party-computation/?utm_campaign=infoq_content&amp;utm_source=infoq&amp;utm_medium=feed&amp;utm_term=Algorithms-articles</link>
      <description>&lt;img src="https://res.infoq.com/articles/secure-multi-party-computation/en/headerimage/secure-multi-party-computation-header-1743067702920.jpg"/&gt;&lt;p&gt;This article shows how you can compute a function across multiple parties that do not trust each other without forcing them to share their individual inputs. This technique can be used to split secrets among parties, perform logical operations, or count votes in a way that ensures data privacy is preserved.&lt;/p&gt; &lt;i&gt;By Debasish Ray Chawdhuri&lt;/i&gt;</description>
      <category>Algorithms</category>
      <category>Data Privacy</category>
      <category>Secure Coding</category>
      <category>Development</category>
      <category>article</category>
      <pubDate>Mon, 31 Mar 2025 11:00:00 GMT</pubDate>
      <guid>https://www.infoq.com/articles/secure-multi-party-computation/?utm_campaign=infoq_content&amp;utm_source=infoq&amp;utm_medium=feed&amp;utm_term=Algorithms-articles</guid>
      <dc:creator>Debasish Ray Chawdhuri</dc:creator>
      <dc:date>2025-03-31T11:00:00Z</dc:date>
      <dc:identifier>/articles/secure-multi-party-computation/en</dc:identifier>
    </item>
  </channel>
</rss>
