Skip to main content

Deniable Authentication Protocols with Confidentiality and Anonymous Fair Protections

  • Conference paper
Advances in Intelligent Systems and Applications - Volume 2

Part of the book series: Smart Innovation, Systems and Technologies ((SIST,volume 21))

Abstract

Hwang and Chao proposed interactive deniable authentication protocols providing anonymity and fair protection both for senders and receivers. However, no non-interactive deniable authentication protocols are proposed to provide anonymity and fair protection both for senders and receivers. A noninteractive deniable authentication protocol with anonymity and fair protection is proposed to improve performance. Moreover, our protocol provides confidentiality but Hwang and Chao’s protocol does not.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 259.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 329.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 329.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dwork, C., Naor, M., Sahai, A.: Concurrent Zero-Knowledge. In: Proc. of 30th ACM STOC 1998, Dallas, TX, USA, pp. 409–418 (1998)

    Google Scholar 

  2. Aumann, Y., Rabin, M.: Efficient Deniable Authentication of Long Messages. Presented at 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

  3. Deng, X., Lee, C.H., Zhu, H.: Deniable Authentication Protocols. IEE Proceeding-Computers and Digital Techniques 148(2), 101–104 (2001)

    Article  Google Scholar 

  4. Fan, L., Xu, C.X., Li, J.H.: Deniable Authentication Protocol Based on Diffie-Hellman Algorithm. Electronics Letters 38(4), 705–706 (2002)

    Article  Google Scholar 

  5. Shao, Z.: Efficient Deniable Authentication Protocol Based on Generalized ElGamal Signature Scheme. Computer Standards and Interfaces 26, 449–454 (2004)

    Article  Google Scholar 

  6. Wang, B., Song, Z.X.: A Non-Interactive Deniable Authentication Scheme Based on Designated Verifier Proofs. Information Sciences 179, 858–865 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  7. Hwang, S.J., Ma, J.C.: Deniable Authentication Protocols with Sender Protection. In: 2007 National Computer Symposium, NCS 2007, Wufeng, Taiwan, pp. 762–767 (2007)

    Google Scholar 

  8. Hwang, S.J., Ma, J.C.: Deniable Authentication Protocols with (Anonymous) Sender Protection. In: 2008 International Computer Symposium, ICS 2008, Tamsui, Taiwan, pp. 412–419 (November 2008)

    Google Scholar 

  9. Hwang, S.J., Chao, C.H.: An Efficient Non-Interactive Deniable Authentication Protocol with Anonymous Sender Protection. In: Cryptology and Information Security Conference, Taipei City, Taiwan, R.O.C. (2009)

    Google Scholar 

  10. Chao, C.H.: Deniable Authentication Protocols with Anonymous Fair Protections. M.S. thesis, University of Tamkang, Taipei country, Taiwan, R.O.C. (2009)

    Google Scholar 

  11. Kudla, C.J.: Special Signature Scheme and Key Agreement Protocols. Ph.D. dissertation, Royal Holloway, University of London, Egham, Surrey, England (2006)

    Google Scholar 

  12. Zheng, Y.: Digital Signcryption or How to Achieve Cost (Signature & Encryption) < < Cost(Signature) + Cost(Encryption). In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 165–179. Springer, Heidelberg (1997)

    Google Scholar 

  13. Hwang, S.-J., Sung, Y.-H.: Confidential Deniable Authentication Using Promised Signcryption. Journal of Systems and Software 84(10), 1652–1659 (2011)

    Article  Google Scholar 

  14. Schnorr, C.-P.: Efficient Identification and Signatures for Smart Cards. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 239–252. Springer, Heidelberg (1990)

    Google Scholar 

  15. Nguyen, K.: Asymmetric Concurrent Signatures. In: Qing, S., Mao, W., López, J., Wang, G. (eds.) ICICS 2005. LNCS, vol. 3783, pp. 181–193. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  16. Diffie, W., Hellman, M.E.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644–654 (1976)

    Article  MathSciNet  MATH  Google Scholar 

  17. Pointcheval, D., Stern, J.: Security Arguments for Digital Signatures and Blind Signatures*. Journal of Cryptology 13(3), 361–396 (2000)

    Article  MATH  Google Scholar 

  18. Chaum, D., van Antwerpen, H.: Undeniable Signatures. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 212–216. Springer, Heidelberg (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Shin-Jia Hwang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hwang, SJ., Sung, YH., Chi, JF. (2013). Deniable Authentication Protocols with Confidentiality and Anonymous Fair Protections. In: Pan, JS., Yang, CN., Lin, CC. (eds) Advances in Intelligent Systems and Applications - Volume 2. Smart Innovation, Systems and Technologies, vol 21. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-35473-1_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-35473-1_5

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-35472-4

  • Online ISBN: 978-3-642-35473-1

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics