Skip to main content

Advertisement

Springer Nature Link
Log in

Full and partial deniability for authentication schemes

  • Research Article
  • Published:
Frontiers of Computer Science in China Aims and scope Submit manuscript

Abstract

Deniable authentication is a type of authentication protocol with the special property of deniability. However, there have been several different definitions of deniability in authentication protocols. In this paper, we clarify this issue by defining two types of deniable authentication: In the first type of deniable authentication, the receiver of the authenticated message cannot prove to a third party that the sender has authenticated any message to him. We call this type of deniability full deniability. In the second type of deniable authentication, whilst the receiver can prove to a third party that the sender has authenticated some message to him, but he cannot prove to a third party that the sender has authenticated any particular message to the receiver. We call this type of deniability partial deniability. Note that partial deniability is not implied by full deniability, and that it has applications different from those of full deniability. Consequently, we present two identity-based authentication schemes and prove that one is fully deniable while the other is partially deniable. These two schemes can be useful in different scenarios.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Dolev D, Dwork C, Naor M. Non-malleable cryptography. SIAM Journal on Computing, 2000, 30(2): 391–437

    Article  MATH  MathSciNet  Google Scholar 

  2. Dwork C, Naor M, Sahai A. Concurrent Zero-Knowledge, In: Proc. of 30th Symposium on Theory of Computing (STOC), ACM, 1998, 409-418, Full version on http://www.wisdom.weizmann.ac.il/naor/onpub.html

  3. Aumann Y, Rabin M. Authentication, enhanced security and error correcting codes, In: Advances in Cryptology-proc. of Crypto’98, LNCS 1462, Springer-Verlag, 1998, 299–303

  4. Aumann Y, Rabin M. Efficient deniable authentication of long messages. In: Int. International Conference on Theoretical Computer Science in honor of Professor Manuel Blum’s 60th birthday, 1998 (http://www.cs.cityu.edu.hk/dept/video.html)

  5. Wang Y, Li J, Tie L. A simple protocol for deniable authentication based elgamal cryptography. Networks, 2005, 45(4): 193–194

    Article  MATH  MathSciNet  Google Scholar 

  6. Shi Y, Li J. Identity-based deniable authentication protocol. Electronics Letters, 2005, 41(5): 241–242

    Article  MathSciNet  Google Scholar 

  7. Raimondo M D, Gennaro R. New approaches for deniable authentication: the multi-user case. In: Proceedings of the 13th ACM Conference on Computer and Communications Security, CCS’05, ACM, Nov 2005, 112–121

  8. Raimondo M D, Gennaro R, Krawczyk H. Deniable authentication and key exchange. In: Proceedings of the 14th ACM Conference on Computer and Communications Security, CCS’06 SESSION: Applied cryptography II, 2006, 400–409

  9. Lu R, Lin X, Cao Z, Qin L, Liang X. A simple deniable authentication protocol based on the Diffie-Hellman algorithm. International Journal of Computer Mathematics, 2008, 85(9): 1315–1323

    Article  MATH  MathSciNet  Google Scholar 

  10. Wang B, Song Z X. A non-interactive deniable authentication scheme based on designated verifier proofs. Information Sciences: an International Journal, 2009, 179(6): 858–865

    MATH  MathSciNet  Google Scholar 

  11. Boneh D, Franklin M. Identity-based encryption from the weil pairing. In: Advances in Cryptology-CRYPTO’2001, Springer-Verlag, 2001, LNCS 2139, 213–229

  12. Goldreich O. Foundations of Cryptography, Vol 1. Cambridge University Press, 2001

  13. Paterson K. Id-Based Signatures from Pairings on Elliptic Curves, Available at http://eprint.iacr.org, 004/2002

Download references

Author information

Authors and Affiliations

  1. Department of Computer and Information Technology, Beijing Jiaotong University, Beijing, 100044, China

    Jiqiang Liu, Xun Chen & Zhen Han

Authors
  1. Jiqiang Liu
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Xun Chen
    View author publications

    You can also search for this author inPubMed Google Scholar

  3. Zhen Han
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Xun Chen.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Liu, J., Chen, X. & Han, Z. Full and partial deniability for authentication schemes. Front. Comput. Sci. China 4, 516–521 (2010). https://doi.org/10.1007/s11704-010-0365-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11704-010-0365-z

Keywords