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

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

A New Zero Knowledge Identification Scheme based on Weil Pairing

by B. K. Sharma, Hemlal Sahu, Neetu Sharma
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 83 - Number 2
Year of Publication: 2013
Authors: B. K. Sharma, Hemlal Sahu, Neetu Sharma
10.5120/14423-2556

B. K. Sharma, Hemlal Sahu, Neetu Sharma . A New Zero Knowledge Identification Scheme based on Weil Pairing. International Journal of Computer Applications. 83, 2 ( December 2013), 34-37. DOI=10.5120/14423-2556

@article{ 10.5120/14423-2556,
author = { B. K. Sharma, Hemlal Sahu, Neetu Sharma },
title = { A New Zero Knowledge Identification Scheme based on Weil Pairing },
journal = { International Journal of Computer Applications },
issue_date = { December 2013 },
volume = { 83 },
number = { 2 },
month = { December },
year = { 2013 },
issn = { 0975-8887 },
pages = { 34-37 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume83/number2/14423-2556/ },
doi = { 10.5120/14423-2556 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:58:22.806120+05:30
%A B. K. Sharma
%A Hemlal Sahu
%A Neetu Sharma
%T A New Zero Knowledge Identification Scheme based on Weil Pairing
%J International Journal of Computer Applications
%@ 0975-8887
%V 83
%N 2
%P 34-37
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Many identification schemes have been proposed in which security are based on the intractability of factoring or DLP (Discrete Logarithm Problem). In 2009, Massoud et. al gave identification scheme whose security was based on solving ECDLP (Elliptic Curve Discrete Logarithm Problem). The security of this scheme is improved in order to propose a more secure and efficient scheme. The security of proposed scheme is based on expressing torsion point of elliptic curve into linear combination of basis points. This is more complicated than solving ECDLP and thus provides a higher level of security. Also proposed scheme is more efficient with respect to encryption and decryption since it requires only minimal operations in both algorithms.

References
  1. Diffie W. , Hellman M. , 1976. New directions in cryptography. IEEE trans . Inf. Theory, 22(6), 644-654.
  2. E1Gamal T. , 1985. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory, IT-31(4): 469-472.
  3. Fiat A. , Shamir A. , 1986. How to prove yourself: practical solutions to identification and signature problems. proceedings of crypto 86, Santa Barbara 181-187.
  4. Fiege, U. , Fiat, A. , Shamir, A. , 1987. Zero knowledge proofs of identity. Proc. of STOC.
  5. Goldwasser,S. , Micali, S. , and Rackoff, C. , 1989. The Knowledge Complexity of Interactive Proofs Systems. SIAM Journal on Computing, Vol. 18, pages 186-208, 1989. Preliminary version in 17th ACM Symposium on the theory of computing, 1985. Earlier version date to 1982.
  6. Hoffstein, J. ,Pipher, J. , Silverman, J. H. , An Introduction to mathematical Cryptography. Springer.
  7. Koblitz, N. , 1987, Elliptic curve cryptosystems. Mathematics of Computation 48, 203-209.
  8. Guillou, L. C. ,Quisquater, J. J. , 1988. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory. Advances in Cryptology EUROCRYPT 88 Lecture Notes in Computer Science Volume 330, pp 123-128.
  9. Massoud, H. D. , and Reza, A. , 2007. Zero-Knowledge Identification Scheme Based on Weil Pairing. ISSN 1995-0802, Lobachevskii Journal of Mathematics, Vol. 30, No. 3, pp. 203-207.
  10. Miller, V. S. , 1986. Uses of elliptic curves in cryptography. in: Advances in Cryptology- Crypto'85, Lecture Notes in Computer Science, 218, Springer-Verlag, Berlin, pp. 417-426.
  11. Rivest, R. L. , Shamir, A. , Adleman, L. , 1978. A method for obtaining digital signatures and public key cryptosystems. Communication of the ACM, 21,120-126.
  12. Silverman, J. H. , 1986. The Arithmetic of elliptic curves. Volume 106 of Graduate Texts in Mathematics, Springer-Verlag New York.
Index Terms

Computer Science
Information Sciences

Keywords

Identification Elliptic Curve Weil Pairing Challenge- Response Zero-Knowledge Proof.

Powered by PhDFocusTM