Revision as of 11:17, 3 May 2007 edit Hagitwiki (talk \| contribs) 31 edits →External links ← Previous edit		Revision as of 11:18, 3 May 2007 edit undo Hagitwiki (talk \| contribs) 31 edits →Conclusion Next edit →
Line 177: == Conclusion == 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. ~~:''See also:'' [[cryptography]]~~ ~~Compare: [[dining philosophers problem]]~~ == External links ==

Dining cryptographers protocol: Difference between revisions