Threshold proxy re-signature: definition and new constructions |
| |
| Authors: | Xi Chen Lein Harn Ge Yao |
| |
| Affiliation: | 1. Key Laboratory of Communication and Information Systems, Beijing Municipal Commission of Education, Beijing Jiaotong University, Beijing, PR China;2. Department of Computer Science and Electrical Engineering, School of Computer and Engineering, University of Missouri, Kansas City, USA;3. School of Engineering, University of Melbourne, Melbourne, Australia |
| |
| Abstract: | The previous threshold proxy re-signature schemes have been mainly constructed with bilinear maps, the implementations of which are much more time-consuming than exponentiation operations. To solve this problem, we propose efficient threshold proxy re-signature schemes which are constructed with El-Gamal signatures. The performance analysis shows that our schemes are more efficient than the existing threshold proxy re-signature schemes. Based on the discrete logarithm problem, our schemes are provable secure in the random oracle model. |
| |
| Keywords: | Information security cryptography secret sharing proxy re-signature |
|
|
