食事する暗号学者の問題
1. Dining cryptographers problemIn 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. Despite the word "dining", the dining cryptographers problem is unrelated to the dining philosophers problem.
Read “Dining cryptographers problem” on English Wikipedia
Read “食事する暗号学者の問題” on Japanese Wikipedia
Read “Dining cryptographers problem” on DBpedia
Read “Dining cryptographers problem” on English Wikipedia
Read “食事する暗号学者の問題” on Japanese Wikipedia
Read “Dining cryptographers problem” on DBpedia
Discussions
Log in to talk about this word.