[75384] in cryptography@c2.net mail archive
Re: (Short) Intro and question
daemon@ATHENA.MIT.EDU (=?UTF-8?B?SXZhbiBLcnN0acSH?=)
Mon Jan 8 13:34:29 2007
X-Original-To: cryptography@metzdowd.com
X-Original-To: cryptography@metzdowd.com
Date: Mon, 08 Jan 2007 05:05:40 +0100
From: =?UTF-8?B?SXZhbiBLcnN0acSH?= <krstic@solarsail.hcs.harvard.edu>
To: Allen <netsecurity@sound-by-design.com>
Cc: cryptography@metzdowd.com
In-Reply-To: <45A010FC.6020507@sound-by-design.com>
Allen wrote:
> One of the questions that I have been raising is trust and how to ensure
> that that it is not misplaced or eroded over time. Which leads me to my
> question for the list: I can see easily how to do split key for 2 out of
> x for key recovery, but I can't seem to find a reference to the 3 out of
> x problem.
Read Shamir's original paper:
http://www.cs.tau.ac.il/~bchor/Shamir.html
and the Wikipedia page:
http://en.wikipedia.org/wiki/Secret_sharing
--
Ivan Krstić <krstic@solarsail.hcs.harvard.edu> | GPG: 0x147C722D
---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo@metzdowd.com
