Matches in DBpedia 2016-04 for { <http://dbpedia.org/resource/Dining_cryptographers_problem> ?p ?o }
Showing triples 1 to 56 of
56
with 100 triples 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 verdict-abs.
- Dining_cryptographers_problem wikiPageExternalLink anon.
- Dining_cryptographers_problem wikiPageExternalLink documentation.html.
- Dining_cryptographers_problem wikiPageID "17507355".
- Dining_cryptographers_problem wikiPageLength "15173".
- Dining_cryptographers_problem wikiPageOutDegree "24".
- Dining_cryptographers_problem wikiPageRevisionID "695667795".
- Dining_cryptographers_problem wikiPageWikiLink Anonymous_veto_network.
- Dining_cryptographers_problem wikiPageWikiLink Bit.
- Dining_cryptographers_problem wikiPageWikiLink Category:Cryptography.
- Dining_cryptographers_problem wikiPageWikiLink Category:Mathematical_problems.
- Dining_cryptographers_problem wikiPageWikiLink Category:Zero-knowledge_protocols.
- Dining_cryptographers_problem wikiPageWikiLink Complete_graph.
- Dining_cryptographers_problem wikiPageWikiLink Cryptographic_hash_function.
- Dining_cryptographers_problem wikiPageWikiLink David_Chaum.
- Dining_cryptographers_problem wikiPageWikiLink Diffie–Hellman_key_exchange.
- Dining_cryptographers_problem wikiPageWikiLink Dining_philosophers_problem.
- Dining_cryptographers_problem wikiPageWikiLink Elliptic_curve.
- Dining_cryptographers_problem wikiPageWikiLink Exclusive_or.
- Dining_cryptographers_problem wikiPageWikiLink Finite_group.
- Dining_cryptographers_problem wikiPageWikiLink National_Security_Agency.
- Dining_cryptographers_problem wikiPageWikiLink One-time_pad.
- Dining_cryptographers_problem wikiPageWikiLink Pseudorandom_number_generator.
- Dining_cryptographers_problem wikiPageWikiLink Public-key_cryptography.
- Dining_cryptographers_problem wikiPageWikiLink Ring_network.
- Dining_cryptographers_problem wikiPageWikiLink Schnorr_group.
- Dining_cryptographers_problem wikiPageWikiLink Secure_multi-party_computation.
- Dining_cryptographers_problem wikiPageWikiLink Shuffling.
- Dining_cryptographers_problem wikiPageWikiLink Zero-knowledge_proof.
- Dining_cryptographers_problem wikiPageWikiLink File:Dining_Cryptographers.svg.
- Dining_cryptographers_problem wikiPageWikiLinkText "Dining Cryptographers Problem".
- Dining_cryptographers_problem wikiPageWikiLinkText "Dining Cryptographers".
- Dining_cryptographers_problem wikiPageWikiLinkText "Dining cryptographers problem".
- Dining_cryptographers_problem wikiPageWikiLinkText "Dining cryptographers protocol".
- Dining_cryptographers_problem wikiPageUsesTemplate Template:Reflist.
- 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 Algorithm.
- Dining_cryptographers_problem type Communication.
- Dining_cryptographers_problem type Protocol.
- Dining_cryptographers_problem type Redirect.
- 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 sameAs Q3544405.
- Dining_cryptographers_problem sameAs مسئله_شام_خوردن_رمزنگاران.
- Dining_cryptographers_problem sameAs 食事する暗号学者の問題.
- Dining_cryptographers_problem sameAs Problem_ucztujących_kryptografów.
- Dining_cryptographers_problem sameAs m.0464l6q.
- Dining_cryptographers_problem sameAs Проблема_обедающих_криптографов.
- Dining_cryptographers_problem sameAs Q3544405.
- Dining_cryptographers_problem wasDerivedFrom Dining_cryptographers_problem?oldid=695667795.
- Dining_cryptographers_problem depiction Dining_Cryptographers.svg.
- Dining_cryptographers_problem isPrimaryTopicOf Dining_cryptographers_problem.