From: solman@MIT.EDU
To: Nelson Minar <nelson@media.mit.edu>
Message Hash: cdf26150761387e98b3945a14174e026b75b9c732919a782c1dad704e1bd5849
Message ID: <9612220544.AA15781@ua.MIT.EDU>
Reply To: <cpag20z1kp8.fsf@hattrick.media.mit.edu>
UTC Datetime: 1996-12-22 05:44:29 UTC
Raw Date: Sat, 21 Dec 1996 21:44:29 -0800 (PST)
From: solman@MIT.EDU
Date: Sat, 21 Dec 1996 21:44:29 -0800 (PST)
To: Nelson Minar <nelson@media.mit.edu>
Subject: Re: Running code on a machine you don't trust (was Re: Executing Encrypted Code)
In-Reply-To: <cpag20z1kp8.fsf@hattrick.media.mit.edu>
Message-ID: <9612220544.AA15781@ua.MIT.EDU>
MIME-Version: 1.0
Content-Type: text/plain
There are several algorithms I've seen that allow for blind execution
of arbitrary code and verification of correctness given the usual
cryptographic assumptions. Their problem is that they are absurdly
inefficient. But their existence suggests the possibility of efficient
algorithms (or at least a good paper deriving lower bounds on the
complexity of such algorithms).
JWS
Return to December 1996
Return to “solman@MIT.EDU”