<?xml version="1.0" encoding="UTF-8"?><rss xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:atom="http://www.w3.org/2005/Atom" version="2.0"><channel><title><![CDATA[This article from @QuantaMagazine is really interesting from a theoretical #cryptography point of view, although practically speaking, it&#x27;s probably unnecessary.]]></title><description><![CDATA[<p>This article from <span><a href="https://mstdn.social/@QuantaMagazine">@<span>QuantaMagazine</span></a></span>  is really interesting from a theoretical <a href="https://mathstodon.xyz/tags/cryptography" rel="tag">#<span>cryptography</span></a> point of view, although practically speaking, it's probably unnecessary.  </p><p><div class="card col-md-9 col-lg-6 position-relative link-preview p-0">



<a href="https://www.quantamagazine.org/how-unknowable-math-can-help-hide-secrets-20260511/" title="How Unknowable Math Can Help Hide Secrets | Quanta Magazine">
<img src="https://www.quantamagazine.org/wp-content/uploads/2026/05/GodelCryptography-crKristinaArmitage-Social.jpg" class="card-img-top not-responsive" style="max-height: 15rem;" alt="Link Preview Image" />
</a>



<div class="card-body">
<h5 class="card-title">
<a href="https://www.quantamagazine.org/how-unknowable-math-can-help-hide-secrets-20260511/">
How Unknowable Math Can Help Hide Secrets | Quanta Magazine
</a>
</h5>
<p class="card-text line-clamp-3">A graduate student recently harnessed the complexity of mathematical proofs to create a powerful new tool in cryptography.</p>
</div>
<a href="https://www.quantamagazine.org/how-unknowable-math-can-help-hide-secrets-20260511/" class="card-footer text-body-secondary small d-flex gap-2 align-items-center lh-2">



<img src="https://www.quantamagazine.org/wp-content/themes/quanta2024/frontend/images/favicon.png" alt="favicon" class="not-responsive overflow-hiddden" style="max-width: 21px; max-height: 21px;" />





<p class="d-inline-block text-truncate mb-0">Quanta Magazine <span class="text-secondary">(www.quantamagazine.org)</span></p>
</a>
</div></p><p>We can get noninteractive proofs which are *computationally* zero knowledge in other ways, as <span><a href="/user/matthew_d_green%40ioc.exchange">@<span>matthew_d_green</span></a></span> has explained in <a href="https://blog.cryptographyengineering.com/2017/01/21/zero-knowledge-proofs-an-illustrated-primer-part-2/" rel="nofollow noopener"><span>https://</span><span>blog.cryptographyengineering.c</span><span>om/2017/01/21/zero-knowledge-proofs-an-illustrated-primer-part-2/</span></a></p>]]></description><link>https://board.circlewithadot.net/topic/65e87ae5-2504-49f2-8bd9-48e694ebeee8/this-article-from-@quantamagazine-is-really-interesting-from-a-theoretical-cryptography-point-of-view-although-practically-speaking-it-s-probably-unnecessary.</link><generator>RSS for Node</generator><lastBuildDate>Fri, 05 Jun 2026 11:50:12 GMT</lastBuildDate><atom:link href="https://board.circlewithadot.net/topic/65e87ae5-2504-49f2-8bd9-48e694ebeee8.rss" rel="self" type="application/rss+xml"/><pubDate>Sun, 24 May 2026 17:12:24 GMT</pubDate><ttl>60</ttl></channel></rss>