{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,16]],"date-time":"2026-10-16T17:25:50Z","timestamp":1792171550094,"version":"4.4.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1109\/ipdpsw.2010.5470874","type":"proceedings-article","created":{"date-parts":[[2010,5,28]],"date-time":"2010-05-28T18:25:42Z","timestamp":1275071142000},"page":"1-13","source":"Crossref","is-referenced-by-count":3,"title":["An empirical study of a scalable Byzantine agreement algorithm"],"prefix":"10.1109","author":[{"given":"Olumuyiwa","family":"Oluwasanmi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jared","family":"Saia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valerie","family":"King","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.77"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1323293.1294267"},{"key":"ref12","article-title":"National Institutes of Standards and Technology","year":"2007","journal-title":"Federal information processing standards publication 180–3 secure hash standard"},{"key":"ref13","article-title":"National Institutes of Standards and Technology","year":"2007","journal-title":"Federal information processing standards publication 186–3 Digital signature standard"},{"key":"ref14","first-page":"345","article-title":"Randomness-optimal oblivious sampling","author":"zuckerman","year":"1997","journal-title":"John Wiley & Sons Inc"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2455.214112"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/343477.343531"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_25"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814586"},{"key":"ref8","first-page":"2009","article-title":"From almost everywhere to everywhere: Byzantine agreement with O(n3\/2) bits. In To appear","author":"king","year":"2009","journal-title":"Proceedings of DISC 2009 23rd International Symposium on Distributed Computing Elche\/Elx"},{"key":"ref7","article-title":"Fast asynchronous byzantine agreement and leader election with full information","author":"kapron","year":"2008","journal-title":"ACM Press"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1400751.1400772"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/11945529_20"},{"key":"ref9","first-page":"990","author":"king","year":"2006","journal-title":"ACM Press"}],"event":{"name":"Distributed Processing, Workshops and Phd Forum (IPDPSW)","location":"Atlanta, GA, USA","start":{"date-parts":[[2010,4,19]]},"end":{"date-parts":[[2010,4,23]]}},"container-title":["2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5465895\/5470678\/05470874.pdf?arnumber=5470874","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,19]],"date-time":"2017-03-19T05:22:51Z","timestamp":1489900971000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5470874\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/ipdpsw.2010.5470874","relation":{},"subject":[],"published":{"date-parts":[[2010,4]]}}}