Indeed, their construction depends on Gentry's fully homomorphic encryption. On Tue, Feb 4, 2014 at 4:06 PM, Charles Greathouse <charles.greathouse@case.edu> wrote:
From the article:
More futuristically, it would allow people to create autonomous virtual agents that they could send out into the computing "cloud" to act on their behalf.
It sounds like something much closer to Gentry's fully homomorphic encryption than your WI.
Charles Greathouse Analyst/Programmer Case Western Reserve University
On Tue, Feb 4, 2014 at 2:57 PM, Warren D Smith <warren.wds@gmail.com> wrote:
http://www.wired.com/wiredscience/2014/02/cryptography-breakthrough/all/
Cryptography Breakthrough Could Make Software Unhackable By Erica Klarreich, Quanta Magazine02.03.149:30 AM
--I can write an interpreter WI for interpreting any program written in Warren's Programming Language (WPL). WI works as follows. First, if decrypts the WPL program by public key cryptography with the decryption key 4103943687648904689346189789676897642975685988043769349707438017463179432. Second, it views the result as a BASIC program and runs it. Now. Doesn't the net program (WI+its input) at seem pretty darn obfuscated to you?
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
_______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
-- Mike Stay - metaweta@gmail.com http://www.cs.auckland.ac.nz/~mike http://reperiendi.wordpress.com