Proxy Signature Scheme Based on Isomorphisms of Polynomials
The proxy signatures are important cryptosystems that are widely adopted in different applications. Most of the proxy signature schemes so far are based on the hardness of integer factoring, discrete logarithm, and/or elliptic curve. However, Shor proved that the emerging quantum computers can solve the problem of prime factorization and discrete logarithm in polynomial-time, which threatens the security of current RSA, ElGamal, ECC, and the proxy signature schemes based on these problems. We propose a novel proxy signature scheme based on the problem of Isomorphism of Polynomials (IP) which belongs to a major category of Multivariate Public Key Cryptography (MPKC). Through security discussion, our scheme can reach the same security level as the signature scheme based on IP problem. The most attractive advantage of our scheme should be its feature to potentially resist the future quantum computing attacks. Our scheme also owns some important properties of proxy signature schemes, such as strong unforgeability, strong identifiability, strong undeniability, secret-key’s dependence, distinguishability, etc. The scheme is implemented in C/C++ programming language, and the performance shows that the scheme is efficient. The parameters we choose can let security level of the scheme up to 286.59.
KeywordsPost-Quantum Cryptography Multivariate Public Key Cryptography Isomorphism of Polynomials Proxy Signature Digital Signature
Unable to display preview. Download preview PDF.
- 1.Awasthi, A., Lal, S.: Proxy Blind Signature Scheme. Transaction on Cryptology 2(1), 5–11 (2005)Google Scholar
- 2.Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography, Department of Computer Science, University of Illinois, Chicago. Springer, Heidelberg (2009)Google Scholar
- 4.Bouillaguet, C., Faugère, J., Fouque, P., Perret, L.: Differential Algorithms for the Isomorphism of Polynomials Problem (2009) (manuscript), http://eprint.iacr.org/2009/583.pdf
- 9.Garey, M.R., Johnson, D.S.: Computers and Intractability, A Guide to the Theory of NP-completeness. W.H. Freeman (1979)Google Scholar
- 12.Mambo, M., Usuda, K., Okamoto, E.: Proxy Signatures: Delegation of The Power to Sign Messages. IEICE Transactions on Fundamentals, E79-A(9), 1338-1353 (1996)Google Scholar
- 13.Mambo, M., Usuda, K., Okamoto, E.: Proxy Signatures for Delegating Signing Operation. In: Proceedings of the 3rd ACM Conference on Computer and Communications Security, pp. 48-57. ACM (1996)Google Scholar
- 15.Patarin, J.: Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 33–48. Springer, Heidelberg (1996)Google Scholar