From: fnerd@smds.com (FutureNerd Steve Witham)
To: cypherpunks@toad.com
Message Hash: 214537bedbda0306576e943526bfef927e9f546442ababe802af76024d6bc746
Message ID: <9302231806.AB16915@smds.com>
Reply To: N/A
UTC Datetime: 1993-02-24 05:33:09 UTC
Raw Date: Tue, 23 Feb 93 21:33:09 PST
From: fnerd@smds.com (FutureNerd Steve Witham)
Date: Tue, 23 Feb 93 21:33:09 PST
To: cypherpunks@toad.com
Subject: Re: Crypto goals
Message-ID: <9302231806.AB16915@smds.com>
MIME-Version: 1.0
Content-Type: text/plain
>How about making a list of features we want, and/or a list of scenarios
>we want to be able to handle?
>...
> executable but non-disassemblable code [is it possible?]
>...
>Have I missed anything?
>
>-- Marc Ringuette (mnr@cs.cmu.edu)
Encrypted computing. This is even harder than non-disassemblable code.
The idea is that you couldn't even tell what happened to the data if you
watched it compute, tried again with slightly different inputs, etc.
I've heard that some restricted sort of encrypted computing is possible
with an exponential time cost!
The main application I have in mind is a mix that would be trustworthy
even if it was run by your worst enemies with the best computers in the
world.
This seems impossible but I don't have proof.
-fnerd
fnerd@smds.com (FutureNerd Steve Witham)
Return to February 1993
Return to “Timothy Newsham <newsham@wiliki.eng.hawaii.edu>”