(Short) Intro and question

Chris Kuethe chris.kuethe at gmail.com
Sun Jan 7 23:52:34 EST 2007


On 1/6/07, Allen <netsecurity at sound-by-design.com> 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.
>
> In case I have not been clear enough, it is commonly known that
> it is harder to get collusion when three people need to act
> together than when there are just two. For most encryption 2 out
> x is just fine, but some things need a higher level of security
> than 2 out of x can provide.

http://freshmeat.net/projects/sharesecret/
http://freshmeat.net/projects/shsecret/
http://freshmeat.net/projects/ssss/

I can't speak much about them other than when I last tested them, they
were able to split and reassemble a few test cases.

CK

-- 
GDB has a 'break' feature; why doesn't it have 'fix' too?

---------------------------------------------------------------------
The Cryptography Mailing List
Unsubscribe by sending "unsubscribe cryptography" to majordomo at metzdowd.com



More information about the cryptography mailing list