{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T05:33:39Z","timestamp":1729661619684,"version":"3.28.0"},"reference-count":50,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/reldis.2002.1180213","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"374-379","source":"Crossref","is-referenced-by-count":1,"title":["From Byzantine agreement to practical survivability: a position paper"],"prefix":"10.1109","author":[{"given":"D.","family":"Malkhi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/69.842262"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s004460050050"},{"key":"ref33","first-page":"1","article-title":"How to build a highly available system using Consensus","author":"lampson","year":"1996","journal-title":"Proceedings of the Third Inter Workshop on Distributed Algorithms"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref31","first-page":"34","article-title":"Paxos made simple","volume":"32","author":"lamport","year":"2001","journal-title":"Distributed Computing Column of SIGACT News"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"article-title":"Quorum systems. Chapter in The Encyclopedia of Distributed Computing","year":"0","author":"malkhi","key":"ref37"},{"key":"ref36","article-title":"RAMBO; A reconfigurable atomic memory service for dynamic networks","author":"lynch","year":"2002","journal-title":"Proc of the 12th International Symposium on Distributed Computing (DISC)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0020440"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/237090.237157"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/378993.379239"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/HICSS.1998.656294"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/359545.359563"},{"key":"ref2","first-page":"183","article-title":"Efficient state transfer in partitionable environments","author":"amir","year":"1997","journal-title":"Proc European Research Seminar on Advances in Distributed Systems"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00235-7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/291069.291029"},{"key":"ref21","first-page":"330","article-title":"Disk Paxos","author":"gafni","year":"2000","journal-title":"Proc 14th Int l Symp Distributed Computing (DISC 2000)"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/78969.78972"},{"key":"ref23","article-title":"Filesystems for network-attached secure disks","author":"gibson","year":"1997","journal-title":"Technical Report CMU-CS-97–120"},{"key":"ref26","first-page":"45","article-title":"On the cost of fault-tolerant consensus when there are no faults-a tutoriat MIT Technical Report MIT-LCS-TR-821","author":"keidar","year":"2001","journal-title":"Preliminary version in SIGACT News 32(2) Distributed Computing column"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4549-1_3"},{"key":"ref50","article-title":"Publius, A robust, tamper-evident and censorship-resistant web publishing system","author":"waldman","year":"2000","journal-title":"Proceedings of the 9th Usenix Security Symposium"},{"key":"ref10","article-title":"A quorum based approach to CORBA fault-tolerance","author":"chockler","year":"2001","journal-title":"Proceedings of European Research Seminar on Advances in Distributed Systems (ERSADS)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/503112.503113"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/DISCEX.2001.932165"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/571825.571837"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSC.2001.918928"},{"key":"ref14","first-page":"443","article-title":"Randomization in Byzantine agreement","volume":"5","author":"chor","year":"1989","journal-title":"Advances in Computing Research Randomness in Computation"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1998.689463"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00042-6"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/7531.7533"},{"key":"ref18","article-title":"Framework for partitionable operation","author":"dolev","year":"1995","journal-title":"Brief announcement in Proceeding of the 5th ACM Symposium on the Principles of Distributed Computing (PODC 96)"},{"key":"ref19","article-title":"Fail-awareness: An approach to construct fail-safe applications","author":"fetzer","year":"0","journal-title":"Journal of Real-Time Systems"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/41457.37515"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-56188-9_20","article-title":"Membership algorithms for multicast communication groups","author":"amir","year":"1992","journal-title":"Proceedings of the 6th Intl Workshop on Distributed Algorithms (WDAG-6) (LNCS 647)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/4221.214134"},{"key":"ref5","article-title":"Deconstructing Paxos","author":"boichat","year":"2001","journal-title":"Technical Report DSC ID 200106 Communication Systems Department (DSC) Ecole Polytechnic Fédérale de Lausanne (EPFL)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/234533.234549"},{"key":"ref7","article-title":"Practical Byzantine fault tolerance","author":"castro","year":"1999","journal-title":"OSDI'99 Proceedings of the 3rd Symposium on Operating Systems Design and Implementation"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266694"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/226643.226647"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/582318.582339"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/191177.191194"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"article-title":"Crash recovery in a distributed database system","year":"1982","author":"skeen","key":"ref47"},{"key":"ref42","article-title":"Minimal byzantine storage","author":"martin","year":"2002","journal-title":"Proc of the 12th International Symposium on Distributed Computing (DISC)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539797325235"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/227210.227225"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36080-8_5"}],"event":{"name":"21st IEEE Symposium on Reliable Distributed Systems","acronym":"RELDIS-02","location":"Suita, Japan"},"container-title":["21st IEEE Symposium on Reliable Distributed Systems, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8406\/26505\/01180213.pdf?arnumber=1180213","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:46:21Z","timestamp":1497552381000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1180213\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":50,"URL":"https:\/\/doi.org\/10.1109\/reldis.2002.1180213","relation":{},"subject":[]}}