Sciweavers

56 search results - page 4 / 12
» An Efficient Group Signature Based on the Discrete Logarithm...
Sort
View
82
Voted
ISPEC
2009
Springer
15 years 6 months ago
Strongly Unforgeable ID-Based Signatures without Random Oracles
In this paper, we construct a strongly unforgeable ID-based signature scheme without random oracles.4 The signature size of our scheme is smaller than that of other schemes based o...
Chifumi Sato, Takeshi Okamoto, Eiji Okamoto
PKC
2001
Springer
116views Cryptology» more  PKC 2001»
15 years 4 months ago
Cryptanalysis of a Digital Signature Scheme on ID-Based Key-Sharing Infrastructures
At ISW’99, Nishioka, Hanaoka and Imai proposed a digital signature scheme on ID-based key-sharing infrastructures. That signature scheme is claimed to be secure if the discrete l...
Hongjun Wu, Feng Bao, Robert H. Deng
JOC
2011
81views more  JOC 2011»
14 years 6 months ago
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves
We present an algorithm for solving the discrete logarithm problem in Jacobians of families of plane curves whose degrees in X and Y are low with respect to their genera. The fin...
Andreas Enge, Pierrick Gaudry, Emmanuel Thom&eacut...
81
Voted
ASIACRYPT
2004
Springer
15 years 5 months ago
Generic Homomorphic Undeniable Signatures
We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Di...
Jean Monnerat, Serge Vaudenay
103
Voted
FC
2004
Springer
129views Cryptology» more  FC 2004»
15 years 5 months ago
A Privacy-Friendly Loyalty System Based on Discrete Logarithms over Elliptic Curves
Abstract. Systems for the support of customer relationship management are becoming increasingly attractive for vendors. Loyalty systems provide an interesting possibility for vendo...
Matthias Enzmann, Marc Fischlin, Markus Schneider ...