Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
Post Quantum Cryptography
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
An efficient provable distinguisher for HFE
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part II
Secure Proxy Signature Schemes for Delegation of Signing Rights
Journal of Cryptology
A fast cryptanalysis of the isomorphism of polynomials with one secret problem
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Polynomial equivalence problems: algorithmic and theoretical aspects
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
On provable security of UOV and HFE signature schemes against chosen-message attack
PQCrypto'11 Proceedings of the 4th international conference on Post-Quantum Cryptography
Towards provably secure proxy signature scheme based on Isomorphisms of Polynomials
Future Generation Computer Systems
| Hi-index | 0.00 |
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.