233 search results - page 6 / 47 » CAPTCHA: Using Hard AI Problems for Security |
ACNS
2008
Springer
15 years 1 months ago
2008
Springer
The conjugacy search problem in a group G is the problem of recovering an x G from given g G and h = x-1 gx. The alleged computational hardness of this problem in some groups was...
106
click to vote
PKC
2012
Springer
13 years 2 months ago
2012
Springer
In this work, we study a new multivariate quadratic (MQ) assumption that can be used to construct public-key encryption schemes. In particular, we research in the following two di...
136
click to vote
PKC
2012
Springer
13 years 2 months ago
2012
Springer
We initiate the study of security for key-dependent messages (KDM), sometimes also known as “circular” or “clique” security, in the setting of identity-based encryption (I...
112
click to vote
WCNC
2008
IEEE
15 years 6 months ago
2008
IEEE
—Secure routing of Mobile Ad-hoc Networks (MANETs) is still a hard problem after years of research. We therefore propose to design a secure routing protocol in a new approach. Th...
AGENTS
1997
Springer
15 years 3 months ago
1997
Springer
The Robot World Cup Initiative (RoboCup) is an attempt to foster AI and intelligent robotics research by providing a standard problem where wide range of technologies can be integ...