Unlinkable Secret Handshakes from MessageRecovery Signature

WEN Yamin; ZHANG Fangguo; XU Lingling

Article Contents

Article Navigation > Chinese Journal of Electronics > 2010 > 19(4): 705-709

WEN Yamin, ZHANG Fangguo, XU Lingling, “Unlinkable Secret Handshakes from MessageRecovery Signature,” Chinese Journal of Electronics, vol. 19, no. 4, pp. 705-709, 2010,

Citation:

WEN Yamin, ZHANG Fangguo, XU Lingling, “Unlinkable Secret Handshakes from MessageRecovery Signature,” Chinese Journal of Electronics, vol. 19, no. 4, pp. 705-709, 2010,

WEN Yamin, ZHANG Fangguo, XU Lingling, “Unlinkable Secret Handshakes from MessageRecovery Signature,” Chinese Journal of Electronics, vol. 19, no. 4, pp. 705-709, 2010,

Citation:

WEN Yamin, ZHANG Fangguo, XU Lingling, “Unlinkable Secret Handshakes from MessageRecovery Signature,” Chinese Journal of Electronics, vol. 19, no. 4, pp. 705-709, 2010,

PDF( 214 KB)

Unlinkable Secret Handshakes from MessageRecovery Signature

Received Date: 2009-05-01
Rev Recd Date: 2010-04-01
Publish Date: 2010-11-25

Abstract

Abstract

Secret handshake scheme allows the membersof a certain organization can anonymously authenticateeach other. In this paper, two Unlinkable secret handshakeschemes (called USH-1 and USH-2) are proposedby using the Message recovery signature (MRS). USH-1 achieves the unlinkability with one-time pseudonyms,whilst USH-2 obtains a strong unlinkability against groupauthority with reusable credentials. The security of USH-1 and USH-2 are reduced to the intractability of DiscreteLogarithm Problem and the k + 1 Square Roots Problem,respectively. Compared with some seminal schemes, bothof our schemes are competitive in the performance.
- Authenticity,
- Anonymity,
- Secret handshakes,
- Message recovery signature