CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Cryptanalysis of a Deniable Authentication Protocol based on Bilinear Pairing using Single Sender and Group Sender

by G. A. V. Rama Chandra Rao, P. V. Lakshmi, N. Ravi Shankar
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 41 - Number 3
Year of Publication: 2012
Authors: G. A. V. Rama Chandra Rao, P. V. Lakshmi, N. Ravi Shankar
10.5120/5520-7551

G. A. V. Rama Chandra Rao, P. V. Lakshmi, N. Ravi Shankar . Cryptanalysis of a Deniable Authentication Protocol based on Bilinear Pairing using Single Sender and Group Sender. International Journal of Computer Applications. 41, 3 ( March 2012), 10-13. DOI=10.5120/5520-7551

@article{ 10.5120/5520-7551,
author = { G. A. V. Rama Chandra Rao, P. V. Lakshmi, N. Ravi Shankar },
title = { Cryptanalysis of a Deniable Authentication Protocol based on Bilinear Pairing using Single Sender and Group Sender },
journal = { International Journal of Computer Applications },
issue_date = { March 2012 },
volume = { 41 },
number = { 3 },
month = { March },
year = { 2012 },
issn = { 0975-8887 },
pages = { 10-13 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume41/number3/5520-7551/ },
doi = { 10.5120/5520-7551 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:28:39.135535+05:30
%A G. A. V. Rama Chandra Rao
%A P. V. Lakshmi
%A N. Ravi Shankar
%T Cryptanalysis of a Deniable Authentication Protocol based on Bilinear Pairing using Single Sender and Group Sender
%J International Journal of Computer Applications
%@ 0975-8887
%V 41
%N 3
%P 10-13
%D 2012
%I Foundation of Computer Science (FCS), NY, USA
Abstract

The aim of an efficient deniable authentication protocol is to enable a receiver to identify the source of a given message but not to prove the identity of the sender. Lu and Cao [7,10] confirmed that the previous protocols had a common weakness in which any third party can impersonate the intended receiver to verify the signature of the given message, and they proposed a new protocol based on bilinear pairing using single sender and sender group. They claimed that their protocol could provide complete security and properties of a deniable authentication protocol based on bilinear pairing using single sender and sender group, we will point out that the protocol in two papers is unable to prove the source of the given message to any third party, even if he/she fully cooperates with the third party.

References
  1. C. Dwork, M. Naor, and A. Sahai, "Concurrent zero-knowledge," Proceedings of the 30th ACM Symposium on Theory of Computing, pp. 409–418, 1998.
  2. Y. Aumann, and M. Rabin, "Efficient deniable authentication of long messages," International Conference on Theoretical Computer Science in Honor of ProfessorManuel Blum's 60th Birthday, Hong Kong, China, Apr. 1998.
  3. X. Deng, C. H. Lee and H. Zhu, "Deniable authentication protocols," IEEE Proceedings of Computers and Digital Techniques, vol. 148, no. 2, pp. 101–104, 2001.
  4. Y. Aumann, and M. Rabin, "Authentication enhanced security and error correcting Codes," Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology, Lecture Notes in Computer Science 1462, pp. 299–303, 1998.
  5. L. Fan, C. X. Xu and J. H. Li, "Deniable authentication protocol based on Diffie-Hellman algorithm," Electronics Computer Standards & Interfaces, vol. 26, no. 5, pp. 449–454, 2004.
  6. Z. Shao, "Efficient deniable authentication protocol based on generalized Elgamal Signature scheme," Computer standards & Interfaces, vol. 26, no. 5, pp, 449-454, 2004.
  7. Rongxing Lu, and Zhenfu Cao, "A new deniable authentication protocol from bilinear Pairings," Applied Mathematics and Computation, vol. 168, pp. 954-961, 2005.
  8. D. Boneh, and M. Franklin, "Identity-based encryption from the Weil pairing," Crypto 2001, Lecture Notes In Computer Science 2139, Springer-Verlag, Berlin, pp. 213–229, 2001.
  9. F. Zhang, R. Safavi-Naini, and W. Susilo, "An efficient signature scheme from bilinear Pairings and its applications," Proceedings of PKC 2004, Lecture Notes in Computer Science 2947, Springer-Verlag, Berlin, pp. 277–290, 2004.
  10. Rongxing Lu, and Zhenfu Cao, "Group oriented identity-based deniable Authentication protocol from the bilinear pairings," International Journal of Network Security, vol. 5, no. 3, pp. 283–287, 2007.
  11. Haibo Tian, Xiaofeng Chen, and Yong Ding, "Analysis of two types deniable Authentication protocols," International Journal of Network Security, vol. 9, no. 3, pp. 242–246, 2009.
  12. Zhenfu Cao, "Universal encrypted deniable authentication protocol," International Journal of Network Security, vol. 8, no. 2, pp. 151–158, 2009.
Index Terms

Computer Science
Information Sciences

Keywords

Deniable Authentication Information Security Cryptography Bilinear Pairing Mac Digital Signature

Powered by PhDFocusTM