Revocable ID-based signature with short size over lattices

In the past, many ID-based signature (IBS) schemes based on the integer factorization or discrete logarithm problems were proposed.With the progress on the development of quantumtechnology, IBS schemesmentioned above would become vulnerable. Recently, several IBS schemes over lattices were proposed to be secure against attacks in the quantum era. As conventional publickey settings, ID-based public-key settings have to offer a revocationmechanism to revoke misbehaving ormalicious users.However, in the past, little work focuses on the revocation problem in the IBS schemes over lattices. In this article, we propose a new revocable IBS (RIBS) scheme with short size over lattices. Based on the short integer solution (SIS) assumption, we prove that the proposed RIBS scheme provides existential unforgeability against adaptive chosen-message attacks. As compared to the existing IBS schemes over lattices, our RIBS scheme has better performance in terms of signature size, signing key size, and the revocation mechanism with public channels.