Sciweavers

55 search results - page 1 / 11
» Design Validations for Discrete Logarithm Based Signature Sc...
Sort
View
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
13 years 8 months ago
Design Validations for Discrete Logarithm Based Signature Schemes
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...
Ernest F. Brickell, David Pointcheval, Serge Vaude...
IJNSEC
2007
107views more  IJNSEC 2007»
13 years 4 months ago
Original Signer's Forgery Attacks on Discrete Logarithm Based Proxy Signature Schemes
A proxy signature scheme enables a proxy signer to sign messages on behalf of the original signer. In this paper, we demonstrate that a number of discrete logarithm based proxy si...
Tianjie Cao, Xianping Mao
IIWAS
2004
13 years 5 months ago
An Efficient Group Signature Based on the Discrete Logarithm Problem
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...
Fuw-Yi Yang, Jinn-ke Jan
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
13 years 11 months ago
On Cryptographic Schemes Based on Discrete Logarithms and Factoring
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...
Marc Joye
IJNSEC
2006
107views more  IJNSEC 2006»
13 years 4 months ago
ID-based Signcryption Scheme with (t, n) Shared Unsigncryption
An identity-based signcryption scheme with (t, n) shared unsigncryption is proposed, which is the integration of the signcryption scheme, the (t, n) threshold scheme and zero know...
Fagen Li, Xiangjun Xin, Yupu Hu