Abstract
Lack of efficiency in the initial key generation process is a serious shortcoming of Merkle tree signature scheme with a large number of possible signatures. Based on two kinds of Merkle trees, a new tree type signature scheme is constructed, and it is provably existentially unforgeable under adaptive chosen message attack. By decentralizing the initial key generation process of the original scheme within the signature process, a large Merkle tree with 6. 87×1010 possible signatures can be initialized in 590 milliseconds. Storing some small Merkle trees in hard disk and memory can speed up Merkle tree signature scheme. Mekle tree signature schemes are fit for trusted computing platform in most scenarios.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Merkle R.Secrecy. Authentication, and Public Key Systems [M].Ann Arbor:UMI Research Press, 1982.
Merkle R. A Digital Signature Based on a Conventional Encryption Function[C] //Proc. CRYPTO87, Lecture Notes in Computer Science 293. Berlin: Springer-Verlag, 1988: 369–378.
Williams D, Sirer E G. Optimal Parameter Selection for Efficient Memory Integrity Verification Using Merkle Hash Trees [C]//Proceedings of the Third IEEE International Symposium on Network Computing and Applications. Los Alamitos: IEEE Computer Society, 2004:383–388.
Naor D, Shenhavy A, Woolz A. One-Time Signatures Revisited: Have They Become Practical[EB/OL]. [2005-11-02].http://eprint.iacr.org/2005/442.pdf.
Trusted Computing Group. TCG Specification Architecture Overview, Revisionl. 2 [EB/OL]. [2005-11-02].https://www.trustedcomputinggroup. org/groups/TCG_1_0_Architecture_Overview.pdf.
Bicakci K, Tsudik G, Tung B. How to Construct Optimal One-Time Signatures[J].Computer Networks (Elsevier), 2003,43(3):339–349.
Bleichenbacher D, Maurer U M. Optimal Tree-Based One Time Digital Signature Schemes [C]//STACS'96 Lecture Notes in Computer Science 1046. Berlin: Springer-Verlag, 1996:363–374.
Jakobsson M, Leighton T, Micali S,et al. Fractal Merkle Tree Representation and Traversal [C]//Proceedings of RSA-CT'03, Lecture Notes in Computer Science 2612. Berlin: Springer-Verlag, 2003: 314–326.
Boneh D, Mironov I, Shoup V. A Secure Signature Scheme from Bilinear Maps[C] //Proceedings of RSA-CT'03, Lecture Notes in Computer Science 2612. Berlin: Springer-Verlag, 2003:98–110.
Goldwasser S, Micali S, Rivest R. A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks [J].Siam Journal on Computing, 1988,17(2):281–308.
Coluccio D. Implementation of a Hash-Based Digital Signature Scheme Using Fractal Merkle Tree Representation [EB/OL]. [2005-11-06].http://csl.cs.nyu.edu/~dfc218/hashsig.html.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National Natural Science Foundation of China (60403027)
Biography: WANG Xiaofei (1957-), male, Ph. D. candidate, research direction: information security, cryptographic algorithm.
Rights and permissions
About this article
Cite this article
Xiaofei, W., Fan, H., Xueming, T. et al. Merkle tree digital signature and trusted computing platform. Wuhan Univ. J. Nat. Sci. 11, 1467–1472 (2006). https://doi.org/10.1007/BF02831799
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02831799