{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:55:21Z","timestamp":1756000521568},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030209506"},{"type":"electronic","value":"9783030209513"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-20951-3_10","type":"book-chapter","created":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:02:48Z","timestamp":1560711768000},"page":"106-110","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Self-stabilizing Byzantine Consensus for Blockchain"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Binun","sequence":"first","affiliation":[]},{"given":"Shlomi","family":"Dolev","sequence":"additional","affiliation":[]},{"given":"Tal","family":"Hadad","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,5,19]]},"reference":[{"key":"10_CR1","doi-asserted-by":"publisher","unstructured":"Androulaki, E., et al.: Hyperledger fabric: a distributed operating system for permissioned blockchains. In: Proceedings of the Thirteenth EuroSys Conference (EuroSys 2018), Article no. 30, 15 p. ACM, New York (2018). \n                    https:\/\/doi.org\/10.1145\/3190508.3190538","DOI":"10.1145\/3190508.3190538"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Amelchenko, M., Dolev, S.: Blockchain abbreviation: implemented by message passing and shared memory (extended abstract). In: NCA, pp. 385\u2013391 (2017)","DOI":"10.1109\/NCA.2017.8171382"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-319-49259-9_4","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"A Binun","year":"2016","unstructured":"Binun, A., et al.: Self-stabilizing Byzantine-tolerant distributed replicated state machine. In: Bonakdarpour, B., Petit, F. (eds.) SSS 2016. LNCS, vol. 10083, pp. 36\u201353. Springer, Cham (2016). \n                    https:\/\/doi.org\/10.1007\/978-3-319-49259-9_4"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Bessani, A., Sousa, J., Alchieri, E.: State machine replication for the masses with BFT-SMaRt. In: The IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2014, Atlanta, USA, June 2014","DOI":"10.1109\/DSN.2014.43"},{"key":"10_CR5","unstructured":"Chen, J., Gorbunov, S., Micali, S., Vlachos, G.: ALGORAND AGREEMENT: super fast and partition resilient Byzantine agreement. IACR Cryptology ePrint Archive 2018, 377 (2018)"},{"key":"10_CR6","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/6156.001.0001","volume-title":"Self-Stabilization","author":"S Dolev","year":"2000","unstructured":"Dolev, S.: Self-Stabilization. MIT Press, Cambridge (2000)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Dolev, S., Eldefrawy, K., Garay, J.A., Kumaramangalam, M.V., Ostrovsky, R., Yung, M.: Brief announcement: secure self-stabilizing computation. In: PODC, pp. 415\u2013417 (2017)","DOI":"10.1145\/3087801.3087864"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-319-94147-9_7","volume-title":"Cyber Security Cryptography and Machine Learning","author":"S Dolev","year":"2018","unstructured":"Dolev, S., Georgiou, C., Marcoullis, I., Schiller, E.M.: Self-stabilizing Byzantine tolerant replicated state machine based on failure detectors. In: Dinur, I., Dolev, S., Lodha, S. (eds.) CSCML 2018. LNCS, vol. 10879, pp. 84\u2013100. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-94147-9_7"},{"issue":"4","key":"10_CR9","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1109\/TC.2006.61","volume":"55","author":"S Dolev","year":"2006","unstructured":"Dolev, S., Haviv, Y.A.: Self-stabilizing microprocessor: analyzing and overcoming soft errors. IEEE Trans. Comput. 55(4), 385\u2013399 (2006)","journal-title":"IEEE Trans. Comput."},{"key":"10_CR10","first-page":"395","volume":"7","author":"R Perlman","year":"1983","unstructured":"Perlman, R.: Fault-tolerant broadcast of routing information. Comput. Netw. 7, 395\u2013405 (1983)","journal-title":"Comput. Netw."},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Rosen, E.: Vulnerabilities of network control protocols: an example, RFC 789, July 1981","DOI":"10.17487\/rfc0789"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Sousa, J., Bessani, A., Vukolic, M.: A Byzantine fault-tolerant ordering service for the hyperledger fabric blockchain platform. In: The IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2018, June 2018","DOI":"10.1109\/DSN.2018.00018"},{"key":"10_CR13","unstructured":"The hyperledger fabric ledger description. \n                    https:\/\/hyperledger-fabric.readthedocs.io\/en\/release-1.4\/ledger\/ledger.html"},{"key":"10_CR14","unstructured":"BFT-SMaRt in hyperledger fabric. \n                    https:\/\/github.com\/bft-smart\/fabric-orderingservice"},{"key":"10_CR15","unstructured":"Hyperledger fabric: a distributed operating system for permissioned blockchains. \n                    https:\/\/arxiv.org\/pdf\/1801.10228v2.pdf"},{"key":"10_CR16","unstructured":"BFT-SMaRt. \n                    https:\/\/github.com\/bft-smart\/library"},{"key":"10_CR17","unstructured":"Tendermint. \n                    https:\/\/github.com\/tendermint\/tendermint"},{"key":"10_CR18","unstructured":"Redbelly. \n                    http:\/\/redbellyblockchain.io\/"},{"key":"10_CR19","unstructured":"Proof of work vs. proof of stake. \n                    https:\/\/medium.com\/@hydrominer\/proof-of-work-vs-proof-of-stake-7b3afe24f0cc"},{"key":"10_CR20","unstructured":"Byzantine fault-tolerant ordering service for hyperledger fabric. \n                    https:\/\/github.com\/bft-smart\/fabric-orderingservice"},{"key":"10_CR21","unstructured":"Compiling the Byzantine fault-tolerant ordering service for hyperledger fabric. \n                    https:\/\/github.com\/bft-smart\/fabric-orderingservice\/wiki\/Compiling"},{"key":"10_CR22","unstructured":"Java reflection. \n                    https:\/\/docs.oracle.com\/javase\/tutorial\/reflect\/member\/fieldValues.html"}],"container-title":["Lecture Notes in Computer Science","Cyber Security Cryptography and Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-20951-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,16]],"date-time":"2019-06-16T19:07:03Z","timestamp":1560712023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-20951-3_10"}},"subtitle":["(Brief Announcement)"],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030209506","9783030209513"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-20951-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"19 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSCML","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Cyber Security Cryptography and Machine Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beer-Sheva","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Israel","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cscml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.bgu.ac.il\/~fradmin\/cscml19\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"18","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"10","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"50% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"n\/a","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}