{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T04:00:55Z","timestamp":1775016055699,"version":"3.50.1"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031065156","type":"print"},{"value":"9783031065163","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-06516-3_7","type":"book-chapter","created":{"date-parts":[[2022,5,26]],"date-time":"2022-05-26T13:02:51Z","timestamp":1653570171000},"page":"85-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Transient Random Number Seeds in Permissionless Blockchain Systems"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5412-7512","authenticated-orcid":false,"given":"Riaan","family":"Bezuidenhout","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5579-6411","authenticated-orcid":false,"given":"Wynand","family":"Nel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1556-8523","authenticated-orcid":false,"given":"Jacques","family":"Maritz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,5,25]]},"reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Glaser, F.: Pervasive decentralisation of digital infrastructures: a framework for blockchain-enabled system and use case analysis. In: Proceedings of the 50th Hawaii International Conference on System Sciences (2017)","DOI":"10.24251\/HICSS.2017.186"},{"key":"7_CR2","unstructured":"Binance Capital Mgmt: CoinMarketCap. https:\/\/coinmarketcap.com\/"},{"key":"7_CR3","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/j.joule.2018.04.016","volume":"2","author":"A De Vries","year":"2018","unstructured":"De Vries, A.: Bitcoin\u2019s growing energy problem. Joule. 2, 801\u2013805 (2018). https:\/\/doi.org\/10.1016\/j.joule.2018.04.016","journal-title":"Joule."},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.36615\/jcpmi.v10i1.351","volume":"10","author":"R Bezuidenhout","year":"2020","unstructured":"Bezuidenhout, R., Nel, W., Burger, A.: Nonlinear proof-of-work: improving the energy efficiency of bitcoin mining. J. Constr. Proj. Manag. Innov. 10(1), 20\u201332 (2020). https:\/\/doi.org\/10.36615\/jcpmi.v10i1.351","journal-title":"J. Constr. Proj. Manag. Innov."},{"key":"7_CR5","doi-asserted-by":"crossref","unstructured":"Bentov, I., Gabizon, A., Mizrahi, A.: Cryptocurrencies without proof of work. In: 2016 Financial Cryptography and Data Security Conference (2016)","DOI":"10.1007\/978-3-662-53357-4_10"},{"key":"7_CR6","unstructured":"NEM: Proof-of-importance. https:\/\/nemplatform.com\/wp-content\/uploads\/2020\/05\/NEM_techRef.pdf. Last accessed 12 Nov 2019"},{"key":"7_CR7","unstructured":"BitShares Blockchain Foundation: Delegated Proof-of-Stake Consensus. https:\/\/bitshares.org\/technology\/delegated-proof-of-stake-consensus\/. Last accessed 11 Aug 2019"},{"key":"7_CR8","unstructured":"Hasib, A.: 101 Blockchains. https:\/\/101blockchains.com\/consensus-algorithms-blockchain\/#6. Last accessed 12 Nov 2019"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Milutinovic, M., He, W., Wu, H., Kanwal, M.: Proof of luck: an efficient blockchain consensus protocol. IACR Cryptol. ePrint Arch. 2017 (2016)","DOI":"10.1145\/3007788.3007790"},{"key":"7_CR10","unstructured":"Coinspace.com: Electroneum\u2019s Revolutionary Proof of Responsibility Blockchain is Now Live. https:\/\/coinspace.com\/news\/altcoin-news\/electroneums-revolutionary-proof-responsibility-blockchain-now-live"},{"key":"7_CR11","unstructured":"Tromp, J.: Cuckoo Cycle: A memory bound graph-theoretic proof-of-work. https:\/\/eprint.iacr.org\/2014\/059.pdf. Last accessed 14 Nov 2019"},{"key":"7_CR12","unstructured":"P4Titan: Slimcoin: A peer-to-peer crypto-currency with proof-of-burn (2014)"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Dziembowski, S., Faust, S., Kolmogorov, V., Pietrzak, K.: Proofs of space. In: CRYPTO: International Cryptology Conference (2015). https:\/\/doi.org\/10.1007\/978-3-662-48000-7_29","DOI":"10.1007\/978-3-662-48000-7_29"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Schindler, W.: Random number generators for cryptographic applications. In: Ko\u00e7, \u00c7.K. (ed.) Cryptographic Engineering, pp. 5\u201323. Springer US, Boston, MA (2009). https:\/\/doi.org\/10.1007\/978-0-387-71817-0_2","DOI":"10.1007\/978-0-387-71817-0_2"},{"key":"7_CR15","doi-asserted-by":"publisher","unstructured":"Nguyen Van, T., et al.: Scalable distributed random number generation based on homomorphic encryption. In: 2019 IEEE International Conference on Blockchain, pp. 572\u2013579. Atlanta (2019). https:\/\/doi.org\/10.1109\/Blockchain.2019.00083","DOI":"10.1109\/Blockchain.2019.00083"},{"key":"7_CR16","first-page":"796","volume":"2014","author":"M Andrychowicz","year":"2014","unstructured":"Andrychowicz, M., Dziembowski, S.: Distributed cryptography based on the proofs of work. IACR Cryptol. ePrint Arch. 2014, 796 (2014)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"7_CR17","doi-asserted-by":"publisher","unstructured":"Schoenmakers, B.: A simple publicly verifiable secret sharing scheme and its application to electronic voting. In: Annual International Cryptology Conference, pp. 148\u2013164. Springer (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_10","DOI":"10.1007\/3-540-48405-1_10"},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: SCRAPE: scalable randomness attested by public entities. In: International Conference on Applied Cryptography and Network Security, pp. 537\u2013556 (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"7_CR19","doi-asserted-by":"publisher","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: 2017 IEEE Symposium on Security and Privacy, pp. 444\u2013460 (2017). https:\/\/doi.org\/10.1109\/SP.2017.45","DOI":"10.1109\/SP.2017.45"},{"key":"7_CR20","doi-asserted-by":"publisher","unstructured":"Stinson, D., Strobl, R.: Provably secure distributed schnorr signatures and a (t, n) threshold scheme for implicit certificates. In: Proceedings of the 6th Australasian Conference on Information Security and Privacy, pp. 417\u2013434 (2001). https:\/\/doi.org\/10.1007\/3-540-47719-5_33","DOI":"10.1007\/3-540-47719-5_33"},{"key":"7_CR21","first-page":"319","volume":"2018","author":"P Schindler","year":"2018","unstructured":"Schindler, P., Judmayer, A., Stifter, N., Weippl, E.: HydRand: practical continuous distributed randomness. IACR Cryptol. ePrint Arch. 2018, 319 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"7_CR22","unstructured":"Hanke, T., Movahedi, M., Williams, D.: DFINITY technology overview series, consensus system. ArXiv. abs\/1805.0 (2018)"},{"key":"7_CR23","doi-asserted-by":"publisher","first-page":"514","DOI":"10.1007\/3-540-45682-1_30","volume-title":"Advances in Cryptology \u2013- ASIACRYPT 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. In: Boyd, C. (ed.) Advances in Cryptology \u2013- ASIACRYPT 2001, pp. 514\u2013532. Springer, Berlin Heidelberg, Berlin, Heidelberg (2001)"},{"key":"7_CR24","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. In: Proceedings of the 17th international conference on Theory and application of cryptographic techniques, pp. 925\u2013963 (2005). https:\/\/doi.org\/10.1007\/3-540-48910-X_21","DOI":"10.1007\/3-540-48910-X_21"},{"key":"7_CR25","doi-asserted-by":"publisher","unstructured":"Alturki, M., Ro\u015fu, G.: Statistical model checking of RANDAO\u2019s resilience to pre-computed reveal strategies. In: Goos, G. and Hartmanis, J. (eds.) Formal Methods. FM 2019 International Workshops, pp. 337\u2013349. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-54994-7_25","DOI":"10.1007\/978-3-030-54994-7_25"},{"key":"7_CR26","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Proceedings of the 8th International Conference on Theory and Practice in Public Key Cryptography, pp. 416\u2013431 (1970). https:\/\/doi.org\/10.1007\/978-3-540-30580-4_28","DOI":"10.1007\/978-3-540-30580-4_28"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Boneh, D., Eskandarian, S., Hanzlik, L., Greco, N.: Single secret leader election. In: AFT \u201920: 2nd ACM Conference on Advances in Financial Technologies, pp. 12\u201324 (2020). https:\/\/doi.org\/10.1145\/3419614.3423258","DOI":"10.1145\/3419614.3423258"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Bonehy, D., et al.: Threshold cryptosystems from threshold fully homomorphic encryption. Adv. Cryptol. \u2013 CRYPTO 2018. CRYPTO 2018. Lect. Notes Comput. Sci. 10991 (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_19","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"7_CR29","unstructured":"Microsoft: Cryptographic Services. https:\/\/docs.microsoft.com\/en-us\/dotnet\/standard\/security\/cryptographic-services"},{"key":"7_CR30","doi-asserted-by":"publisher","unstructured":"Paar, C., Petzl, J.: Understanding Cryptography. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-04101-3","DOI":"10.1007\/978-3-642-04101-3"},{"key":"7_CR31","unstructured":"Stark, P.B., Ottoboni, K.: Random Sampling: Practice Makes Imperfect. arXiv.org (2018)"}],"container-title":["Lecture Notes in Computer Science","The Transdisciplinary Reach of Design Science Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-06516-3_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,20]],"date-time":"2024-07-20T17:02:51Z","timestamp":1721494971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06516-3_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031065156","9783031065163"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06516-3_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"25 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DESRIST","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Design Science Research in Information Systems and Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"St. Petersburg, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"1 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"desrist2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.desrist2022.org","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"103","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":"37","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":"0","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":"36% - 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+ Track Chair","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":"3","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)"}}]}}