Sciweavers

SCN
2004
Springer
123views Communications» more  SCN 2004»
14 years 4 months ago
On the Key Exposure Problem in Chameleon Hashes
Chameleon signatures were introduced by Krawczyk and Rabin, being non-interactive signature schemes that provide non-transferability. However, that first construction employs a c...
Giuseppe Ateniese, Breno de Medeiros
ANTS
2004
Springer
106views Algorithms» more  ANTS 2004»
14 years 5 months ago
The Discrete Logarithm in Logarithmic -Class Groups and Its Applications in K-theory
We present an algorithm for the computation of the discrete logarithm in logarithmic -Class Groups. This is applied to the calculation to the -rank of the wild kernel WK2 of a numb...
Sebastian Pauli, Florence Soriano-Gafiuk
CHES
2005
Springer
107views Cryptology» more  CHES 2005»
14 years 5 months ago
A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis
We describe a new variant of the well known Baby-Step Giant-Step algorithm in the case of some discrete logarithms with a special structure. More precisely, we focus on discrete lo...
Jean-Sébastien Coron, David Lefranc, Guilla...
PAIRING
2007
Springer
14 years 5 months ago
On the Minimal Embedding Field
Let C be a curve of genus g, defined over a finite field Fq, where q = pm for a prime p. Let N be a large integer coprime to p, dividing the order of the Jacobian variety associ...
Laura Hitt
ACSC
2008
IEEE
14 years 6 months ago
Privacy preserving set intersection based on bilinear groups
We propose a more efficient privacy preserving set intersection protocol which improves the previously known result by a factor of O(N) in both the computation and communication c...
Yingpeng Sang, Hong Shen
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 6 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali