## 7 Conclusions and Future Directions  
The proposed solution enables parameterizable blind signature methods tailored to specific requirements, balancing anonymity, data security, and computational constraints. The \(T\) parameter allows fine-tuned control over confidentiality, facilitating its integration into distributed systems with hierarchical security needs. By adjusting cryptographic parameters, the scheme ensures both flexible anonymity and the elimination of rigid implementation models, empowering beneficiaries to define--from complete confidentiality in electronic voting to full disclosure requirements in supply chain audits. By combining blinding techniques with robust cryptographic features, the method demonstrates acceptable performance in IoT networks, despite limited resources. The method provides protection against brute force attacks, as well as adaptive and man-in-the-middle attacks, and is therefore suitable for critical applications, both in the IoT class and in line with the class of devices involved in secure communication. The integration of the system into blockchain technology allows for permanent data storage along with decentralized authentication, thus extending its utility to the cryptocurrency and logistics management sectors. However, the process is not without challenges. Performance in low-latency applications may suffer from the complexity of the r-factor, while high security requirements lead to larger keys, which increases the computational cost. Since the current process is not quantum-resistant, the long-term profitability of quantum computer development is uncertain. The current scheme can be extended to support multi-factor authentication approaches, including biometrics and hardware token solutions. Moreover, future adaptations may explore the integration of lattice-based primitives to ensure post-quantum resistance. Performance-aware adaptations of our scheme in quantum-secure blockchain infrastructures represent a promising direction to validate its long-term resilience and scalability. \begin{table}
\begin{tabular}{l l l l} \hline \hline
**Feature** & **TBS (Proposed)** & **PBS** & **ThBS** \\ \hline Anonymity control & Adjustable via \(T\) & Fixed partial information & Not configurable \\ \hline Resistance to adaptive attacks & High & Moderate & Moderate \\ \hline Signature size (for \(n=2048\)) & 256 bits & \(\sim\)512 bits & \(\sim\)768 bits \\ \hline Signing time (ARM Cortex-M4) & 5.2 ms & 8.9 ms & 12.1 ms \\ \hline Malleability resistance & High & Low & Moderate \\ \hline Application suitability & IoT, blockchain, voting & Corporate, voting & Banking, party \\ \hline Computational complexity & Low (\(O(k^{2}-k^{3})\)) & Moderate & High \\ \hline \hline \end{tabular}
\end{table} 
Table 5: Comparison between TBS, PBS, and ThBS schemes. Future research should focus on modifying the scheme for post-quantum cryptography by implementing network-based or code-based primitives to address current limitations. The current scheme can be extended to support multi-factor authentication approaches, including biometrics and hardware token solutions. The benefits of the scheme would improve 5G and 6G communication infrastructure applications through optimizations that allow for low latency and high bandwidth. This scheme is suitable for this due to the peculiarities of the algorithms for automatically adjusting the T parameter, allowing the system to dynamically meet application-specific requirements. The system automatically achieves optimal levels of anonymity or transparency based on specific requirements, without the need for manual user intervention. The proposed solution is a practical approach that combines customizable anonymity features with configurable cryptographic protection and parametrically adjustable computational efficiency from the algorithm primitives. The combination of its features makes this scheme suitable for use in multiple distributed and mission-critical applications.