{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:45:01Z","timestamp":1742939101482,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031252006"},{"type":"electronic","value":"9783031252013"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-25201-3_18","type":"book-chapter","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:02:04Z","timestamp":1676008924000},"page":"232-246","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["LAP-BFT: Lightweight Asynchronous Provable Byzantine Fault-Tolerant Consensus Mechanism for UAV Network Trusted Systems"],"prefix":"10.1007","author":[{"given":"Lingjun","family":"Kong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bing","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Feng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,2,10]]},"reference":[{"key":"18_CR1","unstructured":"Alhaddad, N., Duan, S., Varia, M., Zhang, H.: Practical and improved Byzantine reliable broadcast and asynchronous verifiable information dispersal from hash functions. IACR Cryptolology ePrint Archive, p. 171 (2022). https:\/\/eprint.iacr.org\/2022\/171"},{"key":"18_CR2","doi-asserted-by":"publisher","unstructured":"Ben-Or, M., Kelmer, B., Rabin, T.: Asynchronous secure computations with optimal resilience (extended abstract). In: Anderson, J.H., Peleg, D., Borowsky, E. (eds.) Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, California, USA, August 14\u201317, 1994. pp. 183\u2013192. ACM (1994). https:\/\/doi.org\/10.1145\/197917.198088","DOI":"10.1145\/197917.198088"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/11561927_42","volume-title":"Distributed Computing","author":"C Cachin","year":"2005","unstructured":"Cachin, C., Tessaro, S.: Asynchronous verifiable information dispersal. In: Fraigniaud, P. (ed.) DISC 2005. LNCS, vol. 3724, pp. 503\u2013504. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11561927_42"},{"key":"18_CR4","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: Seltzer, M.I., Leach, P.J. (eds.) Proceedings of the Third USENIX Symposium on Operating Systems Design and Implementation (OSDI), New Orleans, Louisiana, USA, 22\u201325 February 1999, pp. 173\u2013186. USENIX Association (1999), https:\/\/dl.acm.org\/citation.cfm?id=296824"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Guo, B., Lu, Z., Tang, Q., Xu, J., Zhang, Z.: Dumbo: faster asynchronous BFT protocols. IACR Cryptology ePrint Archive, p. 841 (2020). https:\/\/eprint.iacr.org\/2020\/841","DOI":"10.1145\/3372297.3417262"},{"key":"18_CR6","doi-asserted-by":"publisher","unstructured":"Kashyap, R., Arora, K., Sharma, M., Aazam, A.: Security-aware GA based practical Byzantine fault tolerance for permissioned blockchain. In: 4th International Conference on Control, Robotics and Cybernetics, CRC 2019, Tokyo, Japan, 27\u201330 September 2019, pp. 162\u2013168. IEEE (2019). https:\/\/doi.org\/10.1109\/CRC.2019.00041","DOI":"10.1109\/CRC.2019.00041"},{"issue":"6","key":"18_CR7","doi-asserted-by":"publisher","first-page":"3765","DOI":"10.1109\/TITS.2020.3035869","volume":"22","author":"B Li","year":"2021","unstructured":"Li, B., Liang, R., Zhu, D.: Blockchain-based trust management model for location privacy preserving in VANET. IEEE Trans. Intell. Transp. Syst. 22(6), 3765\u20133775 (2021)","journal-title":"IEEE Trans. Intell. Transp. Syst."},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Lu, Y., Lu, Z., Tang, Q., Wang, G.: Dumbo-MVBA: optimal multi-valued validated asynchronous Byzantine agreement, revisited. IACR Cryptology ePrint Archive, p. 842 (2020). https:\/\/eprint.iacr.org\/2020\/842","DOI":"10.1145\/3382734.3405707"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Miller, A., Xia, Y., Croman, K., Shi, E., Song, D.: The honey badger of BFT protocols. IACR Cryptology ePrint Archive, p. 199 (2016). https:\/\/eprint.iacr.org\/2016\/199","DOI":"10.1145\/2976749.2978399"},{"key":"18_CR10","doi-asserted-by":"publisher","unstructured":"Rabin, M.O.: Efficient dispersal of information for security, load balancing, and fault tolerance. J. ACM 36(2), 335\u2013348 (1989). https:\/\/doi.org\/10.1145\/62044.62050","DOI":"10.1145\/62044.62050"},{"key":"18_CR11","doi-asserted-by":"publisher","unstructured":"Xu, X., Zhu, D., Yang, X., Wang, S., Qi, L., Dou, W.: Concurrent practical Byzantine fault tolerance for integration of blockchain and supply chain. ACM Trans. Internet Tech. 21(1), 7:1\u20137:17 (2021). https:\/\/doi.org\/10.1145\/3395331","DOI":"10.1145\/3395331"},{"key":"18_CR12","doi-asserted-by":"publisher","unstructured":"Zhang, Z., Zhu, D., Fan, W.: QPBFT: practical byzantine fault tolerance consensus algorithm based on quantified-role. In: Wang, G., Ko, R.K.L., Bhuiyan, M.Z.A., Pan, Y. (eds.) 19th IEEE International Conference on Trust, Security and Privacy in Computing and Communications, TrustCom 2020, Guangzhou, China, 29 December 2020\u20131 January 2021, pp. 991\u2013997. IEEE (2020). https:\/\/doi.org\/10.1109\/TrustCom50675.2020.00132","DOI":"10.1109\/TrustCom50675.2020.00132"}],"container-title":["Lecture Notes in Computer Science","Web and Big Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-25201-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T06:19:27Z","timestamp":1676009967000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-25201-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031252006","9783031252013"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-25201-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 February 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"APWeb-WAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Asia-Pacific Web (APWeb) and Web-Age Information Management (WAIM) Joint International Conference on Web and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nanjing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 August 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"apwebwaim2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/apweb-waim2022.com\/proceedings","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"297","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":"75","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":"45","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":"25% - 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":"5","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5 Demo papers + 23 workshop papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}