This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
|
Text and/or other creative content from Dining cryptographers protocol was copied or moved into Dining cryptographers problem with [permanent diff this edit]. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. |
On 13:52, 24 January 2022, 80.112.158.130 changed the DC problem as one that requires computing XOR rather than OR with a note "The DC problem discusses how to perform an XOR operation rather than an OR operation". However, I don't think this change is correct. The context of the DC problem described in Chaum's original paper should make it clear that what three cryptographers "intend" to compute is actually OR, not XOR. DC-net tries to solve this problem by doing the XOR operations among the shared bits, but that leads to likely collisions (in case of a collision, the outcome is not considered correct and the suggestion in the original paper to resolve the collision problem is to re-run the protocol). Therefore, it should be clear that what the DC problem really concerns is actually the computation of OR. Fh240 ( talk) 19:27, 27 January 2022 (UTC)
It has been suggested that this page and Dining cryptographers protocol are too closely related and should be merged. There was some progress made in rewriting the article, Dining_cryptographers_protocol/Rewrite, but it hasn't seen any content updates since March 2008. Thoughts? -- Autopilot ( talk) 14:59, 7 March 2009 (UTC)
There are actually 3 pages about the same topic:
The one that contains the least inaccurate stuff is the last one. The other two pages are very inaccurate.
Some remarks:
That's interesting. If it's not about multiparty OR, what do you think it is computing? Using a trap to capture disruptors is a theoretical concept in Chaum'a paper. Does the paper explain how to do it exactly? Some other papers followed up the trap concept. They assumed the DC-net as a ring and proposed more concrete measures to implement the "trap", but DC-net is not a ring. Fh240 ( talk) 13:35, 10 April 2009 (UTC)
Things one could mention:
(Not sure what that means. It seems only to confuse people. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
(That's illogical. In DC-net, the receiver is untraceable because everyone (including the attacker) is the receiver. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
(It's necessary to explain what the paper are about before adding the references, so that readers can decide how relevant (or irrelevant) they are. Otherwise, it only confuses people. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
—Preceding unsigned comment added by 85.93.206.248 ( talk) 16:00, 7 March 2009 (UTC)
I am the author of the initial remarks, and I believe they are perfectly valid. Here is the list of papers with the paper that are in my opinion the most relevant about the Dining cryptographers protocol. You will find the detail about everything in these papers (Especially the early papers explain the details of the protocol.) :
158.64.77.254 ( talk) 12:16, 12 June 2009 (UTC)
It seems to me that any solution to Yao's Millionaires' Problem could also be used to solve the "Aging Cryptographers" problem, and vice versa. ("Aging Cryptographers" apparently was mentioned -- but alas, no solution given -- on an old version of the dining cryptographers problem, and currently lingers on at Wikipedia:WikiProject Computing/Dining cryptographers protocol/Rewrite).
I see that one editor claims that the "Aging Cryptographers" problem "does not exist". My internet searches support that claim -- I failed to turn up anything more on this problem. I still wonder if perhaps it is one of the many notable pieces of human knowledge that have not yet been published (" mathematical folklore"), or perhaps have been published but are not yet available online ( WP:SOURCEACCESS).
Should this article on dining cryptographers mention and link to the Yao's Millionaires' Problem, or are they "not similar enough"? -- DavidCary ( talk) 18:03, 25 July 2012 (UTC)
This article has not yet been rated on Wikipedia's
content assessment scale. It is of interest to the following WikiProjects: | ||||||||||||||
|
Text and/or other creative content from Dining cryptographers protocol was copied or moved into Dining cryptographers problem with [permanent diff this edit]. The former page's history now serves to provide attribution for that content in the latter page, and it must not be deleted as long as the latter page exists. |
On 13:52, 24 January 2022, 80.112.158.130 changed the DC problem as one that requires computing XOR rather than OR with a note "The DC problem discusses how to perform an XOR operation rather than an OR operation". However, I don't think this change is correct. The context of the DC problem described in Chaum's original paper should make it clear that what three cryptographers "intend" to compute is actually OR, not XOR. DC-net tries to solve this problem by doing the XOR operations among the shared bits, but that leads to likely collisions (in case of a collision, the outcome is not considered correct and the suggestion in the original paper to resolve the collision problem is to re-run the protocol). Therefore, it should be clear that what the DC problem really concerns is actually the computation of OR. Fh240 ( talk) 19:27, 27 January 2022 (UTC)
It has been suggested that this page and Dining cryptographers protocol are too closely related and should be merged. There was some progress made in rewriting the article, Dining_cryptographers_protocol/Rewrite, but it hasn't seen any content updates since March 2008. Thoughts? -- Autopilot ( talk) 14:59, 7 March 2009 (UTC)
There are actually 3 pages about the same topic:
The one that contains the least inaccurate stuff is the last one. The other two pages are very inaccurate.
Some remarks:
That's interesting. If it's not about multiparty OR, what do you think it is computing? Using a trap to capture disruptors is a theoretical concept in Chaum'a paper. Does the paper explain how to do it exactly? Some other papers followed up the trap concept. They assumed the DC-net as a ring and proposed more concrete measures to implement the "trap", but DC-net is not a ring. Fh240 ( talk) 13:35, 10 April 2009 (UTC)
Things one could mention:
(Not sure what that means. It seems only to confuse people. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
(That's illogical. In DC-net, the receiver is untraceable because everyone (including the attacker) is the receiver. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
(It's necessary to explain what the paper are about before adding the references, so that readers can decide how relevant (or irrelevant) they are. Otherwise, it only confuses people. Fh240 ( talk) 13:35, 10 April 2009 (UTC))
—Preceding unsigned comment added by 85.93.206.248 ( talk) 16:00, 7 March 2009 (UTC)
I am the author of the initial remarks, and I believe they are perfectly valid. Here is the list of papers with the paper that are in my opinion the most relevant about the Dining cryptographers protocol. You will find the detail about everything in these papers (Especially the early papers explain the details of the protocol.) :
158.64.77.254 ( talk) 12:16, 12 June 2009 (UTC)
It seems to me that any solution to Yao's Millionaires' Problem could also be used to solve the "Aging Cryptographers" problem, and vice versa. ("Aging Cryptographers" apparently was mentioned -- but alas, no solution given -- on an old version of the dining cryptographers problem, and currently lingers on at Wikipedia:WikiProject Computing/Dining cryptographers protocol/Rewrite).
I see that one editor claims that the "Aging Cryptographers" problem "does not exist". My internet searches support that claim -- I failed to turn up anything more on this problem. I still wonder if perhaps it is one of the many notable pieces of human knowledge that have not yet been published (" mathematical folklore"), or perhaps have been published but are not yet available online ( WP:SOURCEACCESS).
Should this article on dining cryptographers mention and link to the Yao's Millionaires' Problem, or are they "not similar enough"? -- DavidCary ( talk) 18:03, 25 July 2012 (UTC)