bear wrote:
On Fri, 3 Oct 2003, Benja Fallenstein wrote:
bear wrote:
Why should this not be applicable to chess? There's nothing to
prevent the two contestants from making "nonce" transmissions twice a
move when it's not their turn.
I.e., you would need a protocol extension
Hi --
bear wrote:
On Thu, 2 Oct 2003, Zooko O'Whielacronx wrote:
R. L. Rivest and A. Shamir. How to expose an
eavesdropper. Communications of the ACM, 27:393-395, April 1984.
Ah. Interesting, I see. It's an interesting application of a
bit-commitment scheme.
Ok, so my other mail came far too late
Hi,
bear wrote:
starting with Rivest & Shamir's Interlock Protocol from 1984.
Hmmm. I'll go read, and thanks for the pointer.
Perhaps I spoke too soon? It's not in Eurocrypt or Crypto 84 or 85,
which are on my shelf. Where was it published?
Communications of the ACM: Rivest and
Shamir, "How to
Hi Greg--
Greg Rose wrote:
At 01:14 AM 10/1/2003 +0300, Benja Fallenstein wrote:
So, anyway, anybody know references? I've not come across any yet.
I know that the technique dates back (at least) to IBM in the 60s.
Cool-- but--
On second thoughts, do you mean *cryptographic* hash tries or
Hi all,
Does anybody on this list know literature about cryptographic hash
tries? (I hit on this idea when mulling about a different problem, and
was wondering what people have written about it.) I.e., a data structure
for keeping sets of pieces of data, by:
- computing a cryptographic hash of