期刊文献+

Study on Security Enhancement Technology for Disaster Tolerant System

Study on Security Enhancement Technology for Disaster Tolerant System
原文传递
导出
摘要 This paper proposes a security enhancement scheme for disaster tolerant systems based on trusted computing technology which combines with the idea of distributed threshold storage. This scheme takes advantage of a trusted computing platform with a trusted computing module, which has excellent features such as security storage, remote attestation, and so on. These features effectively ensure trustworthiness of the disaster tolerant point. Furthermore, distributed storage based on Erasure code not only disposes the storage problem about a great deal of data, but also preferably avoids one node invalidation, alleviates network load and deals with joint cheat and many other security problems. Consequently, those security enhancement technologies provide mass data with global security protection during the course of disaster tolerance. This paper proposes a security enhancement scheme for disaster tolerant systems based on trusted computing technology which combines with the idea of distributed threshold storage. This scheme takes advantage of a trusted computing platform with a trusted computing module, which has excellent features such as security storage, remote attestation, and so on. These features effectively ensure trustworthiness of the disaster tolerant point. Furthermore, distributed storage based on Erasure code not only disposes the storage problem about a great deal of data, but also preferably avoids one node invalidation, alleviates network load and deals with joint cheat and many other security problems. Consequently, those security enhancement technologies provide mass data with global security protection during the course of disaster tolerance.
出处 《Wuhan University Journal of Natural Sciences》 CAS 2009年第1期19-23,共5页 武汉大学学报(自然科学英文版)
基金 Supported by the National High Technology Research and Development Program of China (863 Program) (2008AA01Z404) the Science and Technical Key Project of Ministry of Education (108087) the Scientific and Technological Project of Wuhan City (200810321130)
关键词 trusted computing threshold storage security enhancement Erasure code trusted computing threshold storage security enhancement Erasure code
  • 相关文献

参考文献2

二级参考文献18

  • 1[1]J.W. Byers, M. Luby, M. Mitzenmacher, A. Rege, A digital fountain approach to reliable distribution of bulk data, available at http://www.icsi.berkeley. edu/~luby/, 1998.
  • 2[2]M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, V. Stemann, Practical loss-resilientcodes, available at http://www.icsi.berkeley. edu/~luby/, 1998.
  • 3[3]P. Elias, Coding for two noisy channels, Information Theory, Third London Symposium, 1955,61-67.
  • 4[4]L. Rizzo, Effective erasure codes for reliable computer communication protocols, ACM ComputerCommunication, Review, 1997, 27(2), 24-36.
  • 5[5]L. Rizzo, On the feasibility of software FEC, available as http://www.iet.unipi.it/‘luigi/softfec.ps.
  • 6[6]J. Blomer, M. Mitzenmacher, A. Shokrollahi, An XOR-based erasure-resilient coding scheme,ICSI Technical Report, No.TR-95048[R], August 1995, Available at http://www.icsi.berkeley.edu/~luby/.
  • 7[7]F.J. MacWilliams, N. J. A. Sloane, The Theory of Error-Correcting Codes, North Holland,Amsterdam, 1977, Chapter 11.
  • 8[8]M. Luby, M. Mitzenmacher, A. Shokrollahi, D. Spielman, Improved low-density parity-checkcodes using irregular graphs and belief propagation, In Proc. of IEEE International Symposiumon Information Theory (ISIT), Cambridge, MA, 1998, 16-21.
  • 9[9]M. Luby, M. Mitzenmacher, M. A. Shokrollahi, D. Spielman, Analysis of random processes viaAnd-Or tree evaluation, In Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, 1998, 364-373.
  • 10[10]D.J.C. MacKay, S. T. Wilson, M. C. Davey, Comparison of constructions of irregular Gallagercodes, IEEE Trans. on Communications, 1998, COM-47(10), 1449-1454.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部