Revision as of 11:19, 3 May 2007 edit Hagitwiki (talk \| contribs) 31 edits →External links ← Previous edit		Revision as of 11:26, 3 May 2007 edit undo Hagitwiki (talk \| contribs) 31 edits No edit summary Next edit →
Line 178: This solution to the “dining cryptographers” problem demonstrates that unconditional secrecy channels can be used to construct an unconditional sender un-traceability channel. It also shows that a public-key distribution system can be used to construct a computationally secure sender-un-traceability channel. The approach appears able to satisfy a wide range of practical concerns. == References == *{{cite book \| author=Chaum, David \| title=The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. \| publisher=Journal of Cryptology \| year=1988 \| pages 65-75}} == External links ==

Dining cryptographers protocol: Difference between revisions