{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:31:37Z","timestamp":1743067897349,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030910136"},{"type":"electronic","value":"9783030910143"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-91014-3_2","type":"book-chapter","created":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:03:39Z","timestamp":1638353019000},"page":"19-35","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Byzantine Geoconsensus"],"prefix":"10.1007","author":[{"given":"Joseph","family":"Oglio","sequence":"first","affiliation":[]},{"given":"Kendric","family":"Hood","sequence":"additional","affiliation":[]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Nesterenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"5","key":"2_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."},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Adya, A., et al.: Farsite: federated, available, and reliable storage for an incompletely trusted environment. ACM SIGOPS Oper. Syst. Rev. 36(SI), 1\u201314 (2002)","DOI":"10.1145\/844128.844130"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience. In: Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 183\u2013192 (1994)","DOI":"10.1145\/197917.198088"},{"issue":"1","key":"2_CR4","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1145\/972627.972630","volume":"3","author":"N Bulusu","year":"2004","unstructured":"Bulusu, N., Heidemann, J., Estrin, D., Tran, T.: Self-configuring localization systems: design and experimental evaluation. ACM Trans. Embed. Comput. Syst. (TECS) 3(1), 24\u201360 (2004)","journal-title":"ACM Trans. Embed. Comput. Syst. (TECS)"},{"issue":"4","key":"2_CR5","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. (TOCS) 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"3","key":"2_CR6","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1145\/859716.859718","volume":"21","author":"M Castro","year":"2003","unstructured":"Castro, M., Rodrigues, R., Liskov, B.: Base: using abstraction to improve fault tolerance. ACM Trans. Comput. Syst. (TOCS) 21(3), 236\u2013269 (2003)","journal-title":"ACM Trans. Comput. Syst. (TOCS)"},{"issue":"1\u20133","key":"2_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"BN Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discret. Math. 86(1\u20133), 165\u2013177 (1990)","journal-title":"Discret. Math."},{"issue":"5","key":"2_CR8","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1002\/ett.4460080506","volume":"8","author":"R Cramer","year":"1997","unstructured":"Cramer, R., Gennaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. Eur. Trans. Telecommun. 8(5), 481\u2013490 (1997)","journal-title":"Eur. Trans. Telecommun."},{"key":"2_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-45748-8_24","volume-title":"Peer-to-Peer Systems","author":"JR Douceur","year":"2002","unstructured":"Douceur, J.R.: The Sybil attack. In: Druschel, P., Kaashoek, F., Rowstron, A. (eds.) IPTPS 2002. LNCS, vol. 2429, pp. 251\u2013260. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45748-8_24"},{"issue":"4","key":"2_CR10","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0020-0190(82)90033-3","volume":"14","author":"MJ Fischer","year":"1982","unstructured":"Fischer, M.J., Lynch, N.A.: A lower bound for the time to assure interactive consistency. Inf. Process. Lett. 14(4), 183\u2013186 (1982)","journal-title":"Inf. Process. Lett."},{"issue":"3","key":"2_CR11","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0020-0190(81)90111-3","volume":"12","author":"RJ Fowler","year":"1981","unstructured":"Fowler, R.J., Paterson, M., Tanimoto, S.L.: Optimal packing and covering in the plane are NP-complete. Inf. Process. Lett. 12(3), 133\u2013137 (1981)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BF01187074","volume":"26","author":"V Hadzilacos","year":"1993","unstructured":"Hadzilacos, V., Halpern, J.Y.: Message-optimal protocols for Byzantine agreement. Math. Syst. Theory 26(1), 41\u2013102 (1993)","journal-title":"Math. Syst. Theory"},{"issue":"8","key":"2_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/2.940014","volume":"34","author":"J Hightower","year":"2001","unstructured":"Hightower, J., Borriello, G.: Location systems for ubiquitous computing. Computer 34(8), 57\u201366 (2001)","journal-title":"Computer"},{"issue":"4","key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1989727.1989732","volume":"58","author":"V King","year":"2011","unstructured":"King, V., Saia, J.: Breaking the O(n$$^2$$) bit barrier: scalable Byzantine agreement with an adaptive adversary. J. ACM (JACM) 58(4), 1\u201324 (2011)","journal-title":"J. ACM (JACM)"},{"key":"2_CR15","doi-asserted-by":"crossref","unstructured":"Koo, C.Y.: Broadcast in radio networks tolerating Byzantine adversarial behavior. In: PODC, pp. 275\u2013282 (2004)","DOI":"10.1145\/1011767.1011807"},{"issue":"5","key":"2_CR16","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1145\/384264.379239","volume":"34","author":"J Kubiatowicz","year":"2000","unstructured":"Kubiatowicz, J., et al.: OceanStore: an architecture for global-scale persistent storage. ACM SIGOPS Oper. Syst. Rev. 34(5), 190\u2013201 (2000)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"3","key":"2_CR17","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Lao, L., Dai, X., Xiao, B., Guo, S.: G-PBFT: a location-based and scalable consensus protocol for IoT-blockchain applications. In: IPDPS, pp. 664\u2013673 (2020)","DOI":"10.1109\/IPDPS47924.2020.00074"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"MV Marathe","year":"1995","unstructured":"Marathe, M.V., Breu, H., Hunt, H.B., III., Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25(2), 59\u201368 (1995)","journal-title":"Networks"},{"issue":"3","key":"2_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 Secure Comput. 3(3), 202\u2013215 (2006)","journal-title":"IEEE Trans. Dependable Secure Comput."},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 31\u201342 (2016)","DOI":"10.1145\/2976749.2978399"},{"issue":"12","key":"2_CR22","doi-asserted-by":"publisher","first-page":"2441","DOI":"10.1109\/TMC.2012.225","volume":"12","author":"H Moniz","year":"2012","unstructured":"Moniz, H., Neves, N.F., Correia, M.: Byzantine fault-tolerant consensus in wireless ad hoc networks. IEEE Trans. Mob. Comput. 12(12), 2441\u20132454 (2012)","journal-title":"IEEE Trans. Mob. Comput."},{"key":"2_CR23","unstructured":"Oglio, J., Hood, K., Sharma, G., Nesterenko, M.: Byzantine geoconsensus. Technical report. 2010.02436 [cs.DC], arXiv, October 2020. http:\/\/arxiv.org\/abs\/2010.02436"},{"issue":"2","key":"2_CR24","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. J. ACM 27(2), 228\u2013234 (1980). https:\/\/doi.org\/10.1145\/322186.322188","journal-title":"J. ACM"},{"issue":"3","key":"2_CR25","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1145\/322186.322188","volume":"93","author":"A Pelc","year":"2005","unstructured":"Pelc, A., Peleg, D.: Broadcasting with locally bounded Byzantine faults. Inf. Process. Lett. 93(3), 109\u2013115 (2005). https:\/\/doi.org\/10.1145\/322186.322188","journal-title":"Inf. Process. Lett."},{"key":"2_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/3-540-45449-7_22","volume-title":"Embedded Software","author":"J Rushby","year":"2001","unstructured":"Rushby, J.: Bus architectures for safety-critical embedded systems. In: Henzinger, T.A., Kirsch, C.M. (eds.) EMSOFT 2001. LNCS, vol. 2211, pp. 306\u2013323. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45449-7_22"},{"key":"2_CR27","doi-asserted-by":"crossref","unstructured":"Sousa, J., Bessani, A., Vukolic, M.: A Byzantine fault-tolerant ordering service for the hyperledger fabric blockchain platform. In: DSN, pp. 51\u201358. IEEE (2018)","DOI":"10.1109\/DSN.2018.00018"},{"key":"2_CR28","doi-asserted-by":"crossref","unstructured":"Vaidya, N.H., Tseng, L., Liang, G.: Iterative approximate Byzantine consensus in arbitrary directed graphs. In: PODC, pp. 365\u2013374 (2012)","DOI":"10.21236\/ADA558910"},{"key":"2_CR29","doi-asserted-by":"crossref","unstructured":"Zamani, M., Movahedi, M., Raykova, M.: Rapidchain: scaling blockchain via full sharding. In: CCS, pp. 931\u2013948 (2018)","DOI":"10.1145\/3243734.3243853"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-91014-3_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,1]],"date-time":"2021-12-01T10:04:19Z","timestamp":1638353059000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-91014-3_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030910136","9783030910143"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-91014-3_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"2 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 May 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 May 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"32","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47% - 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 (provided by the conference organizers)"}},{"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 (provided by the conference organizers)"}},{"value":"2,84","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}