On-line/off-line threshold proxy re-signatures can efficiently improve the the performance of threshold proxy re-signature schemes. A simulation theorem for on-line/off-line threshold proxy re-signature schemes is presented in this paper. This theorem provides a theoretical basis for constructing an on-line/off-line threshold proxy re-signature scheme through the simulation approach, where the security of an on-line/off-line threshold proxy re-signature scheme can be reduced to that of its underlying divisible online/ off-line proxy re-signature scheme. Furthermore, we propose an on-line/off-line threshold proxy re-signature scheme which is proven secure (unforgeable and robust) under the computational Diffie-Hellman assumption and the discrete logarithm assumption. The on-line phase of the proposed scheme is efficient: computing a re-signature does not require any heavy computations such as exponentiations or pairings.
Yang, Xiaodong; Gao, Guojuan; Li, Yanan; Li, Yan; and Wang, Caifen
"On-Line/Off-Line Threshold Proxy Re-Signature Scheme through the Simulation Approach,"
Applied Mathematics & Information Sciences: Vol. 09:
6, Article 53.
Available at: https://digitalcommons.aaru.edu.jo/amis/vol09/iss6/53