This is an old revision of this page, as edited by 128.2.20.101(talk) at 01:55, 30 March 2005(Placeholder and possible TOC). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 01:55, 30 March 2005 by 128.2.20.101(talk)(Placeholder and possible TOC)
This article is a rewrite of the existing article [dining cryptographers protocol]]. Since this page is bound to be incomplete, unedited, or otherwise messy, please do not merge changes from here into the main article just yet.
Problem Statement
Anecdotal example of problem in cryptography
Describe need for new protocol to solve problem
History
(Does this protocol even have a well-defined history?)
What were the design goals for this protocol?
Define Protocol
Start off with one bit
Give mathematical proof as to why it works (binary addition)
Graphic description
Move on to multiple bits
Considerations
Advantages, i.e. anonymous sender, possibly anonymous recipient
