scaling byzantine fault tolerant duplication to wide area networks
K.S.SAKUNTHALA PRABHA,N.SANKAR RAM
Published in International Journal of Advanced Research in Computer Science Engineering and Information Technology
ISSN: 2321-3337 Impact Factor:1.521 Volume:4 Issue:2 Year: 07 January,2015 Pages:375-382
Abstract
This paper presents the primary hierarchical Byzantine fault-tolerant replication design appropriate to systems that span multiple wide space sites. The design orbits the effects of any malicious duplicate to its native website, reduces message complexity of wide space communication, and permits read-only queries to be performed regionally among a website for the value of extra common place hardware. We tend to gift proofs that our algorithm provides safety and aliveness properties. A prototype implementation is evaluated over many network topologies and is compared with a flat Byzantine fault-tolerant approach. The experimental results show considerable improvements over flat Byzantine replication algorithms, transferral the performance of Byzantine duplication nearer to existing benign fault-tolerant duplication techniques over large area networks.
Kewords
Byzantine Fault-tolerance, native, wide-space networks
Reference
[1] R. Gennaro, S. Jarecki, H. Krawczyk, and T. Rabin, “Robust threshold DSS Signatures, ” Inf. Comput.,vol. 164, no. 1, pp. 54–84, 2001. [2] Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Cristina Nita-Rotaru, Josh Olsen, and David Zage, “ STEWARD: Scaling Byzantine Fault- Tolerant Replication to Wide Area Networks”, IEEE Transactions on Dependable and Secure Computing, pp- 80 – 93, 2010. [3] R. Jim´enez-Peris, M. Pati˜no-Mart´ınez_. B. Kemme,, G. Alonso “Improving the Scalability of Fault-Tolerant Database Clusters “Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS’02) 1063- 6927/02 $17.00 © 2002 IEEE [4] Lamport, “Paxos made simple,” SIGACTN: SIGACT News (ACM Special Interest Group on Automata and Computability Theory), vol. 32, 2001. [5] M. Castro and B. Liskov, “Practical byzantine fault tolerance and proactive recovery,” ACM Trans.Comput. Syst., vol. 20, no. 4, pp. 398–461, 2002. [6] Y. G. Desmedt and Y. Frankel, “Threshold cryptosystems,” in CRYPTO ’89: Proceedings on Advances in cryptology, (New York, NY, USA), pp. 307–315, Springer-Verlag New York, Inc.,1989. [7] A. Shamir, “How to share a secret,” Commun. ACM, vol. 22, no. 11, pp. 612–613, 1979. [8] V. Shoup, “Practical threshold signatures,” Lecture Notes in Computer Science, vol. 1807, pp. 207–223, 2000. [9] R. L. Rivest, A. Shamir, and L. M. Adleman, “A method for obtaining Digital Signatures and public key cryptosystems,” Communications of the ACM, vol. 21, pp. 120–126, Feb. 1978. [10] Chung-Ho Chen, Arun K. Somani, “Fault-Tolerant Parallel Processing with Real- Time Error Detection and Recovery” 1058-6393'92 $03.00 0 1992 IEEE [11] Nirmala Jagadale “ A Secure Key Issuing Protocol for Peer-to-Peer Network” Int. J. of Recent Trends in Engineering & Technology, Vol. 11, June 2014 [12] Chung-Ho Chen, Arun K. Somani, “Fault-Tolerant Parallel Processing with Real- Time Error Detection and Recovery” 1058-6393'92 $03.00 0 1992 IEEE [13] BRIAN A. COAN A Compiler that Increases the Fault Tolerance of Asynchronous Protocols “IEEE TRANSACTIONS ON COMPUTERS, VOL. 37, NO. 12,DEC 1988 [14 ] Castro and B. Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, New Orleans, USA, February 1999. [15] M. Castro and B. Liskov. Proactive Recovery in a Byzantine-Fault-Tolerant System. In Proceedings of the Fourth Symposium on Operating Systems Design and Implementation, San Diego, CA, October 2000 [16] Y. Amir, B. A. Coan, J. Kirsch, and J. Lane. Prime: Byzantine replication under attack. IEEE Trans. Dep. Sec. Comp., 8(4):564–577, 2011 [17] S. Duan, S. Peisert, and K. Levitt. hBFT: speculative Byzantine fault tolerance with minimum cost. IEEE Trans. Dep. Sec.Comp., 2014. [18] Wenbing Zhao “Application-Aware Byzantine Fault Tolerance” ” 2014 IEEE 12th International Conference on Dependable, Autonomic and Secure Computing [19] H. Chai and W. Zhao, “Byzantine fault tolerance for services with commutative Operations ,” in Proceedings of the IEEE International Conference on Services Computing. Anchorage, Alaska, USA: IEEE, June 27 - July 2 2014. [20] M. Castro and B. Liskov, “ Practical byzantine fault tolerance and proactive Recovery,” ACM Transactions on Computer Systems, vol. 20, no. 4, pp. 398–461, 2002
