Most of the provably-secure proxy signature schemes rely on the average-case hardness problems such as the integer factorization problems and the discrete logarithm problems. Therefore, those schemes are insecure to quantum analysis algorithms, since there exist quantum algorithms efficiently solving the factorization and logarithm problems. To make secure proxy signature schemes against quantum analysis, some lattice-based proxy signature schemes are suggested. However, none of the suggested latticebased proxy signature schemes is proxy-protected in the adaptive security model. In the paper, we propose a provably-secure IDbased proxy signature scheme based on the lattice problems. Our scheme is proxy-protected in the adaptive security model.
ASJC Scopus subject areas
- Information Systems
- Computer Networks and Communications