| 摘要 |
Combinable computational puzzles are used as a challenge mechanism for a computer to challenge network entities to determine whether the ostensibly separate network entities are in fact distinct computers. The combinable computational puzzles are constructed such that multiple puzzles can be combined into a single puzzle, which can be solved with approximately the same effort as that required to solve each of the individual original puzzles, and solutions to the individual original puzzles can be derived easily from the solution to the combined puzzle. A computer that is challenged by multiple computers with separate combinable puzzles at the same time is able to respond to the challenges by combining the puzzles into one combined puzzle that it is able to solve in a allotted time period. On the other hand, a challenging computer is able to determine that two or more of the combinable puzzles it sent to ostensibly separate network entities have been combined and solved together, which is an indication that the network entities are in fact presented by one corrupt computer.
|
