TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Cryptography Breakthrough Could Make Software Unhackable

30 pointsby esalazarover 11 years ago

9 comments

tptacekover 11 years ago
Previous discussion: <a href="https://news.ycombinator.com/item?id=7153657" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=7153657</a>
评论 #7173059 未加载
dvanduzerover 11 years ago
The papers are over my head, but they both at least mention homomorphic encryption. As far as I can tell, program obfuscation is a related, but distinct mathematical problem.<p>Has anyone read and understood the impossibility proof[0] from 2001 they linked? My lay understanding is that we&#x27;ve got addition tackled for homomorphic encryption, but multiplication eludes us so far (i.e. algebraic groups but not fields).<p>If program obfuscation is related to homomorphic encryption, does the impossibility proof of &quot;black box obfuscators&quot; say anything about that multiplication problem?<p>[0] <a href="http://link.springer.com/chapter/10.1007%2F3-540-44647-8_1" rel="nofollow">http:&#x2F;&#x2F;link.springer.com&#x2F;chapter&#x2F;10.1007%2F3-540-44647-8_1</a><p>edit: thanks tptacek, the previous discussion suggests that this is would be a more ambitious result than &quot;mere&quot; homomorphic encryption.
评论 #7175913 未加载
lvhover 11 years ago
Okay, let&#x27;s calm down. While the result is great, this article does a pretty bad job describing it. &quot;Could&quot; is pretty darn important in the title. We&#x27;re nowhere near applications here. For those not willing to read the papers, the original Quanta article[1] is better.<p>I&#x27;m flagging this because it&#x27;s so horribly editorialized.<p>[1] <a href="https://www.simonsfoundation.org/quanta/20140130-perfecting-the-art-of-sensible-nonsense/" rel="nofollow">https:&#x2F;&#x2F;www.simonsfoundation.org&#x2F;quanta&#x2F;20140130-perfecting-...</a>
tekproxyover 11 years ago
I don&#x27;t understand, at all. If two programs are semantically equivalent then traditional deobfuscation techniques like symbolic execution, constant propagation + folding, dead code removal, etc. should take you pretty far. Throw in some peephole and pattern based rules specifically targeting this obfuscator and you&#x27;re good to go.<p>The main link is pretty shit so I may be missing something important. I plan to read the other links provided when I have time, but feel free to help me out by explaining how wrong I am, if that&#x27;s the case.
WalterSearover 11 years ago
This is great and all, but what we really need is cryptography to make the titles on science reporting unlinkbaitable.
mox1over 11 years ago
For those interested in a simple introduction to Zero Knowledge Proofs, check out: <a href="http://pages.cs.wisc.edu/~mkowalcz/628.pdf" rel="nofollow">http:&#x2F;&#x2F;pages.cs.wisc.edu&#x2F;~mkowalcz&#x2F;628.pdf</a>
udevover 11 years ago
This would be a major boon for video game console makers and game publishers.
评论 #7173032 未加载
csmithukover 11 years ago
A lot of assumptions and hype in the article.<p>Usually a bad sign.
iterableover 11 years ago
Wow this could be huge