Sciweavers

262 search results - page 2 / 53
» Proposal of a Signature Scheme Based on STS Trapdoor
Sort
View
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
EUROCRYPT
1998
Springer
13 years 9 months ago
A Cryptosystem Based on Non-maximal Imaginary Quadratic Orders with Fast Decryption
We introduce a new cryptosystem with trapdoor decryption based on the di culty of computing discrete logarithms in the class group of the non-maximal imaginary quadratic order O q ...
Detlef Hühnlein, Michael J. Jacobson Jr., Sac...
JCST
2007
98views more  JCST 2007»
13 years 4 months ago
Breaking and Repairing Trapdoor-Free Group Signature Schemes from Asiacrypt'2004
Group signature schemes allow a member of a group to sign messages anonymously on behalf of the group. In the case of later dispute, a designated group manager can revoke the anony...
Xinyi Huang, Willy Susilo, Yi Mu, Futai Zhang
PKC
2005
Springer
125views Cryptology» more  PKC 2005»
13 years 10 months ago
A Generic Scheme Based on Trapdoor One-Way Permutations with Signatures as Short as Possible
We answer the open question of the possibility of building a digital signature scheme with proven security based on the one-wayness of a trapdoor permutation and with signatures as...
Louis Granboulan
CTRSA
2005
Springer
221views Cryptology» more  CTRSA 2005»
13 years 10 months ago
Accumulators from Bilinear Pairings and Applications
We propose a dynamic accumulator scheme from bilinear pairings, whose security is based on the Strong Diffie-Hellman assumption. We show applications of this accumulator in constru...
Lan Nguyen