[7767] in cryptography@c2.net mail archive
Re: Secrets & Lies, a comment
daemon@ATHENA.MIT.EDU (Jaap-Henk Hoepman)
Wed Sep 6 10:37:17 2000
To: cryptography@c2.net
In-Reply-To: amir.herzberg@il.ibm.com's message of "Fri, 1 Sep 2000 15:06:52 +0300"
From: Jaap-Henk Hoepman <hoepman@cs.utwente.nl>
Date: 06 Sep 2000 10:51:55 +0200
Message-ID: <kp1yyx9a38.fsf@utip202.cs.utwente.nl>
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
On Fri, 1 Sep 2000 15:06:52 +0300 amir.herzberg@il.ibm.com writes:
> Ed says,
>
> > The solution is to use a multifold of links, arranged in time and space
> > such that rather than making the impossible assumption that "no part
> > will fail at any time," we can design a system where up to M parts can
> > fail at any time provided that not all M parts fail at the same time --
> > where M can be the entire number of parts.
>
> This sounds like `proactive security`, as defined in several cryptographic
> works. You may want to check it out at http://www.hrl.il.ibm.com/proactive
Actually, this sounds more like applying fault tolerance (e.g. byzantine
agreement) techniques to increase security and dependability of your system.
Also related are secret sharing techniques and methods to securely compute a
function on a partially trusted distributed system.
Jaap-Henk
--
Jaap-Henk Hoepman | Come sail your ships around me
Dept. of Computer Science | And burn these bridges down
University of Twente | Nick Cave - "Ship Song"
Email: hoepman@cs.utwente.nl === WWW: www.cs.utwente.nl/~hoepman
Phone: +31 53 4893795 === Secr: +31 53 4893770 === Fax: +31 53 4894590
PGP ID: 0xF52E26DD Fingerprint: 1AED DDEB C7F1 DBB3 0556 4732 4217 ABEF
