•  
  •  
 

Author Country (or Countries)

China

Abstract

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.

Suggested Reviewers

N/A

Share

COinS