188
click to vote
IACR
2011
14 years 6 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
163
click to vote
IACR
2011
14 years 6 months ago
2011
We put forward the notion of targeted malleability: given a homomorphic encryption scheme, in various scenarios we would like to restrict the homomorphic computations one can perf...
195
click to vote
IACR
2011
14 years 6 months ago
2011
The McEliece cryptosystem is one of the few systems to be considered secure against attacks by Quantum computers. The original scheme is built upon Goppa codes and produces very l...
169
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. In this paper, we analyze the security of AZUMI protocol which is compliant with the EPCClass-1 Generation-2 standard and recently has been proposed by Peris et al. This ...
199
click to vote
IACR
2011
14 years 6 months ago
2011
We describe Charm, an extensible framework designed for rapid prototyping of cryptographic systems that utilize the latest advances in cryptography, such as identity and attribute...