EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
An additively-homomorphic encryption scheme enables us to compute linear functions of an encrypted input by manipulating only the ciphertexts. We define the relaxed notion of a se...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
We propose a Multi-Authority Attribute-Based Encryption (ABE) system. In our system, any party can become an authority and there is no requirement for any global coordination othe...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
Abstract. In this paper we construct several tools for manipulating pools of biases in the analysis of RC4. Then, we show that optimized strategies can break WEP based on 4000 pack...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
We construct the first homomorphic signature scheme that is capable of evaluating multivariate polynomials on signed data. Given the public key and a signed data set, there is an...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
We describe a working implementation of a variant of Gentry’s fully homomorphic encryption scheme (STOC 2009), similar to the variant used in an earlier implementation effort b...
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
EUROCRYPT
2011
Springer
13 years 22 hour ago
2011
Springer
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...