Sciweavers

EUROCRYPT
2011
Springer
13 years 3 months ago
Implementing Gentry's Fully-Homomorphic Encryption Scheme
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...
Craig Gentry, Shai Halevi
EUROCRYPT
2011
Springer
13 years 3 months ago
Statistical Attack on RC4 - Distinguishing WPA
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...
Pouyan Sepehrdad, Serge Vaudenay, Martin Vuagnoux
EUROCRYPT
2011
Springer
13 years 3 months ago
Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
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...
Damien Stehlé, Ron Steinfeld
EUROCRYPT
2011
Springer
13 years 3 months ago
Faster Explicit Formulas for Computing Pairings over Ordinary Curves
Abstract. We describe efficient formulas for computing pairings on ordinary elliptic curves over prime fields. First, we generalize lazy reduction techniques, previously considere...
Diego F. Aranha, Koray Karabina, Patrick Longa, Ca...
EUROCRYPT
2011
Springer
13 years 3 months ago
Concurrent Composition in the Bounded Quantum Storage Model
We define the BQS-UC model, a variant of the UC model, that deals with protocols in the bounded quantum storage model. We present a statistically secure commitment protocol in th...
Dominique Unruh
Cryptology
Top of PageReset Settings