Abstract
A new multi-signature scheme was proposed with the extension of the direct anonymous attestation (DAA) protocol supported by trusted computing (TC) technology. Analysis and simulation results show that the signer’s privacy is well protected with dynamic anonymity, the public key and signatures have length independent of the number of signature members, new signers are allowed to join the signature without modifying the public key, and attacks caused by secret key dumping or leaking can be avoided.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Harn L. New Digital Signature Scheme Based on Discrete Logarithm[J]. Electronics Letters, 1994, 30(5): 396–398.
Ji Jiahui, Zhao Renjie. Digital Multisignature Schemes Based on the Schnorr Scheme[C]//Proceeding of the CHINACRYPT’96. Beijing: Science Press, 1996: 170–176(Ch).
Lu Langru, Zeng Junjie, Kuang Youhua, et al. A New Multisignature Scheme Based on Discrete Logarithm Problem and Its Distributed Computation[J]. Chinese Journal of Computers, 2002, 25(12): 1717–1720 (Ch).
Han Xiaoxi, Wang Guilin, Bao Feng, et al. An Attack to Multisignature Schemes Based on Discrete Logarithm[J]. Chinese Journal of Computers, 2004, 27(8): 1147–1152 (Ch).
Andreas P. Anonymity, Unobservability and Pseudonymity[EB/OL].[2003-05-27]. http://dud.inf.tu-dresden.de/literatur/Anon_Terminology_v0.14.pdf .
Vaughan-Nichols S J. How Trustworthy is Trusted Computing[J]. Computer, IEEE Computer Society, 2003, 36(3): 18–20.
Trusted Computing Group. TCG TPM Specification 1.2 [EB/OL]. [2003-10-09]. http://www.trustedcomputinggroup.org .
Brickell E, Camenisch J, Chen L. Direct Anonymous Attestation [C]//Proceeding of the 11th ACM Conference on Computer and Communications Security. New York: ACM Press, 2004: 132–145.
Camenisch J, Lysyanskaya A. A Signature Scheme with Efficient Protocols[C]//Proceedings of the 3rd Conference of Security in Communication Networks. Berlin: Springer, 2002: 268–289.
Atenitse G, Clannish J, Joye M, et al. A Practical and Provably Secure Coalition-Resistant Group Signature Scheme[C]//Advances in Cryptology CRYPTO’00. New York: Springer-Verlag, 2000: 255–270.
Scott M. Multiprecision Integer and Rational Arithmetic C/C++ Library[EB/OL].[2006-05-14]. http://indigo.ie/~mscott .
Hao L M, Sun X, Yang S T, et al. A Method to Implement Full Anonymous Attestation for Trusted Computing Platform[J]. Wuhan University Journal of Natural Sciences, 2007, 12(1): 101–104.
Ge H. A Method to Implement Direct Anonymous Attestation [EB/OL]. [2006-01-12]. http://www.iacr.org/2006/023.ps.gz .
Ge H, Tate S R. A Direct Anonymous Attestation Scheme for Embedded Devices[C]//Proceedings of the 10th International Conference on Theory and Practice of Public-Key Cryptography. Berlin: Springer, 2007: 16–30.
Trusted Computing Group. TPM v1.2 Specification Changes [EB/OL]. [2003-10-09]. http://trustedcomputinggroup.org .
Camenisch J. Better Privacy for Trusted Computing Platforms[C]//Proceedings of the 9th European Symposium on Research in Computer Security. Berlin: Springer, 2004: 73–88.
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Supported by the National High Technology Research and Development Program of China(863 Program) (2005AA145110, 2006AA01Z436), the Natural Science Foundation of Shanghai (05ZR14083), and the Pudong New Area Technology Innovation Public Service Platform of China (PDPT2005-04)
Biography: HAO Liming (1982–), male, Ph.D. candidate, research direction: trusted computing and trust management in P2P system.
Rights and permissions
About this article
Cite this article
Hao, L., Yang, S., Lu, S. et al. Efficient and secure multi-signature scheme based on trusted computing. Wuhan Univ. J. Nat. Sci. 13, 180–184 (2008). https://doi.org/10.1007/s11859-008-0210-5
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11859-008-0210-5