[EMAIL PROTECTED] wrote:
A YURL aware search engine may find multiple independent references to a
YURL, thus giving you parallel reporting channels, and increasing trust.
Of course, this method differs from the YURL method for trust. The
parallel channel method assigns a trust value to a site
The thread Announcing httpsy://, a YURL scheme has not dealt with the
issues of *order of introduction* that, however, play a major role in terms
of introduction and the development of trust.
Let trust be the operation *.
Suppose Jon trusts a CA and has his cert issued by that CA. After the
Ed Gerck wrote:
IF Alice is trusted by Bob to introduce ONLY authentic parties, yes. And that is the
problem.
Cryptography can't prevent Alice from telling lies about the web page that she
showing to Bob. But it can prevent that Bob sees a page different than the
one that Alice meant for
Hi,
I remember reading (many years ago) a description on some web page somewhere
of an algorithm by which an arbitrary file F could be split into M pieces,
such that:
(1) given any N pieces, F can be reconstructed precisely, and
(2) given fewer than N pieces, it is impossible to determine even a
Ian Grigg [EMAIL PROTECTED] writes:
Perry E. Metzger wrote:
1) The YURL makes key management and replacement effectively
impossible.
Well, I would have said it suggests a different
method.
Instead of regimented, hierarchical and fixed
key management - an idea of poor track
At 11:26 AM 7/16/2003 -0400, Perry E. Metzger wrote:
Ian Grigg [EMAIL PROTECTED] writes:
[EMAIL PROTECTED] wrote:
A YURL aware search engine may find multiple independent references to a
YURL, thus giving you parallel reporting channels, and increasing trust.
Of course, this method
On Wed, 16 Jul 2003 [EMAIL PROTECTED] wrote:
A YURL aware search engine may find multiple independent references to a
YURL, thus giving you parallel reporting channels, and increasing trust.
But any single search engine is itself a single reference, regardless
of how many times and contexts it
Mark S. Miller wrote:
At 08:48 AM 7/16/2003 Wednesday, Ed Gerck wrote:
IF Alice is trusted by Bob to introduce ONLY authentic parties, yes. And that is the
problem.
In order for the Carol that Alice introduces Bob to to be inauthentic, there
must be some prior notion of *who* Alice was
On Wednesday 16 July 2003 11:26, Perry E. Metzger wrote:
It seems to me to be more a bad idea, fully realized.
Perry, throughout this thread, you have made a number of factually
incorrect statements about YURL. Never have you provided an
argument to backup any of these statements. I know that
On Wed, 16 Jul 2003 [EMAIL PROTECTED] wrote:
Hi,
I remember reading (many years ago) a description on some web page somewhere
of an algorithm by which an arbitrary file F could be split into M pieces,
such that:
(1) given any N pieces, F can be reconstructed precisely, and
(2) given fewer than
For large files, you might also want to take a look of the following
paper
Krawczyk, H. Secret sharing made short. In Advances in Cryptology --
Crypto '93. pages 136-146
See also HAC pages 539.
Steve
-Original Message-
From: [EMAIL PROTECTED]
[mailto:[EMAIL PROTECTED] On Behalf Of
Does anyone have any idea where I might learn about this algorithm - or
indeed any algorithm which does the job.
Just as Perry mentioned, look into Shamir Secret Sharing.
There are also implementations of this, see for example
http://www.astro.gla.ac.uk/users/norman/distrib/tontine.html
(I'm
12 matches
Mail list logo
