233 search results - page 28 / 47 » CAPTCHA: Using Hard AI Problems for Security |
144
click to vote
PKC
2011
Springer
14 years 15 days ago
2011
Springer
ded abstract of this work appears in Public Key Cryptography — PKC 2011, ed. R. Gennaro, Springer LNCS 6571 (2011), 1–16. This is the full version. We propose a linearly homom...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
Intrusion or misbehaviour detection systems are an important and widely accepted security tool in computer and wireless sensor networks. Their aim is to detect misbehaving or faul...
EUROCRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Non-interactive zero-knowledge (NIZK) proof systems are fundamental cryptographic primitives used in many constructions, including CCA2-secure cryptosystems, digital signatures, an...
EUROPAR
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Lattice basis reduction is the problem of finding short vectors in lattices. The security of lattice based cryptosystems is based on the hardness of lattice reduction. Fu...
IJACT
2008
14 years 9 months ago
2008
: In Crypto 1997, Goldreich, Goldwasser and Halevi (GGH) proposed a lattice analogue of McEliece public key cryptosystem, in which security is related to the hardness of approximat...