메뉴 건너뛰기




Volumn 8, Issue 4, 2011, Pages 564-577

Prime: Byzantine replication under attack

Author keywords

Byzantine fault tolerance; distributed systems.; Performance under attack; replicated state machines

Indexed keywords

FAULT TOLERANCE;

EID: 79957623137     PISSN: 15455971     EISSN: None     Source Type: Journal    
DOI: 10.1109/TDSC.2010.70     Document Type: Article
Times cited : (176)

References (40)
  • 2
    • 0022045868 scopus 로고
    • Impossibility of distributed consensus with one faulty process
    • M.J. Fischer, N.A. Lynch, and M.S. Paterson, "Impossibility of Distributed Consensus with One Faulty Process," J. ACM, vol. 32, no. 2, pp. 374-382, 1985.
    • (1985) J. ACM , vol.32 , Issue.2 , pp. 374-382
    • Fischer, M.J.1    Lynch, N.A.2    Paterson, M.S.3
  • 3
    • 0023994903 scopus 로고
    • Consensus in the presence of partial synchrony
    • C. Dwork, N. Lynch, and L. Stockmeyer, "Consensus in the Presence of Partial Synchrony," J. ACM, vol. 35, no. 2, pp. 288-323, 1988.
    • (1988) J. ACM , vol.35 , Issue.2 , pp. 288-323
    • Dwork, C.1    Lynch, N.2    Stockmeyer, L.3
  • 6
    • 0345757358 scopus 로고    scopus 로고
    • Practical byzantine fault tolerance and proactive recovery
    • DOI 10.1145/571637.571640
    • M. Castro and B. Liskov, "Practical Byzantine Fault Tolerance and Proactive Recovery," ACM Trans. Computer Systems, vol. 20, no. 4, pp. 398-461, 2002. (Pubitemid 135702591)
    • (2002) ACM Transactions on Computer Systems , vol.20 , Issue.4 , pp. 398-461
    • Castro, M.1    Liskov, B.2
  • 9
    • 21644446595 scopus 로고    scopus 로고
    • Separating agreement from execution for Byzantine fault tolerant services
    • SOSP'03: Proceedings of the 19th ACM Symposium on Operating Systems Principles
    • J. Yin, J.-P. Martin, A. Venkataramani, L. Alvisi, and M. Dahlin, "Separating Agreement from Execution for Byzantine Fault- Tolerant Services," Proc. 19th ACM Symp. Operating Systems Principles, pp. 253-267, 2003. (Pubitemid 40929701)
    • (2003) Operating Systems Review (ACM) , vol.37 , Issue.5 , pp. 253-267
    • Yin, J.1    Martin, J.-P.2    Venkataramani, A.3    Alvisi, L.4    Dahlin, M.5
  • 17
    • 0025460579 scopus 로고
    • Linearizability: A correctness condition for concurrent objects
    • M.P. Herlihy and J.M. Wing, "Linearizability: A Correctness Condition for Concurrent Objects," ACM Trans. Programming and Languages and Systems, vol. 12, no. 3, pp. 463-492, 1990.
    • (1990) ACM Trans. Programming and Languages and Systems , vol.12 , Issue.3 , pp. 463-492
    • Herlihy, M.P.1    Wing, J.M.2
  • 18
    • 0003785721 scopus 로고    scopus 로고
    • PhD dissertation, Massachusetts Inst. of Technology
    • M. Castro, "Practical Byzantine Fault Tolerance," PhD dissertation, Massachusetts Inst. of Technology, pp. 29-31, 2001.
    • (2001) Practical Byzantine Fault Tolerance , pp. 29-31
    • Castro, M.1
  • 20
    • 0017930809 scopus 로고
    • A method for obtaining digital signatures and public-key cryptosystems
    • DOI 10.1145/359340.359342
    • R.L. Rivest, A. Shamir, and L. Adleman, "A Method for Obtaining Digital Signatures and Public-Key Cryptosystems," Comm. ACM, vol. 21, no. 2, pp. 120-126, 1978. (Pubitemid 8591219)
    • (1978) Communications of the ACM , vol.21 , Issue.2 , pp. 120-126
    • Rivest, R.L.1    Shamir, A.2    Adleman, L.3
  • 21
    • 79957582262 scopus 로고    scopus 로고
    • "The netem Utility," http://www.linuxfoundation.org/ collaborate/workgroups/networking/netem, 2010.
    • (2010) The Netem Utility
  • 22
    • 0017996760 scopus 로고
    • Time, clocks, and the ordering of events in a distributed system
    • DOI 10.1145/359545.359563
    • L. Lamport, "Time, Clocks, and the Ordering of Events in a Distributed System," Comm. ACM, vol. 21, no. 7, pp. 558-565, 1978. (Pubitemid 8615486)
    • (1978) Communications of the ACM , vol.21 , Issue.7 , pp. 558-565
    • Lamport, L.1
  • 23
    • 0025564050 scopus 로고
    • Implementing fault-tolerant services using the state machine approach: A tutorial
    • F.B. Schneider, "Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial," ACM Computing Surveys, vol. 22, no. 4, pp. 299-319, 1990.
    • (1990) ACM Computing Surveys , vol.22 , Issue.4 , pp. 299-319
    • Schneider, F.B.1
  • 31
    • 0032306029 scopus 로고    scopus 로고
    • Byzantine quorum systems
    • D. Malkhi and M. Reiter, "Byzantine Quorum Systems," Distributed Computing, vol. 11, no. 4, pp. 203-213, 1998. (Pubitemid 128489949)
    • (1998) Distributed Computing , vol.11 , Issue.4 , pp. 203-213
    • Malkhi, D.1    Reiter, M.2
  • 36
    • 16244410458 scopus 로고    scopus 로고
    • How to tolerate half less one byzantine nodes in practical distributed systems
    • Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, SRDS 2004
    • M. Correia, N.F. Neves, and P. Veríssimo, "How to Tolerate Half Less One Byzantine Nodes in Practical Distributed Systems," Proc. 23rd IEEE Int'l Symp. Reliable Distributed Systems, pp. 174-183, 2004. (Pubitemid 40449363)
    • (2004) Proceedings of the IEEE Symposium on Reliable Distributed Systems , pp. 174-183
    • Correia, M.1    Neves, N.F.2    Verissimo, P.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.