56 search results - page 7 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
IJNSEC
2008
14 years 11 months ago
2008
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
ACISP
2003
Springer
15 years 3 months ago
2003
Springer
In some practical circumstances, the ability of a signer should be restricted. In group signature schemes, a group member may be allowed to generate signatures up to a certain numb...
ACISP
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We describe implementations for solving the discrete logarithm problem in the class group of an imaginary quadratic field and in the infrastructure of a real quadratic fi...
117
click to vote
EUROCRYPT
2006
Springer
15 years 3 months ago
2006
Springer
In this paper, we study the application of the function field sieve algorithm for computing discrete logarithms over finite fields of the form Fqn when q is a medium-sized prime po...
107
click to vote
EUROCRYPT
1999
Springer
15 years 3 months ago
1999
Springer
In this paper we discuss various aspects of cryptosystems based on hyperelliptic curves. In particular we cover the implementation of the group law on such curves and how to genera...