VPS: A Verkle-Based Polynomial Signature Scheme with Post-Quantum Security

With the development of large-scale quantum computers, classical cryptographic algorithms such as RSA or ECC can easily be broken by Shor’s algorithm. Consequently, the cryptography community is shifting its focus toward Post-Quantum Cryptography (PQC), developing primitives that are secure against both classical and quantum attacks. In this paper, we propose a novel Verkle-Polynomial Signature (VPS) scheme by combining the lattice-based polynomial commitment scheme of Cini et al. with Verkle trees and a lattice-based One-Time Signature (OTS) engine to achieve post-quantum security. We demonstrate that while sacrificing the operational efficiency and structural maturity of traditional hash-based signatures, our framework provides robust post-quantum security guarantees inherited from standard lattice assumptions.