期刊文献+

TSS-BQS系统的GracefulDegradation机制 被引量:1

Graceful Degradation in TSS-BQS Systems
下载PDF
导出
摘要 将门限签名方案分别应用于两种类型的BQS系统(Masking BQS系统和Dissemination BQS系统),可以得到两种TSS-BQS系统(文中称为TSS-mBQS系统和TSS-dBQS系统).TSS-mBQS系统的性能优于TSS-dBQS系统.由此,作者提出了TSS-BQS系统的Graceful Degradation机制:系统由n=3fd+1台服务器组成,在初始阶段以TSS-mBQS状态运行,容忍fm=f2d台Byzantine失效服务器;随着系统运行,可能失效的服务器数量增大,则以降低性能为代价,切换到TSS-dBQS状态,容忍fm=■fd/2」台Byzantine失效服务器.在不影响容错能力的前提下,Graceful Degradation机制提高了已有TSS-BQS系统的平均性能.文中完成的Graceful Degradation机制能够在不中断存储服务、不影响客户端的前提下完成状态切换,客户端也不需要知道系统的运行状态(处于TSS-mBQS或TSS-dBQS状态). Abstract By integrating threshold signature schemes with different types of Byzantine quorum systems (i. e. , masking BQS and dissemination BQS in this paper), we can build two TSS-BQS systems, called the TSS-mBQS system and the TSS-dBQS system. The TSS-mBQS system pro- duces better performance than the TSS-dBQS one. Based on this observation, we design graceful degradation in TSS-BQS systems: In the beginning, the system consisting of n=3fa+l servers,runs in the TSS-mBQS state and tolerates up to fm=「fd/2」Byzantine faulty servers~ with the in-creasing number of servers which might be faulty, the system switches to the TSS-dBQS state, and tolerates up to fd Byzantine faulty servers at the cost of performance degradation. Without harming the system's fault-tolerance, the graceful degradation improves its performance on aver- age. Moreover, this graceful degradation doesn't interrupt the storage services of the system, and is transparent to clients who don't need to know the system state (i. e. , the TSS-mBQS or the TSS-dBQS state).
出处 《计算机学报》 EI CSCD 北大核心 2012年第9期1793-1803,共11页 Chinese Journal of Computers
基金 国家自然科学基金(70890084/G021102,61003273,61003274) 中国科学院知识创新工程项目基金(YYYJ-1013) 中国科学院战略性先导专项基金(XDA06010702)资助
关键词 拜占庭容错技术 拜占庭选举系统 优雅降级 门限签名方案 Byzantine fault-tolerance Byzantine quorum system graceful degradation thresholdsignature scheme
  • 相关文献

参考文献22

  • 1Mall-hi D, Reiter M. Byzantine quorum systems. Distributed Computing, 1998, 11(4): 203-213.
  • 2Lamport L, Shostak R, Pease M. The Byzantine generals problem. ACM Transactions on Programming Languages and Systems, 1982, 4(3): 382-401.
  • 3Zhou L, Schneider F, Renesse R. COCA: A secure on-line certification authority. ACM Transactions on Computer Sys terns, 2002, 20(4): 329-368.
  • 4Herlihy H, Wing J. Specifying graceful degradation. IEEE Transactions on Parallel and Distributed Systems, 1991, 2(1): 93-104.
  • 5Marsh M, Schneider F. CODEX: A robust and secure secret distribution system. IEEE Transactions on Dependable and Secure Computing, 2004, 1(1): 34-47.
  • 6荆继武,王晶,林璟锵,谢永泉,顾青.基于门限签名方案的BQS系统的服务器协议[J].软件学报,2010,21(10):2631-2641. 被引量:2
  • 7Lin Jing-Qiang, Liu Peng, Jing Ji-Wu, Wang Qiong-Xiao. Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signa- ture schemes//Proceedings of the 6th International ICST Conference on Security and Privacy in Communication Net works (SecureComm). Singapore, 2010:307 325.
  • 8Desmedt Y. Society and group oriented cryptography: A new concept//Proceedings of the Advances in Cryptology-Crypto' 87. Santa Barbara, USA, 1987:120-127.
  • 9Shoup V. Practical threshold signatures//Proceedings of the Advances in Cryptology EuroCrypt'2000. Bruges, Belgium, 2000.- 207-220.
  • 10Ostrovsky R, Yung M. How to withstand mobile virus attacks//Proceedings of the 10th ACM Symposium on Princi- ples of Distributed Computing (PODC). Montreal, Canada, 1991:51-59.

二级参考文献3

共引文献1

同被引文献9

引证文献1

二级引证文献4

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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