Skip to main content

On signature schemes with threshold verification detecting malicious verifiers

  • Conference paper
  • First Online:
Security Protocols (Security Protocols 1997)

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

Included in the following conference series:

Abstract

While in the ordinary digital signature concept one verifier is sufficient to check the validity of a given signature, there are situations in which only t out of a group of n verifiers should be able to verify the signatures. These verifiers can either be anonymous, non-anonymous or convertible non-anonymous. So far, only schemes for the anonymous shared verification signature concept have been suggested. However, they suffer from different drawbacks, especially the security relies on the assumption, that all t verifiers must be honest during verification. In this paper, these weaknesses are pointed out and a new scheme is suggested. Furthermore, new protocols for the two other concepts are presented. Our solutions demonstrate the close relation between signature schemes with threshold verification and threshold cryptosystems.

The author's work was granted by a postdoctoral fellowship of the NATO Scientific Committee disseminated by the DAAD. His current address is r3 security engineering, Zürichstrasse 151, CH-8607 Aathal, petersen@r3.ch.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. D.Chaum, H. van Antwerpen, “'Undeniable Signatures”', LNCS 435, Advances in Cryptology: Proc. Crypto '89, Springer, (1990), pp. 212–216.

    Google Scholar 

  2. D.Chaum, T.Pedersen, “Wallet databases with observers”, LNCS 740, Advances in Cryptology: Proc. Crypto'92, Springer, (1993), pp. 89–105.

    Google Scholar 

  3. Y.Desmedt, “Society and group oriented cryptography: a new concept”, LNCS 293, Advances in Cryptology: Proc. Crypto'87, Springer, (1988), pp. 120–127.

    Google Scholar 

  4. Y. Desmedt, Y. Frankel, “Threshold cryptosystems”, LNCS 537, Advances in Cryptology: Proc. Crypto '90, Springer, (1991), pp. 307–315.

    Google Scholar 

  5. T.ElGamal, “A public key cryptosystem and a signature scheme based on discrete logarithms”, IEEE Transactions on Information Theory, Vol. IT-30, No. 4, July, (1985), pp. 469–472.

    Article  Google Scholar 

  6. M.K.Franklin, M.K.Reiter, “Verifiable signature sharing”, LNCS 921, Advances in Cryptology: Proc. Eurocrypt'95, Springer, (1996), pp. 50–63.

    Google Scholar 

  7. R.Gennaro, S.Jarecki, H.Krawczyk, T.Rabin, “Robust Threshold DSS Signatures”, Advances in Cryptology: Proc. Eurocrypt'96, LNCS 1070, Springer, (1996), pp. 354–371.

    Google Scholar 

  8. L.Harn, “Digital signature with (t, n) shared verification based on discrete logarithms”, Electronics Letters, Vol.29, No. 24, (1993), pp. 2094–2095.

    Google Scholar 

  9. L.Harn, Reply to [LeCh95], Electronics Letters, Vol.31, No. 3, (1995), pp. 177.

    Article  Google Scholar 

  10. P.Horster, M.Michels, H.Petersen, “'Meta-ElGamal signature schemes”', Proc. 2. ACM conference on Computer and Communications security, ACM Press, November, (1994), pp. 96–107.

    Google Scholar 

  11. P.Horster, M.Michels, H.Petersen, “Comment: Digital signature with (t, n) shared verification”, Electronics Letters, July, (1995), pp. 1137.

    Google Scholar 

  12. P.Horster, M.Michels, H.Petersen, “Blind multi-signature schemes and their relevance to electronic voting”, Proc. 11th Annual Computer Security Applications Conference, IEEE Press, December, (1995), pp. 149-156.

    Google Scholar 

  13. P.Horster, M.Michels, H.Petersen, “'Das Meta-ElGamal Signaturverfahren and seine Anwendungen”', Proc. VIS' 95, Rostock, DuD Fachbeiträge, Vieweg Verlag, (1995), pp. 207–228.

    Google Scholar 

  14. W.-B.Lee, C.-C.Chang, “Comment: Digital signature with (t, n) shared verification based on discrete logarithms”, Electronics Letters, Vol.31, No. 3, (1995), pp. 176–177.

    Article  Google Scholar 

  15. C.H.Lim, P.J.Lee, “Algorithmic measures for preventing middle-person attack in identification schemes”, Electronics Letters, Vol. 29, No. 14, (1993), pp. 1281–1282.

    Google Scholar 

  16. C.H.Lim, P.J.Lee, “Directed Signatures and Applications to Threshold Cryptosystems”, LNCS 1189, Workshop on Security Protocols, Springer, (1997), pp. 131–138.

    Google Scholar 

  17. C.Park, K.Kurosawa, “New ElGamal Type Threshold Digital Signature Scheme”, MICE Trans. Fundamentals. Vol. E79-A, No. 1, January, (1996), pp. 86–93.

    Google Scholar 

  18. T.Pedersen, “Distributed Provers with Applications to Undeniable Signatures”, LNCS 547, Advances in Cryptology: Proc. Eurocrypt'91, Springer, (1992), pp. 221–238.

    Google Scholar 

  19. T.Pedersen, “A threshold Cryptosystem without a Trusted Party”, LNCS 547, Advances in Cryptology: Proc. Eurocrypt'91, Springer, (1992), pp. 522–526.

    Google Scholar 

  20. D.Pointcheval, J.Stern, “Security Proofs for Signatures”, LNCS 1070, Advances in Cryptology: Proc. Eurocrypt'96, Springer, (1996), pp. 387–398.

    Google Scholar 

  21. C.P.Schnorr, “Efficient signature generation by smart cards”, Journal of Cryptology, Vol. 4, (1991), pp. 161–174.

    Article  Google Scholar 

  22. A. Shamir, “How to share a secret”, Communications of the ACM, Vol. 22, No. 11, November, (1981), pp. 612–613.

    Article  Google Scholar 

  23. M.de Soete, J.J.Quisquater, K.Vedder, “A signature with shared verification scheme”, LNCS 435, Advances in Cryptology: Proc. Crypto'89, Springer, (1990), pp. 253–262.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Bruce Christianson Bruno Crispo Mark Lomas Michael Roe

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Petersen, H., Michels, M. (1998). On signature schemes with threshold verification detecting malicious verifiers. In: Christianson, B., Crispo, B., Lomas, M., Roe, M. (eds) Security Protocols. Security Protocols 1997. Lecture Notes in Computer Science, vol 1361. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028160

Download citation

  • DOI: https://doi.org/10.1007/BFb0028160

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69688-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics