Talk:Dining cryptographers protocol

Untitled
I'm working on a complete rewrite and expansion of this topic and should have bits and pieces of it up within a few days. If anybody wants to add their own suggestions to things that should go here, please feel free to submit. :) --Vesta 23:38, 29 Mar 2005 (UTC)
 * It'd be great to have a rewrite/expansion! Would a diagram be of any use here? &mdash; Matt Crypto 00:01, 30 Mar 2005 (UTC)
 * I was thinking something similar to the image at dining philosophers. Since the rewrite page for this article is probably going to look incomplete for a few days and is likely to undergo heavy revision, I've created a rewrite page to keep it separate from the main article.  There is also a prelimiary TOC at that page.  Hopefully this is not improper of me to do. --Vesta 02:06, 30 Mar 2005 (UTC)
 * Seems like a perfectly OK thing to do to me. &mdash; Matt Crypto 08:06, 30 Mar 2005 (UTC)

Status?
Are we still up for working on rewrite? I'm doing research related to this, and I'd like to contribute. —The preceding unsigned comment was added by Dartbanks (talk • contribs) 12:02, June 25, 2006 (UTC)
 * Go for it, it's been more then a year! Ariel. 06:52, 29 October 2006 (UTC)

Premissions for the images
I got permissions for all the images that I uploaded to the page.

Please don't revert it anymore...

Thanks :) —The preceding unsigned comment was added by 213.8.224.179 (talk) 09:39, 4 May 2007 (UTC).


 * Wikipedia cannot accept images or other content that "you have a permission for", as I explained on your talk page (assuming that you are Hagitwiki). Wikipedia requires that all text be licensed under the GNU Free Documentation License, and that images would be licensed under a free license that permits, among other things, commercial reproduction (which, for example, the license of Image:Dining Crypto comics.gif does not permit]]).
 * If these people indeed licensed their content appropriately then you should link to the pages that properly identify the content licensed as such. Please see Copyrights for details. -- intgr 19:20, 4 May 2007 (UTC)

Images licenses
We learned this subject at IDC (Interdiciplinary Center, Israel). My professor gave us permission to use the images from his lecture (the pictures of his lectures have all the permissions). Only the first image - the comic from Chaum is taken from the website. My professor said it's o.k. to use this image, and also, you can see in the following site that it is trivial that it has a GFDL permission -

http://www.weidai.com/mix-net.txt

This is a quote from there:

Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/or specific permission. —The preceding unsigned comment was added by Hagitwiki (talk • contribs) 09:55, 5 May 2007 (UTC).
 * That is not GFDL compatible; GFDL requires permission for commercial use as well. Veinor (talk to me) 16:55, 5 May 2007 (UTC)

Two images removal
I removed two images that demonstrate the algorithm until I'll be able to get a copyright approval from GFDL for them. —The preceding unsigned comment was added by Hagitwiki (talk • contribs) 16:35, 5 May 2007 (UTC).


 * What about the text? Where is your evidence of the authors releasing this text under the GFDL? An explicit "permission to use" does not imply a permission to relicense their content, so you are violating their copyright. And DO NOT re-add the content before you have sorted out copyright issues. -- intgr 16:45, 5 May 2007 (UTC)

Connection to Philosophers misleading and not a ring
First, the compare to Dining Philosophers is misleading, as this problem has nothing to do with a DC network protocol. Next, the random numbers does not need to be exchanged with the neighbour partners only, in fact, the structure is not a ring at all (Cite (David Chaum in his original paper): "Each participant has a secret key bit in common with, say, every other participant"). Imi, 141.76.46.116 14:18, 9 October 2007 (UTC)

Several problems found

 * In the story there are 3 cryptographers.
 * The generalisation is a graph, not a ring.
 * Participants communicate pairwise over a 'secure channel', not over 'encrypted links'
 * They throw coins and compare them, they do not pick numbers and substract them. (Generalisation uses XOR = Addition in GF2)
 * Refers to a possibly incorrect source. Chaum's original paper would be a good reference. —Preceding unsigned comment added by 85.93.205.50 (talk) 02:16, 20 January 2008 (UTC)

Rewrite - done?
I rewrote much of the page - which basically consisted of the definition. I used some of the info from the official rewrite, and I believe this page is much better now. The transmitting one-bit header in the rewrite was pretty much unreadable, and I think the definition here now is understandable and accurate. In my opinion, the rewrite page is no longer necessary. Fresheneesz (talk) 21:40, 6 December 2008 (UTC)

Story confusion
Each cryptographer secretly writes down a bit (zero or one) and shows it to every other cryptographer.

Is it just me or is this phrase confusing? If the cryptographer is writing a "secret," why is he/she showing it to everyone? It's possible (likely) I'm just not understanding it well enough, but if that's the case, it seems then that the initial story could use clarification. 76.235.199.230 (talk) 23:38, 30 January 2009 (UTC)

In fact, that paragraph is very hard to understand (if it ever makes sense). The problem statement as reported here: http://cryptodox.com/Dining_cryptographers_protocol looks much different. However, I don't hav the required experience to rewrite it... —Preceding unsigned comment added by 151.65.236.40 (talk) 16:36, 16 February 2009 (UTC)

Chaum present trap messages
"Chaum present trap messages can prevent malicious data."

What? How? RJFJR (talk) 17:09, 8 June 2009 (UTC)