Huawei Huang
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.
- Singh, M. K. (2004) Public Key Cryptography with Matrices, Proceedings of the IEEE Workshop on Information Assurance, United States Military Academy, pp. 146--152. Google Scholar
Cross Ref
- 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. Google ScholarDigital Library
- Mullan, C. (2011) Cryptanalysing variants of Stickel's key agreement protocol, J. Math. Crypt. vol. 4, No. 4, pp. 365--373.Google Scholar
- Shpilrain, V. (2008) Cryptanalysis of Stickel's key exchange scheme,in: Computer Science in Russia2008, Lecture Notes Comp. Sc. 5010, pp. 283--288. Google ScholarCross Ref
- 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.Google ScholarDigital Library
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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. Google ScholarCross Ref
- 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.Google Scholar
- Lidl, R. and Niederreiter, H. (1983) Finite fields, Encyclopedia Math. Appl., Vol. 20, Addison-Wesley, Reading, MA,1983. (Now distributed by Cambridge Univ. Press.)Google Scholar
- 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. Google ScholarCross Ref
- 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. Google ScholarCross Ref
- Julien Bringer, Herve Chabanne and Thomas Icart. (2009) Efficient zero-knowledge identification schemes which respect privacy. ASIACC'09, pp. 195--205. Google ScholarDigital Library
- Goldreich, O., Sahai, A., Vadhan, S. (1998) Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge, in the 30th STOC, pp. 399--408.Google Scholar
- 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. Google ScholarCross Ref
- 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. Google ScholarCross Ref
- 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. Google ScholarCross Ref
Recommendations
A new framework for the design and analysis of identity-based identification schemes
Constructing an identification scheme is one of the fundamental problems in cryptography, and is very useful in practice. An identity-based identification (IBI) scheme allows a prover to identify himself to a public verifier who knows only the claimed ...
Identity-Based Identification Scheme Secure against Concurrent-Reset Attacks without Random Oracles
Information Security ApplicationsThe notion of identity-based cryptography was put forward by Shamir in 1984. This setting has also been considered in identification schemes. Since then, many identity-based identification schemes have been proposed. Nonetheless, most of them only ...
Quasi-Dyadic Girault Identification Scheme
Codes, Cryptology and Information SecurityAbstractZero-knowledge identification schemes allow a prover to convince a verifier that a certain fact is true, while not revealing any additional information.
In this paper, we propose a scheme whose security relies on the hardness of the Quasi-Dyadic ...
Comments