DC-Net Help Requested

Robin Lee Powell (rlpowell@calum.csclub.uwaterloo.ca)
Wed, 8 Apr 1998 11:26:06 -0400

• Next message: Bill Frantz: "Re: mercury rising query..."
• Previous message: Kriston J. Rehberg: "Re: mercury rising query..."

Thanks to all the people who responded to my last mail. I'm at a bit of an
impasse on certain issues and was wondering if anyone could help.

1. Does anyone have an online pointer to the Dining Cryptographers in a
Disco problem?

2. Given a ring structure with each person passing messages to the person on
their 'right', and each person also communicating with a central server, I've
managed to get things secure enough that given teh following chain of people
    A->B->C
A and C must both collude _with_the_server_ to identify when B is speaking.
I'd like to have more people need to be involved (preferrably the whole rest
of the network). What I need is a way for everyone in the ring to send a
single bit to the server who can add them together modulo 2 and publish the
result, without the server being able to tell who sent what bit, even if it
colludes with some number less than n-1 of the people on the network. Note
that it is not nescessary that the server compute the result, only that
everyone on the network get result somehow, and I only want each person to
have connectiosn to the two people beside them and the server (who can
pass messages between arbitrary people, I suppose).

Note: I'm doing this wiht UNIX sockets, which I don't know all that well. If
it is possible to send a message to a server using a socket protocol of some
type with assurance of anonymity, that would probably be OK, although I would
prefer a cryptographic protocol of some type.

Thanks bunches!

-Robin

• Next message: Bill Frantz: "Re: mercury rising query..."
• Previous message: Kriston J. Rehberg: "Re: mercury rising query..."