Undeniable Signatures Based on Characters: How to Sign with One Bit

@inproceedings{Monnerat2004UndeniableSB,
  title={Undeniable Signatures Based on Characters: How to Sign with One Bit},
  author={Jean Monnerat and Serge Vaudenay},
  booktitle={Public Key Cryptography},
  year={2004}
}
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. Its asymptotic complexity is attractive: the asymptotic complexity of all algorithms (even the key setup) are quadratic in the size of the modulus n in bits when the other parameters are fixed. The practical complexity can be quite low depending on parameter and variant choices. We present also a proof of security of… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 15 references

RSA-Based Undeniable Signatures

Journal of Cryptology • 2000
View 5 Excerpts
Highly Influenced

A Course in Computational Algebraic Number Theory, Graduate Texts

H. Cohen
2000
View 3 Excerpts
Highly Influenced

A Classical Introduction to Modern Number Theory: Second Edition

K. Ireland, M. Rosen
Graduate Texts in Mathematics • 1990
View 3 Excerpts
Highly Influenced

A Public-Key Cryptosystem Using Purely Cubic Fields

Journal of Cryptology • 1998
View 2 Excerpts

Breaking and Repairing a Convertible Undeniable Signature Scheme

ACM Conference on Computer and Communications Security • 1996
View 1 Excerpt

Designated Confirmer Signatures

EUROCRYPT • 1994
View 1 Excerpt

Similar Papers

Loading similar papers…