A New Scheme for Deniable/Repudiable Authentication

  • Song Y. Yan
  • Carsten Maple
  • Glyn James
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4770)


One of the most important features of authentication is the non-repudiation property, implemented by digital signatures. This useful feature of authentication may, however, not be necessary in some cases, such as e-voting, and should indeed be avoided. In this paper, by a combined use of public-key encryption, digital signatures, coding, quadratic residues, and randomness, a new scheme for deniable/repudiable authentication is proposed and analyzed, and a complete example of the scheme is given. The security of the scheme is based on the intractability of the quadratic residuosity problem.


Deniable/repudiable authentication intractability quadratic residuosity problem 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aumann, Y., Rabin, M.O.: Authentication, Enhanced Security and Error Correcting Codes. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 299–303. Springer, Heidelberg (1998)Google Scholar
  2. 2.
    Diffie, W., Hellman, E.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(5), 644–654 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Diffie, W., Hellman, M.E.: Privacy and Authentication: An Introductionp to Cryptography. Proceedings of the IEEE 67(3), 393–427 (1979)CrossRefGoogle Scholar
  4. 4.
    Hellman, M.E.: An Overview of Public Key Cryptography. IEEE Communications Magazine, Landmark 10 Articules, 50th Anniversary Commemorative Issue, 42–49 (2002)Google Scholar
  5. 5.
    Goldwasser, S.: The Search for Provably Secure Cryptosystems. In: Pomerance, C. (ed.) Cryptology and Computational Number Theory. In: Proceedings of Symposia in Applied Mathematics, vol. 42, American Mathematical Society (1990)Google Scholar
  6. 6.
    Goldwasser, S., Micali, S.: Probabilistic Encryption. Journal of Computer and System Sciences 28, 270–299 (1984)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    McCurley, K.S.: Odds and Ends from Cryptology and Computational Number Theory. In: Pomerance, C. (ed.) Cryptology and Computational Number Theory. Proceedings of Symposia in Applied Mathematics, vol. 42, pp. 49–74. American Mathematics Society (1990)Google Scholar
  8. 8.
    Yan, S.Y.: A New Cryptographic Scheme based on the kth Power Residuosity Problem. In: 15th British Colloquium for Theoretical Computer Science (BCTCS15), 14-16 April 1999, Keele University (1999)Google Scholar
  9. 9.
    Yan, S.Y.: Number Theory for Computing, 2nd edn. Springer, Heidelberg (2002)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Song Y. Yan
    • 1
    • 2
  • Carsten Maple
    • 1
  • Glyn James
    • 3
  1. 1.Institute for Research in Applicable Computing, University of Bedfordshire, Park Square Luton, LU1 3JUUK
  2. 2.School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006China
  3. 3.Department of Mathematical Sciences, Coventry University, CV1 5FBUK

Personalised recommendations