Importance

Loading Importance Indicators...

Abstract

A method for an issuer party to issue DSA-like secret-key certificates that can be blinded only restrictively. The method includes the step of generating a secret key (x.sub.0,y) and a public key (descr(G.sub.q), g, h.sub.0, g.sub.1, descr((.cndot.))), wherein q is a prime number, Gq is a group of order q, in which computing discrete logarithms is substantially infeasible, but in which multiplication, determination of equivalence of elements and generation of substantially random numbers is relatively easy, descr(G.sub.q) is a description of G.sub.q including q, descr((.cndot.)) is the description of a hash-function (.cndot.) for which computing inverses is substantially infeasible, x.sub.0, and y are elements of the ring, of integers modulo q, g is an element of order q in the group, G.sub.q, h.sub.o is equal to g.sup.x.sbsp.0 ; and g.sub.1 is equal to g.sup.y. The method further includes the step of issuing to a receiver party a secret-key certificate (r,a) in on a public key h in G.sub.q, the secret key certificate being generated with a computer such that (g.sup.d/c h.sup.r/c) mod q is equal to a, where c is computed by applying (.cndot.) to at least h.

Loading the Abstract Image...

First Claim