233 search results - page 12 / 47 » CAPTCHA: Using Hard AI Problems for Security |
ASIACRYPT
2005
Springer
15 years 3 months ago
2005
Springer
We introduce a new cryptographic primitive called the blind coupon mechanism (BCM). In effect, the BCM is an authenticated bit commitment scheme, which is AND-homomorphic. It has n...
STACS
2010
Springer
15 years 4 months ago
2010
Springer
This paper presents the following results on sets that are complete for NP. (i) If there is a problem in NP that requires 2nΩ(1) time at almost all lengths, then every many-one N...
EUROCRYPT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We show that finding an efficiently computable injective homomorphism from the XTR subgroup into the group of points over GF(p2 ) of a particular type of supersingular e...
107
click to vote
AVBPA
1997
Springer
15 years 1 months ago
1997
Springer
Automated processing of facial images has become a serious market for both hard- and software products. For the commercial success of face recognition systems it is most crucial th...
CTRSA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. The task of developing protocols for humans to securely authenticate themselves to a remote server has been an interesting topic in cryptography as a replacement for the ...