{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T09:26:50Z","timestamp":1742981210851,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031534034"},{"type":"electronic","value":"9783031534041"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53404-1_14","type":"book-chapter","created":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T01:05:44Z","timestamp":1710205544000},"page":"160-171","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Quantitative Analysis on\u00a0Coin Flipping Protocol"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0803-8620","authenticated-orcid":false,"given":"Xu","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"HaoJie","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,9]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Bhattacharjee, K., Paul, D., Das, S.: Pseudo-random number generation using a 3-state cellular automaton. Int. J. Mod. Phys. C 28(6) (2017)","DOI":"10.1142\/S0129183117500784"},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"Sibidanov, A.: A revision of the subtract-with-borrow random number generators. Comput. Phys. Commun., 221 (2017)","DOI":"10.1016\/j.cpc.2017.09.005"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Janson, S., Knuth, D.E.: Shellsort with three increments. Random Structures & Algorithms 10(1), 125\u2013142 (2015)","DOI":"10.1002\/(SICI)1098-2418(199701\/03)10:1\/2<125::AID-RSA6>3.0.CO;2-X"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1016\/j.tcs.2005.08.005","volume":"346","author":"J Hurd","year":"2005","unstructured":"Hurd, J., Mciver, A., Morgan, C.: Probabilistic guarded commands mechanized in HOL. Theor. Comput. Sci. 346, 96\u2013112 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/978-3-642-22110-1_47","volume-title":"Computer Aided Verification","author":"M Kwiatkowska","year":"2011","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: PRISM 4.0: verification of probabilistic real-time systems. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 585\u2013591. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_47"},{"key":"14_CR6","first-page":"32","volume":"4","author":"J Wang","year":"2022","unstructured":"Wang, J., et al.: Statistical model checking for stochastic and hybrid autonomous driving based on spatio-clock constraints. Int. J. Software Eng. Knowl. Eng. 4, 32 (2022)","journal-title":"Int. J. Software Eng. Knowl. Eng."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Baier, C., et al.: Model Checking Probabilistic Systems. Handbook of Model Checking (2018)","DOI":"10.1007\/978-3-319-10575-8_28"},{"key":"14_CR8","first-page":"509","volume":"4","author":"V Rybakov","year":"2018","unstructured":"Rybakov, V.: Multi-modal and temporal logics with universal formula-reduction of admissibility to validity and unification. J. Logic Comput. 4, 509\u2013519 (2018)","journal-title":"J. Logic Comput."},{"issue":"3","key":"14_CR9","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. J. Cryptol. 29(3), 491\u2013513 (2016)","journal-title":"J. Cryptol."},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Khorasgani, H.A., Maji, H.K., Wang, M.: Optimally-secure Coin-tossing against a Byzantine Adversary. In: IEEE International Symposium on Information Theory IEEE (2021)","DOI":"10.1109\/ISIT45174.2021.9518276"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Li, L., Shi, R.H.: A feasible and practically secure quantum bit commitment protocol. Modern Phys. Lett. A (2021)","DOI":"10.1142\/S0217732321502473"},{"key":"14_CR12","unstructured":"Piribauer, J., Sankur, O., Baier, C.: The variance-penalized stochastic shortest path problem (2022)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Wang, Y., et al.: Statistical model checking for hyperproperties. In: 2021 IEEE 34th Computer Security Foundations Symposium (CSF) IEEE (2021)","DOI":"10.1109\/CSF51468.2021.00009"},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s00145-015-9199-z","volume":"29","author":"T Moran","year":"2016","unstructured":"Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. J. Cryptol. 29(3), 491\u2013513 (2016)","journal-title":"J. Cryptol."},{"issue":"5","key":"14_CR15","doi-asserted-by":"publisher","first-page":"1647","DOI":"10.1137\/15M1010853","volume":"46","author":"A Chailloux","year":"2017","unstructured":"Chailloux, A., Kerenidis, I.: Physical limitations of quantum cryptographic primitives or optimal bounds for quantum coin flipping and bit commitment. SIAM J. Comput. 46(5), 1647\u20131677 (2017)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00145-013-9168-3","volume":"28","author":"A Beimel","year":"2015","unstructured":"Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with a dishonest majority. J. Cryptol. 28(3), 551\u2013600 (2015)","journal-title":"J. Cryptol."}],"container-title":["Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","6GN for Future Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53404-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T01:10:29Z","timestamp":1710205829000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53404-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031534034","9783031534041"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53404-1_14","relation":{},"ISSN":["1867-8211","1867-822X"],"issn-type":[{"type":"print","value":"1867-8211"},{"type":"electronic","value":"1867-822X"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"9 March 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"6GN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on 6GN for Future Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Shanghai","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":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 October 2023","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":"gwn2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/5gwn.eai-conferences.org\/2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}