In recent years, there have been innovations in the realm of digital signatures, with extensions and variations that integrate digital signatures with specific protocols to provide additional functionalities not offered by standard signature schemes. While that integrate digital signatures with specific protocols to provide additional functionalities not offered by standard signature schemes. While conventional signatures schemes involve a signer signing message that can be verified by any one, there are situations where the confidentiality of the message is paramount. To address this need, Chaums proposed the concept of blind signatures, this mechanism enables a user to secure a signature on a message while maintaining complete privacy of the message with respect to the signer. The blind signature system protects user privacy which enables its use in e-voting and e-cash systems for anonymous operations. Scientists developed multiple signature schemes which use integer message representation to protect security through integer factorization and modular logarithm problem solutions. The security of these systems needs to be improved according to current assessments. The research presents a new Blind Signature Scheme which combines the RSA cryptosystem with Tribonacci Matrix technology. Our proposed system shows that messages exist as matrices which gain protection through the RSA security model. The study provides a full evaluation of the proposed system’s security measures together with its operational performance.