{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T17:52:05Z","timestamp":1776275525717,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NEC Labs Europe"},{"DOI":"10.13039\/501100002341","name":"Academy of Finland","doi-asserted-by":"publisher","award":["#309195"],"award-info":[{"award-number":["#309195"]}],"id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1109\/tc.2018.2860009","type":"journal-article","created":{"date-parts":[[2018,7,25]],"date-time":"2018-07-25T18:55:45Z","timestamp":1532544945000},"page":"139-151","source":"Crossref","is-referenced-by-count":182,"title":["Scalable Byzantine Consensus via Hardware-Assisted Secret Sharing"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6796-6828","authenticated-orcid":false,"given":"Jian","family":"Liu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9036-2392","authenticated-orcid":false,"given":"Wenting","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2828-4071","authenticated-orcid":false,"given":"Ghassan O.","family":"Karame","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5093-9871","authenticated-orcid":false,"given":"N.","family":"Asokan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/HASE.2010.19"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3035918.3056101"},{"key":"ref33","article-title":"LibPaxos","author":"primi","year":"2013"},{"key":"ref32","first-page":"305","article-title":"In search of an understandable consensus algorithm","author":"ongaro","year":"0","journal-title":"Proc USENIX Annu Tech Conf"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978399"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2487726.2488368"},{"key":"ref37","first-page":"526","article-title":"Keeping authorities “honest or bust","author":"syta","year":"0","journal-title":"Proc 37th IEEE Symp Security and Privacy"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/98163.98167"},{"key":"ref35","first-page":"841","article-title":"fTPM: A software-only implementation of a\n TPM chip","author":"raj","year":"0","journal-title":"Proc 25th Usenix Security Symp"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516750"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.221"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/978-3-319-14472-6_7","article-title":"BChain: Byzantine replication with high\n throughput and embedded reconfiguration","author":"duan","year":"2014","journal-title":"Proc Int Conf Principles Distrib Syst"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.38"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978341"},{"key":"ref15","article-title":"GlobalPlatform: Device specifications for trusted execution environment","year":"2017"},{"key":"ref16","article-title":"TPM main, part 1 design principles. specification version 1.2,\n revision 103","author":"group","year":"2007"},{"key":"ref17","article-title":"IBM blockchain","year":"2015"},{"key":"ref18","article-title":"IBM Blockchain, underpinned by highly secure infrastructure, is a game changer","year":"2017"},{"key":"ref19","article-title":"Software guard extensions programming reference","year":"2013"},{"key":"ref28","first-page":"485","article-title":"XFT: Practical fault tolerance beyond crashes","author":"liu","year":"0","journal-title":"Proc 12th USENIX Symp Operating Syst Des Implementation"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/800221.806707"},{"key":"ref27","first-page":"1","article-title":"TrInc: Small trusted hardware for\n large distributed systems","author":"levin","year":"2009","journal-title":"Proc 6th USENIX Symp Netw Syst Des Implementation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3064176.3064213"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1294261.1294280"},{"key":"ref29","article-title":"ROTE: Rollback protection for trusted\n execution","author":"matetic","year":"2017"},{"key":"ref5","first-page":"173","article-title":"Practical Byzantine fault tolerance","author":"castro","year":"0","journal-title":"Proc 3rd Symp Operating Syst Des Implementation"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-004-0110-7"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2518037.2491245"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2658994"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2015.2495213"},{"key":"ref1","first-page":"10:1","article-title":"Innovative technology for CPU based\n attestation and sealing","author":"anati","year":"2013","journal-title":"Proc 2nd Int Workshop Hardware Archit Support Security Privacy"},{"key":"ref20","article-title":"SGX documentation: Sgx create monotonic counter","year":"2016"},{"key":"ref22","first-page":"295","article-title":"CheapBFT:\n Resource-efficient Byzantine fault tolerance","author":"kapitza","year":"0","journal-title":"Proc 7th ACM Eur Conf Comput Syst"},{"key":"ref21","article-title":"Intel SGX and side-channels","author":"johnson","year":"2017"},{"key":"ref42","article-title":"The quest for scalable blockchain fabric: Proof-of-Work vs. BFT\n replication","author":"vukoli?","year":"0","journal-title":"Proc Int Workshop Open Problems Netw Security"},{"key":"ref24","article-title":"Zyzzyva: Speculative Byzantine fault tolerance","volume":"27","author":"kotla","year":"2010","journal-title":"ACM Trans Comput Syst"},{"key":"ref41","article-title":"Stress test prepares VisaNet for the most wonderful time of the year","year":"2015"},{"key":"ref23","first-page":"279","article-title":"Enhancing Bitcoin security and performance with strong consistency via collective signing","author":"kogias","year":"0","journal-title":"Proc 25th Usenix Security Symp"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/8572815\/08419336.pdf?arnumber=8419336","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:48:53Z","timestamp":1657745333000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8419336\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":42,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tc.2018.2860009","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}