{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T08:41:43Z","timestamp":1726044103459},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030312763"},{"type":"electronic","value":"9783030312770"}],"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-31277-0_10","type":"book-chapter","created":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:02:53Z","timestamp":1568361773000},"page":"148-165","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["StakeCube: Combining Sharding and Proof-of-Stake to Build Fork-Free Secure Permissionless Distributed Ledgers"],"prefix":"10.1007","author":[{"given":"Antoine","family":"Durand","sequence":"first","affiliation":[]},{"given":"Emmanuelle","family":"Anceaume","sequence":"additional","affiliation":[]},{"given":"Romaric","family":"Ludinard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,14]]},"reference":[{"key":"10_CR1","unstructured":"Abraham, I., Malkhi, D.: The blockchain consensus layer and BFT. Bull. Eur. Assoc. Theor. Comput. Sci. 3(123) (2017)"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Sericola, B., Ludinard, R., Tronel, F.: Modeling and evaluating targeted attacks in large scale dynamic systems. In: International Conference on Dependable Systems and Networks (DSN) (2011)","DOI":"10.1109\/DSN.2011.5958248"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Anceaume, E., Ludinard, R., Ravoaja, A., Brasileiro, F.: PeerCube: a hypercube-based P2P overlay robust against collusion and churn. In: IEEE International Conference on Self-Adaptive and Self-Organizing Systems (SASO) (2008)","DOI":"10.1109\/SASO.2008.44"},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1145\/2185395.2185447","volume":"39","author":"E Anceaume","year":"2012","unstructured":"Anceaume, E., Ludinard, R., Sericola, B.: Performance evaluation of large-scale dynamic systems. ACM SIGMETRICS Perform. Eval. Rev. 39(4), 108\u2013117 (2012)","journal-title":"ACM SIGMETRICS Perform. Eval. Rev."},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"538","DOI":"10.1007\/978-3-319-10879-7_31","volume-title":"Security and Cryptography for Networks","author":"G Ateniese","year":"2014","unstructured":"Ateniese, G., Bonacina, I., Faonio, A., Galesi, N.: Proofs of space: when space is of the essence. In: Abdalla, M., De Prisco, R. (eds.) SCN 2014. LNCS, vol. 8642, pp. 538\u2013557. Springer, Cham (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10879-7_31"},{"key":"10_CR6","unstructured":"Awerbuch, B., Scheideler, C.: Towards scalable and robust overay networks. In: International Workshop on Peer-to-Peer Systems (IPTPS) (2007)"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Badertscher, C., Ga\u017ei, P., Kiayias, A., Russell, A., Zikas, V.: Ouroboros genesis: composable proof-of-stake blockchains with dynamic availability. In: ACM SIGSAC Conference on Computer and Communications Security (CCS) (2018)","DOI":"10.1145\/3243734.3243848"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-319-78375-8_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"B David","year":"2018","unstructured":"David, B., Ga\u017ei, P., Kiayias, A., Russell, A.: Ouroboros praos: an adaptively-secure, semi-synchronous proof-of-stake blockchain. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10821, pp. 66\u201398. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-78375-8_3"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-61204-1_27","volume-title":"Applied Cryptography and Network Security","author":"I Cascudo","year":"2017","unstructured":"Cascudo, I., David, B.: SCRAPE: scalable randomness attested by\u00a0public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) ACNS 2017. LNCS, vol. 10355, pp. 537\u2013556. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27"},{"issue":"2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1145\/358549.358563","volume":"24","author":"D Chaum","year":"1988","unstructured":"Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Commun. ACM 24(2), 84\u201390 (1988)","journal-title":"Commun. ACM"},{"key":"10_CR11","unstructured":"Chen, J., Gorbunov, S., Micali, S., Vlachos, G.: Algorand agreement: Super Fast and Partition Resilient Byzantine Agreement. Technical report (2018). \n                      https:\/\/eprint.iacr.org\/2018\/377"},{"issue":"1","key":"10_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1093\/comjnl\/bxh145","volume":"49","author":"M Correia","year":"2006","unstructured":"Correia, M., Neves, N.F., Ver\u00edssimo, P.: From consensus to atomic broadcast: time-free byzantine-resistant protocols without signatures. Comput. J. 49(1), 82\u201396 (2006)","journal-title":"Comput. J."},{"key":"10_CR13","unstructured":"Daian, P., Pass, R., Shi, E.: Snow White: Provably Secure Proofs of Stake. Cryptology ePrint Archive, Report 2016\/919 (2016). \n                      https:\/\/eprint.iacr.org\/2016\/919"},{"key":"10_CR14","unstructured":"EOS.IO: Technical white paper v2 (2019). \n                      https:\/\/github.com\/EOSIO\/Documentation\/blob\/master\/TechnicalWhitePaper.md\n                      \n                    . Accessed 03 Oct 2019"},{"key":"10_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11561071_71","volume-title":"Algorithms \u2013 ESA 2005","author":"A Fiat","year":"2005","unstructured":"Fiat, A., Saia, J., Young, M.: Making chord robust to byzantine attacks. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 803\u2013814. Springer, Heidelberg (2005). \n                      https:\/\/doi.org\/10.1007\/11561071_71"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Gilad, Y., Hemo, R., Micali, S., Vlachos, G., Zeldovich, N.: Algorand: scaling byzantine agreements for cryptocurrencies. In: Symposium on Operating Systems Principles (SOSP) (2017)","DOI":"10.1145\/3132747.3132757"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/978-1-4612-0865-5_26","volume-title":"Springer Series in Statistics","author":"Wassily Hoeffding","year":"1994","unstructured":"Hoeffding, W.: Probability Inequalities for sums of bounded random variables. In: Fisher, N.I., Sen, P.K. (eds.) The Collected Works of Wassily Hoeffding. Springer Series in Statistics (Perspectives in Statistics). Springer, New York (1994). \n                      https:\/\/doi.org\/10.1007\/978-1-4612-0865-5_26"},{"key":"10_CR18","unstructured":"Intel: Hyperledger Sawtooth description (2019). \n                      https:\/\/sawtooth.hyperledger.org\/docs\/core\/releases\/latest\/architecture\/poet.html\n                      \n                    . Accessed 03 Oct 2019"},{"key":"10_CR19","unstructured":"Kiayias, A., Russell, A., David, B., Oliynykov, R.: Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol. Cryptology ePrint Archive, Report 2016\/889 (2016). \n                      https:\/\/eprint.iacr.org\/2016\/889"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Kokoris-Kogias, E., Jovanovic, P., Gasser, L., Gailly, N., Syta, E., Ford, B.: Omniledger: a secure, scale-out, decentralized ledger via sharding. In: IEEE Symposium on Security and Privacy (SSP) (2018)","DOI":"10.1109\/SP.2018.000-5"},{"key":"10_CR21","unstructured":"Micali, S., Rabin, M.O., Vadhan, S.P.: Verifiable random functions. In: IEEE Symposium on Foundations of Computer Science (1999)"},{"key":"10_CR22","unstructured":"Moran, T., Orlov, I.: Proofs of space-time and rational proofs of storage. In: Cryptology ePrint Archive, Report 2016\/035 (2016)"},{"key":"10_CR23","unstructured":"Nakamoto, S.: Bitcoin: A peer-to-peer electronic cash system (2008). \n                      https:\/\/bitcoin.org\/bitcoin.pdf"},{"issue":"2","key":"10_CR24","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/0022-0000(83)90042-9","volume":"27","author":"MO Rabin","year":"1983","unstructured":"Rabin, M.O.: Transaction protection by beacons. J. Comput. Syst. Sci. 27(2), 256\u2013267 (1983)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Syta, E., et al.: Scalable bias-resistant distributed randomness. In: IEEE Symposium on Security and Privacy (SSP) (2017)","DOI":"10.1109\/SP.2017.45"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31277-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T08:06:08Z","timestamp":1568361968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-31277-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030312763","9783030312770"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31277-0_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":"14 September 2019","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":"Marrakech","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","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":"19 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2019","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":"60","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":"23","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":"4","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":"38% - 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":"2.91","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.68","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)"}}]}}