Threshold proxy signature schemes

  • Kan Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1396)


Delegation of rights is a common practice in the real world. Proxy signature schemes have been invented to delegate signing capability efficiently and transparently. In this paper, we present a new nonrepudiable proxy signature scheme. Nonrepudiation means the signature signers, both original and proxy signers, cannot falsely deny later that he generated a signature. In practice, it is important and, sometimes, necessary to have the ability to know who is the actual signer of a proxy signature for internal auditing purpose or when there is abuse of signing capability. The new nonrepudiable proxy signature scheme also has other desirable properties, such as proxy signature key generation and updating using insecure channels. We also show how to construct threshold proxy signature schemes with an example. Threshold signatures are motivated both by the need that arises in some organizations to have a group of employees agree on a given message (or a document) before signing it, as well as by the need to protect signature keys from the attack of internal and external adversaries. Our approach can also be applied to other ElGamal-like proxy signature schemes.


Original Signer Signature Scheme Blind Signature Proxy Signature Blind Signature Scheme 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    G.R. Blakley, Safeguarding Cryptographic Keys, Proc. AFIPS 1979 Nat. Computer Conf., 48 (1979), pp 313–317.Google Scholar
  2. 2.
    C. Boyd, Digital Multisignatures, In H. Baker and F. Piper, editors, Cryptography and Coding, pages 241–246, Claredon Press, 1986.Google Scholar
  3. 3.
    J.L. Camenisch, J-M. Piveteau, and M.A. Stadler, Blind Signatures Based on the Discrete Logarithm Problem, Proc. EUROCRYPT'94, Springer Verlag, 1994, pp. 428–432.Google Scholar
  4. 4.
    Y. Desmedt, Society and group oriented cryptography: A new concept. In Carl Pomerance, editor, Proc. CRYPTO'87, LNCS 293, Springer-Verlag, 1988.Google Scholar
  5. 5.
    Y. Desmedt, Threshold Cryptography, European Transaction on Telecommunications and Related Technologies, Vol. 5, No. 4, 1994, pp 35–43.Google Scholar
  6. 6.
    Y. Desmedt and Y. Frankel, Threshold cryptosystems. In G. Brassard, editor, Proc. CRYPTO'89, LNCS 435, Springer-Verlag, 1990.Google Scholar
  7. 7.
    R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, Robust Threshold DSS Signatures, Proc. EUROCRYPT'96, LNCS 1070, Springer-Verlag, 1996.Google Scholar
  8. 8.
    L. Harn, Group oriented (t, n) digital signature scheme and digital multisignature, IEE Proc.-Comp. Digit. Tech., 141(5), Sept 1994.Google Scholar
  9. 9.
    P. Horster, M. Michels, H. Petersen, Hidden signature schemes based on the discrete logarithm problem and related concepts, Proc. Communications and Multimedia Security, Chapman & Hall, 1995, pp 162–177.Google Scholar
  10. 10.
    S. Langford, Threshold DSS Signatures without a Trusted Party, Proc. CRYPTO'95, LNCS 963, Springer-Verlag, 1995.Google Scholar
  11. 11.
    S. Langford, Weaknesses in Some Threshold Cryptosystems, Proc. CRYPTO'96, Springer-Verlag, 1996.Google Scholar
  12. 12.
    C. Li, T. Hwang and N. Lee, (t, n)-threshold signature scheme based on discrete logarithm, Proc. EUROCRYPT'94, Springer-Verlag, 1995.Google Scholar
  13. 13.
    M. Mambo, K. Usuda and E. Okamoto, Proxy Signatures for Delegating Signing Operation, Proc. 3rd ACM Conference on Computer and Communications Security, 1996.Google Scholar
  14. 14.
    K. Nyberg and R.A. Rueppel, A New Signature Scheme Based on the DSA Giving Message Recovery, Proc. 1st ACM Conference on Computer and Communications Security, 1993.Google Scholar
  15. 15.
    T. Pedersen, Distributed provers with applications to undeniable signatures, Proc. EUROCRYPT'91, Springer-Verlag, 1991.Google Scholar
  16. 16.
    A. Shamir, How to Share a Secret, Communications of the ACM, 22:612–613, 1979.Google Scholar
  17. 17.
    S.M. Yen and C.S. Laih, New Digital Signature Scheme Based on Discrete Logarithm, Electronics Letters, Vol. 29, No. 12, pp. 1120–1121, 1993.Google Scholar
  18. 18.
    K. Zhang, Nonrepudiable Proxy Signature Schemes, manuscript, 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Kan Zhang
    • 1
  1. 1.Cambridge University Computer LaboratoryCambridgeUK

Personalised recommendations