Skip to main content
SpringerLink
Log in

Fail-Stop Confirmer Signatures

  • Conference paper
Book cover Information Security and Privacy (ACISP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1841))

Included in the following conference series:

Abstract

A designated confirmer signature allows the signer to prove to the signature’s recipient that the designated confirmer can confirm the signature without the signer. In this paper we propose a fail-stop confirmer signature scheme based on the concept of fail-stop knowledge proofs and signature knowledge proofs on discrete logarithms. We also develop a blinded version of the confirmer scheme. The new confirmer signatures have enhanced security against forgery from powerful adversaries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chaum, D.: Zero-knowledge undeniable signatures. In: Advances in Cryptology, Proc. EUROCRYPT 1991. LNCS, vol. 547, pp. 458–464. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  2. Chaum, D.: Designated confirmer signatures. In: De Santis, A. (ed.) EUROCRYPT 1994. LNCS, vol. 950, pp. 86–91. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  3. Okamoto, T.: Designated confirmer signatures and public key encryption. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 61–74. Springer, Heidelberg (1994)

    Google Scholar 

  4. Michels, M., Stadler, M.: Generic constructions for secure and efficient confirmer signature schemes. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 405–421. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  5. Nguyen, K.Q., Mu, Y., Varadharajan, V.: Undeniable confirmer signatures. In: Zheng, Y., Mambo, M. (eds.) ISW 1999. LNCS, vol. 1729, pp. 235–246. Springer, Heidelberg (1999)

    Chapter  Google Scholar 

  6. van Heyst, E., Pedersen, T.P.: How to make efficient fail-stop signatures. In: Rueppel, R.A. (ed.) EUROCRYPT 1992. LNCS, vol. 658, pp. 366–377. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  7. van Heyst, E., Pedersen, T.P., Pfitzmann, B.: New constructions of fail-stop signatures and low bounds. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 15–30. Springer, Heidelberg (1993)

    Google Scholar 

  8. Damgard, I.B., Pedersen, T.P., Pfitzmann, B.: On the existence of statistically hiding bit schemes and fail stop signatures. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 250–265. Springer, Heidelberg (1994)

    Google Scholar 

  9. Baric, N., Pfitzmann, B.: Collision-free accumulators and fail-stop signatures schemes without trees. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 480–494. Springer, Heidelberg (1997)

    Google Scholar 

  10. Chaum, D., Evertse, J.-H., de Graaf, J.V.: An improved protocol for demonstrating possession of discrete logarithms and some generalizations. In: Price, W.L., Chaum, D. (eds.) EUROCRYPT 1987. LNCS, vol. 304, pp. 128–141. Springer, Heidelberg (1988)

    Google Scholar 

  11. Camenisch, J.: Efficient and generalized group signatures. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 465–479. Springer, Heidelberg (1997)

    Google Scholar 

  12. Stinson, D.R.: Cryptography, Theory and Practice. CRC Press, Boca Raton (1995)

    MATH  Google Scholar 

  13. Fujioka, A., Okamoto, T., Ohta, K.: Interactive bi-proof systems and undeniable signature schemes. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 243–256. Springer, Heidelberg (1991)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computing and IT, University of Western Sydney, Nepean, Kingswood, NSW 2747, Australia

    Yi Mu & Vijay Varadharajan

Authors
  1. Yi Mu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vijay Varadharajan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Information Security Research Centre, Queensland University of Technology, GPO Box 2434, 4000, Brisbane, Queensland, Australia

    E. P. Dawson , A. Clark  & Colin Boyd ,  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mu, Y., Varadharajan, V. (2000). Fail-Stop Confirmer Signatures. In: Dawson, E.P., Clark, A., Boyd, C. (eds) Information Security and Privacy. ACISP 2000. Lecture Notes in Computer Science, vol 1841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10718964_30

Download citation

  • DOI: https://doi.org/10.1007/10718964_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67742-0

  • Online ISBN: 978-3-540-45030-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation