56 search results - page 6 / 12 » An Efficient Group Signature Based on the Discrete Logarithm... |
MYCRYPT
2005
Springer
15 years 5 months ago
2005
Springer
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC ’04 as well as its generalization proposed at ...
105
click to vote
STOC
2009
ACM
15 years 6 months ago
2009
ACM
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...
109
click to vote
JOC
2000
14 years 11 months ago
2000
Abstract. Since the appearance of public-key cryptography in the seminal DiffieHellman paper, many new schemes have been proposed and many have been broken. Thus, the simple fact t...
107
click to vote
ASIACRYPT
2010
Springer
14 years 9 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
ACNS
2003
Springer
15 years 3 months ago
2003
Springer
We proposed the first threshold GQ signature scheme. The scheme is unforgeable and robust against any adaptive adversary if the base GQ signature scheme is unforgeable under the c...