Sciweavers

127 search results - page 1 / 26
» On Cryptographic Schemes Based on Discrete Logarithms and Fa...
Sort
View
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
IIWAS
2004
13 years 6 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
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...
ACNS
2003
Springer
193views Cryptology» more  ACNS 2003»
13 years 10 months ago
Round Optimal Distributed Key Generation of Threshold Cryptosystem Based on Discrete Logarithm Problem
Distributed key generation is one of the most challenging tasks for threshold cryptosystems. Designing such a protocol and proving its security against a malicious, adaptive adver...
Rui Zhang 0002, Hideki Imai
DCC
2001
IEEE
14 years 4 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