NIZKPDS to Achieve Non-repudiation

Conference paper
Part of the Lecture Notes in Electrical Engineering book series (LNEE, volume 131)


Digital signatures are electronic signatures that involve mathematical techniques for ensuring the authenticity of a digital message. It is mainly used for achieving non repudiation. There are a variety of digital signature schemes including the ELGAMAL based digital signatures. This contribution presents a novel Non-Interactive Zero Knowledge Protocol based Digital Signature (NIZKPDS) scheme. The proposed scheme mitigates the limitations of the ELGAMAL Scheme. A simulation based on the proposed scheme is presented using a simple Java application.


Digital signature ELGAMAL digital signature Non-repudiation Zero knowledge protocol 


  1. 1.
    Araki S, Uehara S, Imamura K (1999) The limited verifier signature and its application. IEICE Trans Fundam E82-A(1):63–68Google Scholar
  2. 2.
    Bellare M, Mical S (1988) How to sign given any trapdoor function, STOC 88. In: Proceedings of the 20th Annual Symposium on Theory of Computing, ACM, pp 214–233Google Scholar
  3. 3.
    Buchmann JA (2005) Introduction to cryptography, 2nd edn. Springer, New YorkGoogle Scholar
  4. 4.
    Bellare M, Goldwasser S (1989) New paradigms for digital signatures and message authentication based on non-interactive zero knowledge proofs. In: Proceedings of Crypto 89, pp 194–211Google Scholar
  5. 5.
    Chang Y-S, Wu T-C, Huang S-C (2000) ElGamal-like digital signature and multisignature schemes using self-certified public keys. Int J Syst Softw, Hindawi publications, 50:99–105Google Scholar
  6. 6.
    Diffie W, Hellman M (1976) New directions in cryptography. IEEE Trans Inf Theor IT-22: 644–654Google Scholar
  7. 7.
    ElGamal T (1985) A public-key cryptosystem and a signature scheme based on discrete Logarithms. IEEE Trans Inf Theor IT-3 1 (4):745–756Google Scholar
  8. 8.
    Goldwasser S, Micali S, Rivest R (1988) A digital signature scheme secure against adaptive chosen-message attacks. SIAM J Comput 17(2):281–308MathSciNetMATHCrossRefGoogle Scholar
  9. 9.
    Hwang SJ, Chang CC, Yang WP (1996) Authenticated encryption schemes with message linkages. Inf Process Lett 58(4):189–194MATHCrossRefGoogle Scholar
  10. 10.
    Lapidot D, Shamir A (1990) Publicly verifiable non-interactive zero-knowledge Proofs. In: Proceedings of Crpto 90, pp 356–367Google Scholar
  11. 11.
    LeinHarn A, JianRen B (2009) Design of DL-based certificateless digital signatures. J Syst Softw 82:789–793CrossRefGoogle Scholar
  12. 12.
    Lee WB, Chang CC (1995) Authenticated encryption schemes without using a one way function. Electron Lett 31(19):1656–1657CrossRefGoogle Scholar
  13. 13.
    Naor M, Yung M (1995) Universal one-way hash functions and their cryptographic applications, STOC 89Google Scholar
  14. 14.
    National Institute of Standards and Technology (NIST) (1992) The digital signature standard proposed by NIST. Commun ACM 35(7):36–40CrossRefGoogle Scholar
  15. 15.
    Rompel J (1990) One-way functions are necessary and sufficient for secure signatures STOC 90Google Scholar
  16. 16.
    Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM 21(2):337–348MathSciNetCrossRefGoogle Scholar
  17. 17.
    Tseng YM, Jan JK, Chien HY (2003) Authenticated encryption schemes with message linkages for message flows. Comput Electr Eng 29(1):101–109MATHCrossRefGoogle Scholar
  18. 18.
    Zheng Y (1997) Digital signcryption or how to achieve cost (signature & encryption) \(-\) cost (signature) \(+\) costGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  1. 1.School of ComputingSASTRA UniversityKumbakonamIndia

Personalised recommendations