On-line/Off-line Threshold Proxy Re-Signatures

YANG Xiaodong; WANG Caifen; ZHANG Lei; QIU Jianbin

Article Contents

Article Navigation > Chinese Journal of Electronics > 2014 > 23(2): 248-253

YANG Xiaodong, WANG Caifen, ZHANG Lei, et al., “On-line/Off-line Threshold Proxy Re-Signatures,” Chinese Journal of Electronics, vol. 23, no. 2, pp. 248-253, 2014,

Citation:

YANG Xiaodong, WANG Caifen, ZHANG Lei, et al., “On-line/Off-line Threshold Proxy Re-Signatures,” Chinese Journal of Electronics, vol. 23, no. 2, pp. 248-253, 2014,

YANG Xiaodong, WANG Caifen, ZHANG Lei, et al., “On-line/Off-line Threshold Proxy Re-Signatures,” Chinese Journal of Electronics, vol. 23, no. 2, pp. 248-253, 2014,

Citation:

YANG Xiaodong, WANG Caifen, ZHANG Lei, et al., “On-line/Off-line Threshold Proxy Re-Signatures,” Chinese Journal of Electronics, vol. 23, no. 2, pp. 248-253, 2014,

PDF( 218 KB)

On-line/Off-line Threshold Proxy Re-Signatures

College of Computer Science & Engineering, Northwest Normal University, Lanzhou 730070, China

Funds: This work is supported in part by the National Natural Science Foundation of China (No.61262057, No.61063041, No.61163038), and the Young Teachers' Scientific Research Ability Promotion Program of Northwest Normal University (No.NWNU-LKQN-10-22).

Received Date: 2011-12-01
Rev Recd Date: 2013-07-01
Publish Date: 2014-04-05

Abstract

Abstract

To improve the performance of threshold proxy re-signatures, the notion of on-line/off-line threshold proxy re-signatures is introduced. The bulk of re-signature computation can be done in the off-line phase before the message arrives. The results of this pre-computation are saved and then utilized in the on-line phase once a message to be re-signed is known. Based on any threshold proxy re-signature scheme and a threshold version of chameleon hash function, we present a generic on-line/off-line threshold proxy re-signature scheme that can convert any existing secure threshold proxy re-signature scheme into an on-line/off-line one. The on-line phase of our scheme is efficient: computing a re-signature share requires one round of communication, two modular additions and one modular multiplication. Our scheme is provably secure under the discrete logarithm assumption without random oracles. Moreover, our scheme can achieve robustness in the presence of [n/3] malicious proxies.
- On-line/off-line,
- Threshold proxy resignature,
- Chameleon hash function,
- Standard model,
- Existential unforgeability

FullText(HTML)

References(20)

References

P. Yang, Z. Cao and X. Dong, "Threshold proxy re-signature", Journal of Systems Science and Complexity, Vol.24, No.4, pp.816-824, 2011.

X. Yang, C. Wang, "Threshold proxy re-signature schemes in the standard model", Chinese Journal of Electronics, Vol.19, No.1, pp.345-350, 2010.

S. Even, O. Goldreich, S. Micali, "On-line/off-line digital signatures", Journal of Cryptology, Vol.9, No.1, pp.35-67, 1996.

C. Gao, B.Wei, D. Xie and C. Tang, "Divisible on-Line/off-Line signatures", Proc. of CT-RSA 2009, San Francisco, CA, USA, pp.148-163, 2009.

K. Kurosawa, K. Schmidt-Samoa, "New on-line/off-line signature schemes without random oracles", Proc. of PKC 2006, New York, USA, pp.330-346, 2006.

A. Shamir, Y. Tauman, "Improved on-line/off-line signature schemes", Proc. of Cryptology-Crypto 2001, Santa Barbara, California, USA, pp.355-367, 2001.

E. Bresson, D. Catalano and R. Gennaro, "Improved online/ off-line threshold signatures", Proc. of PKC 2007, Beijing, China, pp.217-232, 2007.

C. Crutchfield, D. Molnar, D. Turner, et al., "Generic online/ off-line threshold signatures", Proc. of PKC 2006, New York, USA, pp.58-74, 2006.

M. Blaze, G. Bleumer and M. Strauss, "Divertible protocols and atomic proxy cryptography", Proc. of EUROCRYPT 1998, Espoo, Finland, Kaisa Nyberg, pp.127-144, 1998.

G. Ateniese, S. Hohenberger, "Proxy re-signatures: New definitions, algorithms and applications", Proc. of the 12th ACM CCS, Alexandria, USA, pp.310-319, 2005.

R. Canetti, O. Goldreich and S. Halevi, "The random oracle methodology, revisited", Journal of the ACM (JACM), Vol.51, No.4, pp.557-594, 2004.

J. Shao, Z. Cao, L. Wang and X. Liang, "Proxy re-signature schemes without random oracles", Proc. of INDOCRYPT 2007, Chennai, India, pp.197-209, 2007.

B. Libert, D. Vergnaud, "Multi-use unidirectional proxy resignatures", Proc. of ACM CCS 2008, Alexandria, VA, USA, pp.511-520, 2008.

H. Krawczyk, T. Rabin, "Chameleon hashing and signatures", Proc. of the 7th ANDSSS, San Diego, California, USA, pp.143-154, 2000.

J. Baek, Y.L. Zheng, "Identity-based threshold signature scheme from the bilinear pairings", Proc. of ITCC 2004, Las Vegas, Nevada USA, pp.124-128, 2004.

R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, "Robust threshold DSS signatures", Proc. of Cryptology-Eurocrypt 1996, Saragossa, Spain, pp.354-371, 1996.

R. Gennaro, S. Jarecki, H. Krawczyk and T. Rabin, "Secure distributed key generation for discrete-log based cryptosystems", Proc. of Cryptology-Eurocrypt 1999, Prague, Czech Republic, pp.295-310, 1999.

M. Ben-Or, S. Goldwasser and A. Wigderson, "Completeness theorems for non-cryptographic fault tolerant distributed computation", Proc. of the 20th Annual ACM STC 1988, Chicago, Illinois, USA, pp.1-10, 1988.

J. Bar-Ilan, D. Beaver, "Non-cryptographic fault-tolerant computing in a constant number of rounds interaction", Proc. of the Eighth Annual ACM SPDC, Edmonton, Alberta, Canada, pp.201-209, 1989.

L. Welch, E. Berlekamp, "Error correction of algebraic block codes", U.S. Patent No.4633470, issued December 1986.

Relative Articles

Supplements(0)

Cited By

Proportional views