180 search results - page 2 / 36 » Discrete Logarithm Based Protocols |
IMA
2001
Springer
13 years 10 months ago
2001
Springer
Abstract. The key agreement protocol are either based on some computational infeasability, such as the calculus of the discrete logarithm in [1], or on theoretical impossibility un...
CCS
2008
ACM
13 years 8 months ago
2008
ACM
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
CANS
2009
Springer
14 years 25 days ago
2009
Springer
Abstract. At CRYPTO 2003, Rubin and Silverberg introduced the concept of torus-based cryptography over a finite field. We extend their setting to the ring of integers modulo N. W...
PKC
2000
Springer
13 years 9 months ago
2000
Springer
A number of signature schemes and standards have been recently designed, based on the Discrete Logarithm problem. In this paper we conduct design validation of such schemes while t...
IIWAS
2004
13 years 7 months ago
2004
Group signature schemes permit a group member signing on messages anonymously and unlinkably on behalf of a group. The anonymity can be revoked when arguments occurred. This paper...