Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Dining_cryptographers_problem> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Dining_cryptographers_problem abstract "In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible to send anonymous messages with unconditional sender and recipient untraceability. Anonymous communication networks based on this problem are often referred to as DC-nets.Despite the word dining, the dining cryptographers problem is unrelated to the dining philosophers problem.".
- Dining_cryptographers_problem thumbnail Dining_Cryptographers.svg?width=300.
- Dining_cryptographers_problem wikiPageExternalLink anon.
- Dining_cryptographers_problem wikiPageExternalLink verdict-abs.
- Dining_cryptographers_problem wikiPageExternalLink documentation.html.
- Dining_cryptographers_problem wikiPageID "17507355".
- Dining_cryptographers_problem wikiPageRevisionID "573089993".
- Dining_cryptographers_problem hasPhotoCollection Dining_cryptographers_problem.
- Dining_cryptographers_problem subject Category:Cryptography.
- Dining_cryptographers_problem subject Category:Mathematical_problems.
- Dining_cryptographers_problem subject Category:Zero-knowledge_protocols.
- Dining_cryptographers_problem type Abstraction100002137.
- Dining_cryptographers_problem type Attribute100024264.
- Dining_cryptographers_problem type Condition113920835.
- Dining_cryptographers_problem type Difficulty114408086.
- Dining_cryptographers_problem type MathematicalProblems.
- Dining_cryptographers_problem type Problem114410605.
- Dining_cryptographers_problem type State100024720.
- Dining_cryptographers_problem comment "In cryptography, the dining cryptographers problem studies how to perform a secure multi-party computation of the boolean-OR function. David Chaum first proposed this problem in 1988, and used it as an illustrative example to show it was possible to send anonymous messages with unconditional sender and recipient untraceability.".
- Dining_cryptographers_problem label "Dining cryptographers problem".
- Dining_cryptographers_problem label "Problem ucztujących kryptografów".
- Dining_cryptographers_problem label "食事する暗号学者の問題".
- Dining_cryptographers_problem sameAs 食事する暗号学者の問題.
- Dining_cryptographers_problem sameAs Problem_ucztujących_kryptografów.
- Dining_cryptographers_problem sameAs m.0464l6q.
- Dining_cryptographers_problem sameAs Q3544405.
- Dining_cryptographers_problem sameAs Q3544405.
- Dining_cryptographers_problem sameAs Dining_cryptographers_problem.
- Dining_cryptographers_problem wasDerivedFrom Dining_cryptographers_problem?oldid=573089993.
- Dining_cryptographers_problem depiction Dining_Cryptographers.svg.
- Dining_cryptographers_problem isPrimaryTopicOf Dining_cryptographers_problem.
