<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>The impossibility of obfuscation with auxiliary input or a universal simulator · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1401.0348/</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/1401.0348/feed.xml" rel="self" type="application/rss+xml" /><item><title>The impossibility of obfuscation with auxiliary input or a universal simulator — mentioned by matthewdgreen</title><link>https://news.ycombinator.com/item?id=36910601</link><guid isPermaLink="false">urn:hackerpapers:mention:1401.0348:36910601</guid><pubDate>Fri, 28 Jul 2023 17:52:47 GMT</pubDate><description>&lt;p&gt;Some of Yael&amp;#x27;s most prominent works include the original paper on ring signatures [1], some important results around the Fiat-Shamir paradigm for signatures [2], the invention of One-Time Programs [3], some important work on interactive proofs [4], and a bunch of early fundamental (negative) results on obfuscation [5]. And these are just the things that spring to mind immediately, nowhere near the majority of her output. [1] https://people.csail.mit.edu/rivest/pubs/RST01.pdf [2] https://eprint.iacr.org/2003/034.pdf [3] https://www.semanticscholar.org/paper/One-Time-Programs-Gold... [4]…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1401.0348/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.CR</category></item></channel></rss>
