skip to main content
10.1145/3058060.3058084acmotherconferencesArticle/Chapter ViewAbstractPublication PagesiccspConference Proceedingsconference-collections
research-article

Zero-Knowledge Identification Scheme Based on Symmetry Ergodic Matrices Exponentiation Problem

Published: 17 March 2017 Publication History

Abstract

Symmetry ergodic matrices exponentiation (SEME) problem is to find x, given CxMDx, where C and D are the companion matrices of primitive polynomials and M is an invertible matrix over finite field. This paper proposes a new zero-knowledge identification scheme based on SEME problem. It is perfect zero-knowledge for honest verifiers. The scheme could provide a candidate cryptographic primitive in post quantum cryptography. Due to its simplicity and naturalness, low-memory, low-computation costs, the proposed scheme is suitable for using in computationally limited devices for identification such as smart cards.

References

[1]
Singh, M. K. (2004) Public Key Cryptography with Matrices, Proceedings of the IEEE Workshop on Information Assurance, United States Military Academy, pp. 146--152.
[2]
Stickel, E. (2005) A New Method for Exchanging Secret Keys, In: Proc. of the Third International Conference on Information Technology and Applications (ICITA05) 2, pp. 426--430.
[3]
Mullan, C. (2011) Cryptanalysing variants of Stickel's key agreement protocol, J. Math. Crypt. vol. 4, No. 4, pp. 365--373.
[4]
Shpilrain, V. (2008) Cryptanalysis of Stickel's key exchange scheme,in: Computer Science in Russia2008, Lecture Notes Comp. Sc. 5010, pp. 283--288.
[5]
Alvarez, R., Martinez, F. M., Vicent, J. F., Zamora. A. (2008) A matricial public key cryptosystem with digital signature, Wseas Transactions on Mathematics, Vol. 7, No. 4, pp. 195--204.
[6]
Zhao, Y., Wang L, L., Zhang, W. (2004) Information-Exchange Using the Ergodic Matrices in GF(2), Proc. ACNS 2004. Icisa Press,pp. 388--397.
[7]
Pei, S., Zhao, Y., Zhao, H. (2007) Construct public key encryption scheme using ergodic matrices over GF(2), TAMC 2007. Berlin: Springer-Verlag, pp. 181--188.
[8]
Pei, S. Zhao, Y., Zhao, H. (2010) Public Key Encryption Scheme Based on the Ergodic Matrices, Acta Electronica Sinica. vol. 38, No. 8, pp. 1908--1913.
[9]
Zhao, Y., Zhao, B., Pei, S. (2012) On the properties of the ergodic matrix over finite field, ACTA Mathematica Sinica,vol. 55, No. 3, pp. 457--468.
[10]
Zhou, X. and Ma, J. (2011) Ergodic Matrix and Hybrid-key Based Image Cryptosystem, I.J. Image, Graphics and Signal Processing 4,pp. 1--9.
[11]
Zhao, Y., Zhao, B., Pei, S. (2011) Design and implement on the HFEM public key scheme, Journal on Communications, vol. 32,No. 6, pp. 24--31.
[12]
Lidl, R. and Niederreiter, H. (1983) Finite fields, Encyclopedia Math. Appl., Vol. 20, Addison-Wesley, Reading, MA,1983. (Now distributed by Cambridge Univ. Press.)
[13]
Sakumoto K., Shirai T., and Hiwatari H. (2011), Public-key identification schemes based on multivariate quadratic polynomials, P. Rogaway, ed., Advances in Cryptology CRYPTO 2011, vol.6841 of Lect.Notes Comput. Sci., pp. 706--723.
[14]
Monteiro Fabio S., Goya Denise H., Terada Routo. (2015) Improved identification protocol based on the MQ problem. IEICE Trans. Fundamentals, Vol. E98-A, No. 6, pp. 1255--1265.
[15]
Julien Bringer, Herve Chabanne and Thomas Icart. (2009) Efficient zero-knowledge identification schemes which respect privacy. ASIACC'09, pp. 195--205.
[16]
Goldreich, O., Sahai, A., Vadhan, S. (1998) Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge, in the 30th STOC, pp. 399--408.
[17]
Huang Huawei, Peng Changwen. (2014) Companion matrix and recognition of primitive polynomial, Journal of Discrete Mathematical Sciences and Cryptography, vol. 17,No. 1, pp. 39--48.
[18]
Cayrel, P. L., Lindner, R., Ruckert, M. Silva, R. (2010) Improved zero-knowledge identification with lattices.In: ProvSec 2010. LNCS, vol. 6402, pp. 1--17.
[19]
Hu Rong, Morozov Kirill, Takagi Takagi. (2015) Zero-Knowledge protocols for code-based public-key encryption. IEICE Trans. Fundamentals, Vol. E98-A, No. 10, pp. 2139--2151.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICCSP '17: Proceedings of the 2017 International Conference on Cryptography, Security and Privacy
March 2017
153 pages
ISBN:9781450348676
DOI:10.1145/3058060
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

In-Cooperation

  • Wuhan Univ.: Wuhan University, China

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 17 March 2017

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. Companion Matrix
  2. Finite field
  3. Identification Scheme
  4. Post quantum cryptography
  5. Primitive Polynomials

Qualifiers

  • Research-article
  • Research
  • Refereed limited

Conference

ICCSP '17

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 63
    Total Downloads
  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media