1992-11-16 - Re: The Dining Cryptographers Protocol

Header Data

From: Marc.Ringuette@GS80.SP.CS.CMU.EDU
To: cypherpunks@toad.com
Message Hash: a11e2c82bec365cc867ad7a8d5bccb2e2e1a0b330fd2d1073b1087971a33a4cd
Message ID: <9211161815.AA29148@toad.com>
Reply To: N/A
UTC Datetime: 1992-11-16 18:15:43 UTC
Raw Date: Mon, 16 Nov 92 10:15:43 PST

Raw message

From: Marc.Ringuette@GS80.SP.CS.CMU.EDU
Date: Mon, 16 Nov 92 10:15:43 PST
To: cypherpunks@toad.com
Subject: Re: The Dining Cryptographers Protocol
Message-ID: <9211161815.AA29148@toad.com>
MIME-Version: 1.0
Content-Type: text/plain


My spin on the Dining Cryptographers Protocol is, it's nifty and
theoretically strong, but in practice mixes are better for almost all uses.

If you have N people in a DC-net, you must exchange N bits of traffic per bit
of anonymous message transmitted.  If you use mixes and send each message on
M hops, you exchange M bits of traffic per bit of anonymous message 
transmitted.  N is typically 100-10000, and M is typically 2-10.  Mixes
are more efficient.

One advantage of DC-nets is that they're instant; with mixes there must be
some delays in order to accumulate enough cover messages to defeat traffic
analysis.



-- Marc Ringuette (mnr@cs.cmu.edu)





Thread