Evaluation of Computationally Efficient Identity-Based Proxy Signatures

Abstract

Proxy signatures (PS) are important cryptographic primitives widely used in digital signature applications across various domains. This survey explores PS security solutions in Identity-Based settings, including Short Identity-Based Proxy Signature (SIBPS), Identity-Based Proxy Signature with Message Recovery (IBPSMR), and Identity-Based Designated Verifier Signature (IBDVS). It also determines the performance of IBPS to address security requirements for delegation within resource-limited environments such as IoT devices and cloud computing. The evaluation determines performance bottlenecks while optimizing the computational complexity and communication overhead to support the practical and real-world implementation of IBPS. The findings reveal that IBPS schemes suffer from significant computation time and communication overhead due to heavy bilinear pairing operations. To evaluate and compare these schemes, we employ the Evaluation based on Distance from Average Solution (EDAS) model, which ranks the IBPS schemes according to their relative performance. The results indicate that the scheme proposed by Sarde et al., 2015 achieves the best performance, with a computation time of 6.9118 milliseconds and a communication overhead of 2464 bits. It is followed by the scheme from Jenefa and Shen et al., 2024 which records 7.7743 milliseconds and 2848 bits, and the scheme from Gu et al., 2015 with 6.2194 milliseconds and 3104 bits, respectively. Finally, we explored potential directions for future research.