{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:22Z","timestamp":1740099262016,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030057633"},{"type":"electronic","value":"9783030057640"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-030-05764-0_7","type":"book-chapter","created":{"date-parts":[[2018,12,6]],"date-time":"2018-12-06T02:03:24Z","timestamp":1544061804000},"page":"66-76","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Crux\u2014A New Fast, Flexible and Decentralized Consensus Algorithm with High Fault Tolerance Rate"],"prefix":"10.1007","author":[{"given":"Pengfei","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingtian","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Long","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qian","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gang","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,7]]},"reference":[{"key":"7_CR1","unstructured":"Delegated proof-of-stake consensus. https:\/\/bitshares.org\/technology\/delegated-proof-of-stake-consensus\/"},{"key":"7_CR2","unstructured":"EOSIO white paper. https:\/\/github.com\/EOSIO\/Documentation\/blob\/master\/TechnicalWhitePapermd"},{"key":"7_CR3","unstructured":"Ethcore. parity: next generation ethereum browser. https:\/\/ethcore.io\/parity.html"},{"key":"7_CR4","unstructured":"Ethereum blockchain app platform. https:\/\/www.ethereum.org"},{"key":"7_CR5","unstructured":"Hyperledger project. https:\/\/www.hyperledger.org\/projects\/fabric"},{"key":"7_CR6","unstructured":"Ripple. https:\/\/ripple.com"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 96","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-68339-9_34"},{"key":"7_CR8","unstructured":"Castro, M., Liskov, B.: Practical byzantine fault tolerance. In: OSDI, pp. 173\u2013186 (1999)"},{"issue":"4","key":"7_CR9","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. 20(4), 398\u2013461 (2002)","journal-title":"ACM Trans. Comput. Syst."},{"key":"7_CR10","unstructured":"Clement, A., Wong, E.L., Alvisi, L., Dahlin, M., Marchetti, M.: Making byzantine fault tolerant systems tolerate byzantine faults. In: NSDI, pp. 153\u2013168 (2009)"},{"key":"7_CR11","series-title":"Dependable Computing and Fault-Tolerant Systems","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-7091-8871-2_6","volume-title":"The Evolution of Fault-Tolerant Computing","author":"AL Hopkins","year":"1987","unstructured":"Hopkins, A.L., Lala, J.H., Smith, T.B.: The evolution of fault tolerant computing at the Charles Stark Draper laboratory, 1955\u201385. In: Avi\u017eienis, A., Kopetz, H., Laprie, J.C. (eds.) The Evolution of Fault-Tolerant Computing. DEPENDABLECOMP, vol. 1, pp. 121\u2013140. Springer, Vienna (1987). https:\/\/doi.org\/10.1007\/978-3-7091-8871-2_6"},{"key":"7_CR12","unstructured":"King, S., Nadal, S.: PPcoin: peer-to-peer crypto-currency with proof-of-stake. Self-published Paper, 19 August 2012"},{"key":"7_CR13","unstructured":"Kogias, E.K., Jovanovic, P., Gailly, N., Khoffi, I., Gasser, L., Ford, B.: Enhancing bitcoin security and performance with strong consistency via collective signing. In: USENIX Security, pp. 279\u2013296 (2016)"},{"issue":"4","key":"7_CR14","doi-asserted-by":"publisher","first-page":"7:1","DOI":"10.1145\/1658357.1658358","volume":"27","author":"R Kotla","year":"2009","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.L.: Zyzzyva: speculative byzantine fault tolerance. ACM Trans. Comput. Syst. 27(4), 7:1\u20137:39 (2009)","journal-title":"ACM Trans. Comput. Syst."},{"issue":"6","key":"7_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1145\/1323293.1294267","volume":"41","author":"R Kotla","year":"2007","unstructured":"Kotla, R., Alvisi, L., Dahlin, M., Clement, A., Wong, E.: Zyzzyva: speculative byzantine fault tolerance. ACM SIGOPS Oper. Syst. Rev. 41(6), 45\u201358 (2007)","journal-title":"ACM SIGOPS Oper. Syst. Rev."},{"issue":"3","key":"7_CR16","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"4","key":"7_CR17","first-page":"18","volume":"32","author":"L Lamport","year":"2001","unstructured":"Lamport, L., et al.: Paxos made simple. ACM SIGACT News 32(4), 18\u201325 (2001)","journal-title":"ACM SIGACT News"},{"key":"7_CR18","unstructured":"Larimer, D.: Delegated proof-of-stake (DPOS). Bitshare whitepaper (2014)"},{"key":"7_CR19","unstructured":"Li, C., Li, P., Xu, W., Long, F., Yao, A.C.: Scaling Nakamoto consensus to thousands of transactions per second. CoRR abs\/1805.03870 (2018)"},{"key":"7_CR20","unstructured":"Liu, S., Viotti, P., Cachin, C., Qu\u00e9ma, V., Vukolic, M.: XFT: practical fault tolerance beyond crashes. In: OSDI, pp. 485\u2013500 (2016)"},{"key":"7_CR21","unstructured":"McConaghy, T., et al.: BigchainDB: a scalable blockchain database. BigchainDB white paper (2016)"},{"key":"7_CR22","unstructured":"Nakamoto, S.: Bitcoin: a peer-to-peer electronic cash system (2008)"},{"key":"7_CR23","unstructured":"Ongaro, D., Ousterhout, J.K.: In search of an understandable consensus algorithm. In: USENIX ATC, pp. 305\u2013319 (2014)"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Paulitsch, M., Morris, J., Hall, B., Driscoll, K., Latronico, E., Koopman, P.: Coverage and the use of cyclic redundancy codes in ultra-dependable systems. In: DSN, pp. 346\u2013355 (2005)","DOI":"10.1109\/DSN.2005.31"},{"key":"7_CR25","doi-asserted-by":"crossref","unstructured":"Rivest, R.L.: The MD5 message-digest algorithm. RFC 1321, pp. 1\u201321 (1992)","DOI":"10.17487\/rfc1321"},{"issue":"2","key":"7_CR26","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1145\/359340.359342","volume":"21","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Shamir, A., Adleman, L.M.: A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21(2), 120\u2013126 (1978)","journal-title":"Commun. ACM"},{"key":"7_CR27","doi-asserted-by":"crossref","unstructured":"Tsudik, G.: Message authentication with one-way hash functions. In: INFOCOM, pp. 2055\u20132059 (1992)","DOI":"10.1109\/INFCOM.1992.263477"},{"key":"7_CR28","unstructured":"Vasin, P.: Blackcoin\u2019s proof-of-stake protocol v2 (2014). https:\/\/blackcoin.co\/blackcoin-pos-protocolv2-whitepaper.pdf"}],"container-title":["Lecture Notes in Computer Science","Smart Blockchain"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05764-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,6]],"date-time":"2019-11-06T16:27:53Z","timestamp":1573057673000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05764-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030057633","9783030057640"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05764-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"SmartBlock","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Smart Blockchain","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tokyo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"smartblock2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"102","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"1","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17% - 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"}},{"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"}},{"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"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}