Sciweavers

56 search results - page 1 / 12
» An Efficient Group Signature Based on the Discrete Logarithm...
Sort
View
IIWAS
2004
14 years 5 days 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
JOC
2006
116views more  JOC 2006»
13 years 10 months ago
On the Fly Authentication and Signature Schemes Based on Groups of Unknown Order
Abstract. In response to the current need for fast, secure and cheap public-key cryptography, we propose an interactive zero-knowledge identification scheme and a derived signature...
Marc Girault, Guillaume Poupard, Jacques Stern
CANS
2009
Springer
121views Cryptology» more  CANS 2009»
14 years 5 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
PKC
2000
Springer
166views Cryptology» more  PKC 2000»
14 years 2 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...
DCC
2001
IEEE
14 years 10 months ago
Cryptography in Quadratic Function Fields
We describe several cryptographic schemes in quadratic function fields of odd characteristic. In both the real and the imaginary representation of such a field, we present a Diffi...
Renate Scheidler