{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T19:40:27Z","timestamp":1725997227035},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030032319"},{"type":"electronic","value":"9783030032326"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-03232-6_17","type":"book-chapter","created":{"date-parts":[[2018,10,19]],"date-time":"2018-10-19T07:44:48Z","timestamp":1539935088000},"page":"254-268","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Clairvoyant State Machine Replications"],"prefix":"10.1007","author":[{"given":"Rida","family":"Bazzi","sequence":"first","affiliation":[]},{"given":"Maurice","family":"Herlihy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,10,20]]},"reference":[{"issue":"5","key":"17_CR1","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/1095809.1095817","volume":"39","author":"M Abd-El-Malek","year":"2005","unstructured":"Abd-El-Malek, M., Ganger, G.R., Goodson, G.R., Reiter, M.K., Wylie, J.J.: Fault-scalable Byzantine fault-tolerant services. ACM SIGOPS Oper. Syst. Rev. 39(5), 59\u201374 (2005)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1109\/TDSC.2010.70","volume":"8","author":"Y Amir","year":"2011","unstructured":"Amir, Y., Coan, B., Kirsch, J., Lane, J.: Prime: Byzantine replication under attack. IEEE Trans. Dependable Secur. Comput. 8(4), 564\u2013577 (2011)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"issue":"4","key":"17_CR3","doi-asserted-by":"publisher","first-page":"12:1","DOI":"10.1145\/2658994","volume":"32","author":"PL Aublin","year":"2015","unstructured":"Aublin, P.L., Guerraoui, R., Kne\u017eevi\u0107, N., Qu\u00e9ma, V., Vukoli\u0107, M.: The next 700 BFT protocols. ACM Trans. Comput. Syst. 32(4), 12:1\u201312:45 (2015)","journal-title":"ACM Trans. Comput. Syst."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Aublin, P.L., Mokhtar, S.B., Qu\u00e9ma, V.: RBFT: redundant Byzantine fault tolerance. In: Proceedings of the 2013 IEEE 33rd International Conference on Distributed Computing Systems, pp. 297\u2013306 (2013)","DOI":"10.1109\/ICDCS.2013.53"},{"key":"17_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/978-3-540-30186-8_29","volume-title":"Distributed Computing","author":"RA Bazzi","year":"2004","unstructured":"Bazzi, R.A., Ding, Y.: Non-skipping timestamps for Byzantine data storage systems. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 405\u2013419. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30186-8_29"},{"key":"17_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-68697-5_1","volume-title":"Advances in Cryptology \u2014 CRYPTO 1996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Canetti, R., Krawczyk, H.: Keying hash functions for message authentication. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 1\u201315. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68697-5_1"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice (extended abstract): completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Symposium on Principles of Distributed Computing, pp. 27\u201330. ACM (1983)","DOI":"10.1145\/800221.806707"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 183\u2013192. ACM, New York (1994)","DOI":"10.1145\/197917.198088"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-642-11322-2_11","volume-title":"Distributed Computing and Networking","author":"F Borran","year":"2010","unstructured":"Borran, F., Schiper, A.: A leader-free Byzantine consensus algorithm. In: Kant, K., Pemmaraju, S.V., Sivalingam, K.M., Wu, J. (eds.) ICDCN 2010. LNCS, vol. 5935, pp. 67\u201378. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11322-2_11"},{"key":"17_CR10","unstructured":"Cachin, C.: Architecture of the hyperledger blockchain fabric. In: Workshop on Distributed Cryptocurrencies and Consensus Ledgers (2016)"},{"issue":"4","key":"17_CR11","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/571637.571640","volume":"20","author":"M Castro","year":"2002","unstructured":"Castro, M., Liskov, B.: Practical Byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"17_CR12","unstructured":"Clement, A., Wong, E., Alvisi, L., Dahlin, M., Marchetti, M.: Making Byzantine fault tolerant systems tolerate Byzantine faults. In: Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pp. 153\u2013168 (2009)"},{"key":"17_CR13","unstructured":"Cowling, J., Myers, D., Liskov, B., Rodrigues, R., Shrira, L.: HQ replication: a hybrid quorum protocol for byzantine fault tolerance. In: Proceedings of the 7th Symposium on Operating Systems Design and Implementation, pp. 177\u2013190 (2006)"},{"issue":"4","key":"17_CR14","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T ElGamal","year":"1985","unstructured":"ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"17_CR15","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1145\/3149.214121","volume":"32","author":"MJ Fischer","year":"1985","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. J. ACM (JACM) 32(2), 374\u2013382 (1985)","journal-title":"J. ACM (JACM)"},{"issue":"6","key":"17_CR16","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1323293.1294267","volume":"41","author":"Ramakrishna Kotla","year":"2007","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. In: ACM SIGOPS Operating Systems Review, vol. 41, pp. 45\u201358. ACM (2007)","journal-title":"ACM SIGOPS Operating Systems Review"},{"issue":"2","key":"17_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1145\/279227.279229","volume":"16","author":"L Lamport","year":"1998","unstructured":"Lamport, L.: The part-time parliament. ACM Trans. Comput. Syst. 16(2), 133\u2013169 (1998)","journal-title":"ACM Trans. Comput. Syst."},{"key":"17_CR18","unstructured":"Lamport, L.: Generalized consensus and paxos. Technical report, Microsoft, March 2005"},{"key":"17_CR19","unstructured":"Mao, Y., Junqueira, F.P., Marzullo, K.: Mencius: building efficient replicated state machines for WANs. In: Proceedings of the 8th OSDI Conference, pp. 369\u2013384 (2008)"},{"issue":"3","key":"17_CR20","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1109\/TDSC.2006.35","volume":"3","author":"JP Martin","year":"2006","unstructured":"Martin, J.P., Alvisi, L.: Fast Byzantine consensus. IEEE Trans. Dependable Secur. Comput. 3(3), 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secur. Comput."},{"key":"17_CR21","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: ACM CCS, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"key":"17_CR22","doi-asserted-by":"crossref","unstructured":"Milosevic, Z., Biely, M., Schiper, A.: Bounded delay in Byzantine-tolerant state machine replication. In: 2013 IEEE 32nd International Symposium on Reliable Distributed Systems, pp. 61\u201370, September 2013","DOI":"10.1109\/SRDS.2013.15"},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Moraru, I., Andersen, D.G., Kaminsky, M.: There is more consensus in Egalitarian parliaments. In: Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles, pp. 358\u2013372. ACM, New York (2013)","DOI":"10.1145\/2517349.2517350"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Mostefaoui, A., Moumen, H., Raynal, M.: Signature-free asynchronous byzantine consensus with $$t < n\/3$$, $${O}(n^2)$$ messages and $${O}(1)$$ expected time. In: 2014 Proceedings of the 2014 ACM Symposium on Principles of Distributed Computing, pp. 2\u20139. ACM (2014)","DOI":"10.1145\/2611462.2611468"},{"key":"17_CR25","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"17_CR26","unstructured":"NEO: Neo contract whitepaper. http:\/\/docs.neo.org\/en-us\/basic\/neocontract.html . Accessed 6 May 2018"},{"key":"17_CR27","unstructured":"Ongaro, D., Ousterhout, J.: In search of an understandable consensus algorithm. In: Proceedings of the USENIX Annual Technical Conference, pp. 305\u2013320 (2014)"},{"issue":"2","key":"17_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s004460100061","volume":"15","author":"F Pedone","year":"2002","unstructured":"Pedone, F., Schiper, A.: Handling message semantics with generic broadcast protocols. Distrib. Comput. 15(2), 97\u2013107 (2002)","journal-title":"Distrib. Comput."},{"key":"17_CR29","doi-asserted-by":"crossref","unstructured":"Peluso, S., Turcu, A., Palmieri, R., Losa, G., Ravindran, B.: Making fast consensus generally faster. In: 2016 46th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN), pp. 156\u2013167. IEEE (2016)","DOI":"10.1109\/DSN.2016.23"},{"key":"17_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-69084-1_14","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"M Pires","year":"2017","unstructured":"Pires, M., Ravi, S., Rodrigues, R.: Generalized paxos made Byzantine (and less complex). In: Spirakis, P., Tsigas, P. (eds.) SSS 2017. LNCS, vol. 10616, pp. 203\u2013218. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-69084-1_14"},{"issue":"2","key":"17_CR31","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"issue":"4","key":"17_CR32","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1145\/98163.98167","volume":"22","author":"FB Schneider","year":"1990","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. (CSUR) 22(4), 299\u2013319 (1990)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR33","doi-asserted-by":"crossref","unstructured":"Sutra, P., Shapiro, M.: Fast genuine generalized consensus. In: 2011 30th IEEE Symposium on Reliable Distributed Systems (SRDS), pp. 255\u2013264. IEEE (2011)","DOI":"10.1109\/SRDS.2011.38"},{"issue":"3","key":"17_CR34","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1145\/2673577","volume":"47","author":"R Renesse Van","year":"2015","unstructured":"Van Renesse, R., Altinbuken, D.: Paxos made moderately complex. ACM Comput. Surv. (CSUR) 47(3), 42 (2015)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR35","doi-asserted-by":"crossref","unstructured":"Zielinski, P.: Optimistically terminating consensus: all asynchronous consensus protocols in one framework. In: 2006 The Fifth International Symposium on Parallel and Distributed Computing, ISPDC 2006, pp. 24\u201333. IEEE (2006)","DOI":"10.1109\/ISPDC.2006.37"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-03232-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,27]],"date-time":"2019-10-27T03:43:51Z","timestamp":1572147831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-03232-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030032319","9783030032326"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-03232-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 November 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.coord.c.titech.ac.jp\/symp\/sss2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}