%0 Journal Article
%T Byzantine Fault-Tolerant Erasure Eoded Distributed Storage Protocol<br>拜占庭容错纠删码分布式存储协议
%A CAI Luan-Jia
%A <br>蔡鸾佳
%J 计算机系统应用
%D 2012
%I 
%X Most byzantine fault-tolerant protocol distributed storage protocol use replication,but if the block is very huge,replication requires network width and many spaces, so its efficiency is low. Employing erasure coding makes the data block coded into fragments of the same length, then store the according fragment on corresponding node. This can save spaces and network width. Byzantine fault-tolerant erasure coded distributed storage usually requires much overhead, extra servers and versioned storage for the consistency of the data fragments. The paper optimizes for the common cases, employs novel mechanism and introduces homomorphic fingerprints. The protocol reaches the real overhead, because it requires minimal servers, least extra computation and minimal communication rounds. Furthermore, it can make timestamp no-skipping
%K web information extraction
%K byzantine fault-tolerant
%K erasure code
%K replication
%K homomorphic fingerprints<br>拜占庭容错
%K 纠删码
%K 复制技术
%K 同态指纹
%K 分布式存储
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=D4F6864C950C88FFCE5B6C948A639E39&aid=6490A3A6E5E7C981C304620C24D4833F&yid=99E9153A83D4CB11&vid=659D3B06EBF534A7&iid=0B39A22176CE99FB&sid=10F298ED9F164662&eid=89F76E117E9BDB76&journal_id=1003-3254&journal_name=计算机系统应用&referenced_num=0&reference_num=8