Perfect Concurrent Signature Schemes
- 764 Downloads
The notion of concurrent signatures was recently introduced by Chen, Kudla and Paterson in their seminal paper in . In concurrent signature schemes, two entities can produce two signatures that are not binding, until an extra piece of information (namely the keystone) is released by one of the parties. Upon release of the keystone, both signatures become binding to their true signers concurrently. In this paper, we extend this notion by introducing a new and stronger notion called perfect concurrent signatures. We require that although both signers are known to be trustworthy, the two signatures are still ambiguous to any third party (c.f. ). We provide two secure schemes to realize the new notion based on Schnorr’s signature schemes and bilinear pairing. These two constructions are essentially the same. However, as we shall show in this paper, the scheme based on bilinear pairing is more efficient than the one that is based on Schnorr’s signature scheme.
KeywordsSignature Scheme Initial Signer Trusted Third Party Discrete Logarithm Problem Bilinear Pairing
Unable to display preview. Download preview PDF.
- 2.Asokan, N., Schunter, M., Waidner, M.: Optimistic protocols for fair exchange. In: Proc. 4th ACM Conf. on Comp. and Comm. Security, pp. 8–17 (1997)Google Scholar
- 3.Camenisch, J.: Efficient and Generalized Group Signatures. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 465–479. Springer, Heidelberg (1997)Google Scholar
- 4.Camenisch, J.: Group Signature Schemes and Payment Systems based on the Discrete Logarithm Problem. PhD Thesis, ETH Zürich (1998)Google Scholar
- 6.Pointcheval, D., Stern, J.: Security Proofs for Signature Schemes. In: Maurer, U.M. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 387–398. Springer, Heidelberg (1996)Google Scholar