Advertisement

Delegated Decryption

  • Yi Mu
  • Vijay Varadharajan
  • Khan Quac Nguyen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1746)

Abstract

This paper proposes a new public key based system that enables us to have a single public key with one or more decryption keys and a unique signing key. One straightforward application for our system is in delegated or proxy based decryption. The proxy based decryption requires that the decryption authority can be delegated to another party (proxy) without revealing the signing key information. This suggests that the proxy who has the legitimate right for decryption cannot sign on behalf of the public key owner; only the legitimate signer can be the owner of the public key.

Keywords

Signature Scheme Proxy Signature Proxy Signature Scheme Group Signature Scheme Message Recovery 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    D. Chaum and E. van Heijst, “Group signatures,” inAdvances in Cryptology-EUROCRYPT’91, (New York), pp. 257–265, Springer-Verlag, 1991.Google Scholar
  2. 2.
    L. Chen and T.P. Pedersen, “New group signature schemes,” inAdances in cryptology-EUROCRYPT’94, Lecture Notes in Computer Science 950, pp. 171–181, Springer-Verlag, Berlin, 1994.Google Scholar
  3. 3.
    J. Camenisch, “Efficient and generalized group signatures,” inAdances in cryptology-EUROCRYPT’97, Lecture Notes in Computer Science 1233, pp. 465–479, Springer-Verlag, Berlin, 1997.Google Scholar
  4. 4.
    J. Camenisch and M. Stadler, “Efficient group signature schemes for large groups,” in Advances in Cryptology, Proc. CRYPTO 97, LNCS 1296, pp. 410–424, Springer-Verlag, Berlin, 1997.Google Scholar
  5. 5.
    T. ElGamal, “A public-key cryptosystem and a signature scheme based on discrete logarithms,” inAdvances in Cryptology, Proc. CRYPTO 84, LNCS 196, pp. 10–18, Springer-Verlag, Berlin, 1985.Google Scholar
  6. 6.
    Y. Zheng, “Digital signcryption or how to achieve cost(signature & encryption) cost(signature) + cost(encryption), ” inAdvances in Cryptology-CRYPTO’ 97 Proceedings, Springer Verlag, 1997.Google Scholar
  7. 7.
    K. Nyberg and R.A. Rueppel, “Message recovery for signature schemes based on the discrete logarithm problem,” inAdvances in Cryptology, Proc. EUROCRYPT 94, LNCS 950, (Berlin), pp. 182–193, Springer-Verlag, 1994.CrossRefGoogle Scholar
  8. 8.
    M. Mambo, K. Usuda, and E. Okamoto, “Proxy signatures for delegating signing operation,” inProc. of the Third ACM Conf. on Computer and Communications Security, pp. 48–57, 1996.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1999

Authors and Affiliations

  • Yi Mu
    • 1
  • Vijay Varadharajan
    • 1
  • Khan Quac Nguyen
    • 1
  1. 1.School of Computing and ITUniversity of Western SydneyKingswoodAustralia

Personalised recommendations