Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings

@article{Hess2002ExponentGS,
  title={Exponent Group Signature Schemes and Efficient Identity Based Signature Schemes Based on Pairings},
  author={Florian Hess},
  journal={IACR Cryptology ePrint Archive},
  year={2002},
  volume={2002},
  pages={12}
}
  • Florian Hess
  • Published 2002 in IACR Cryptology ePrint Archive
We describe general exponent group signature schemes and show how these naturally give rise to identity based signature schemes if pairings are used. We prove these schemes to be secure in the random oracle model. Furthermore we describe a particular identity based signature scheme which is quite eecient in terms of bandwidth and computing time, and we develop a further scheme which is not derived from an exponent group signature scheme. The realization of these schemes uses supersingular… CONTINUE READING
Highly Cited
This paper has 74 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 44 extracted citations

74 Citations

01020'02'05'09'13'17
Citations per Year
Semantic Scholar estimates that this publication has 74 citations based on the available data.

See our FAQ for additional information.

References

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

Short programs for functions on curves

  • V. Miller
  • Unpublished manuscript,
  • 1986
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…