Sciweavers

48 search results - page 1 / 10
» Merkle Puzzles are Optimal
Sort
View
CORR
2008
Springer
100views Education» more  CORR 2008»
13 years 5 months ago
Merkle Puzzles are Optimal
Boaz Barak, Mohammad Mahmoody-Ghidary
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 5 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková
WEBI
2010
Springer
13 years 3 months ago
Exploiting Puzzle Diversity in Puzzle Selection for ESP-Like GWAP Systems
The ESP game belongs to the genre called Games with a Purpose (GWAP), which leverage people's desire to be entertained and also outsource certain steps of the computational p...
Yu-Song Syu, Hsiao-Hsuan Yu, Ling-Jyh Chen
TALG
2008
110views more  TALG 2008»
13 years 5 months ago
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood
Yefim Dinitz, Shay Solomon
ICPR
2002
IEEE
13 years 10 months ago
Assembly of Puzzles Using a Genetic Algorithm
In this paper, we proposed a method for solving the rectangle piece jigsaw puzzle assembly problem. A shape of a piece is a rectangle, and a picture of a puzzle is only painted in...
Fubito Toyama, Yukihiro Fujiki, Kenji Shoji, Juich...