<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Verifiable Computation with Massively Parallel Interactive Proofs · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1202.1350/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/1202.1350/feed.xml" rel="self" type="application/rss+xml" /><item><title>Verifiable Computation with Massively Parallel Interactive Proofs — mentioned by itwasntandy</title><link>https://news.ycombinator.com/item?id=18180924</link><guid isPermaLink="false">urn:hackerpapers:mention:1202.1350:18180924</guid><pubDate>Wed, 10 Oct 2018 00:17:59 GMT</pubDate><description>&lt;p&gt;Indeed. I saw a brilliant presentation in 2012 by Michael Mitzenmacher from Harvard on verifiable computing in the cloud. It was based on this paper: https://arxiv.org/pdf/1202.1350v3.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1202.1350/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.DC</category></item></channel></rss>
