Aiming at the problem of fair exchange of digital signatures
a scheme of revocable concurrent signatures is proposed. In the step of signing
the signer chooses a piece of special information named keystone. The one-way function is then used to compute the keystone footprint
and then the encryption of the signer's public key is obtained by raising the keystone footprint to the power of his secret key. The keystone footprints are computed once more from the released keystones after the exchange of signatures
and each signer's public key is raised to the power of the keystone footprint. Then the identities of signers are recognized by comparing the results with the encryptions of the public keys produced in the step of signing
and the ambiguity of signatures can be revoked. Compared with traditional concurrent signatures schemes
the proposed scheme can avoid various attacks. Moreover
when a pair of revocable concurrent signatures is produced
only one keystone is required so that exchange protocols are simplified. It has been verified in a concrete construction that the proposed scheme is secure in the random oracle model under the decisional Diffie-Hellman assumption and the discrete logarithms assumption.
关键词
Keywords
references
Garay G, Pomerance C. Timed fair exchange of standard signatures[C]∥Proceedings of Financial Cryptography. Berlin, Germany: Springer,2003:190-207.
ATENIESE G. Verifiable encryption of digital signatures and applications [J]. ACM Transactions on Information and System Security, 2004, 7(1): 1-20.
CHEN Liqun, KUDLA C, PATERSON K G. Concurrent signatures [C]∥Advances in Cryptology: Eurocrypt 2004. Berlin, Germany: Springer,2004: 287-305.
SUSILO W, MU Yi, ZHANG Fangguo. Perfect concurrent signature schemes [C]∥Proceedings of 6th International Conference on Information and Communications Security. Berlin, Germany: Springer, 2004:14-27.
WANG Guilin, BAO Feng, ZHOU Jianying. The Fairness of perfect concurrent signature [C]∥Proceedings of 8th International Conference on Information and Communications Security. Berlin, Germany: Springer, 2006: 435-451.
CHOW S S M, SUSILO W. Generic construction of(identity-based)perfect concurrent signatures [C]∥Proceedings of 7th International Conference on Information and Communications Security. Berlin, Germany: Springer, 2005: 194-206.
NGUYEN K. Asymmetric concurrent signatures[C]∥Proceedings of 7th International Conference on Information and Communications Security. Berlin, Germany: Springer,2005: 181-193.
SUSILO W, Mu Yi. Tripartite concurrent signatures[C]∥Proceedings of 20th IFIP International Information Security Conference on Information Security. Berlin, Germany: Springer,2005: 425-441.
TONIEN D, SUSILO W, SAFAVI-NAINI R. Multi-party concurrent signatures[C]∥Proceedings of 9th International Conference on Information Security. Berlin, Germany: Springer,2006: 131-145.
LI Yunfeng, HE Dake, LU Xianhui. Accountability of perfect concurrent signature [C]∥Proceedings of 2008 International Conference on Computer and Electrical Engineering. Los Alamitos, CA, USA: IEEE Computer Society, 2008: 773-777.
SHIEH C T. Fair multi-party concurrent signatures[D]. Taibei: National Central University, 2008.
HERRANZ J, SAEZ G. Forking lemmas for ring signature schemes [C]∥Proceedings of Progress in Cryptology: Indocrypt'03. Berlin, Germany:Springer,2003: 266-279.