Two-Round Identity-Based Proxy Blind Signature Scheme on Lattices

As Internet technology develops swiftly, the significance of privacy protection is escalating in the realms of e-commerce, e-government and software security. Due to the combination of the benefits of proxy signatures and blind signatures, the proxy blind signature scheme not only distributes the workload across application networks but also effectively safeguards the confidentiality of sensitive information. Additionally, the identity-based proxy blind signature protocol can avoid the problem of heavy certificate management and is widely used in electronic commerce and other scenarios. However, some identity-based proxy blind signature protocols that rely on the large-integer factorization problem and the discrete logarithm problem are unable to withstand from attacks from quantum computers. Furthermore, current lattice-based proxy blind signature protocols offer only heuristic security and require three rounds of information exchange during the signing phase. In this paper, we introduce a new two-round identity-based proxy blind signature scheme based on lattices. This scheme utilizes a zero-knowledge proof protocol on lattices as its core component to develop an interactive two-round signature scheme that is free from security proof vulnerabilities. Additionally, we validate the security of the proposed protocol within the random oracle model and conduct a performance analysis.