{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:01:51Z","timestamp":1725566511940},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540233060"},{"type":"electronic","value":"9783540301868"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30186-8_32","type":"book-chapter","created":{"date-parts":[[2010,9,22]],"date-time":"2010-09-22T19:48:23Z","timestamp":1285184903000},"page":"450-464","source":"Crossref","is-referenced-by-count":2,"title":["On Byzantine Agreement over (2,3)-Uniform Hypergraphs"],"prefix":"10.1007","author":[{"given":"D. V. S.","family":"Ravikant","sequence":"first","affiliation":[]},{"given":"V.","family":"Muthuramakrishnan","sequence":"additional","affiliation":[]},{"given":"V.","family":"Srikanth","sequence":"additional","affiliation":[]},{"given":"K.","family":"Srinathan","sequence":"additional","affiliation":[]},{"given":"C. Pandu","family":"Rangan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Amitanand, S., Sanketh, I., Srinathan, K., Vinod, V., Pandu Rangan, C.: Distributed consensus in the presence of sectional faults. In: 22nd ACM PODC, July 2003, pp. 202\u2013210 (2003)","DOI":"10.1145\/872035.872065"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/BFb0035753","volume-title":"Automata, Languages and Programming","author":"P. Berman","year":"1989","unstructured":"Berman, P., Garay, J.A.: Asymptotically optimal distributed consensus. In: Ronchi Della Rocca, S., Ausiello, G., Dezani-Ciancaglini, M. (eds.) ICALP 1989. LNCS, vol.\u00a0372, pp. 80\u201394. Springer, Heidelberg (1989)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Berman, P., Garay, J.A., Perry, K.J.: Towards optimal distributed consensus. In: 21st IEEE FOCS, pp. 410\u2013415 (1989)","DOI":"10.1109\/SFCS.1989.63511"},{"issue":"1","key":"32_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/0196-6774(82)90004-9","volume":"3","author":"D. Dolev","year":"1982","unstructured":"Dolev, D.: The byzantine generals strike again. Jl. of Algorithms\u00a03(1), 14\u201330 (1982)","journal-title":"Jl. of Algorithms"},{"issue":"1","key":"32_CR5","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1145\/138027.138036","volume":"40","author":"D. Dolev","year":"1993","unstructured":"Dolev, D., Dwork, C., Waarts, O., Yung, M.: Perfectly secure message transmission. JACM\u00a040(1), 17\u201347 (1993)","journal-title":"JACM"},{"key":"32_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/BFb0056479","volume-title":"Distributed Computing","author":"M. Fitzi","year":"1998","unstructured":"Fitzi, M., Maurer, U.: Efficient byzantine agreement secure against general adversaries. In: Kutten, S. (ed.) DISC 1998. LNCS, vol.\u00a01499, pp. 134\u2013148. Springer, Heidelberg (1998)"},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Fitzi, M., Maurer, U.: From partial consistency to global broadcast. In: 32nd ACM STOC, pp. 494\u2013503 (2000)","DOI":"10.1145\/335305.335363"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Hirt, M., Maurer, U.: Complete characterization of adversaries tolerable in secure multiparty computation. In: 16th ACM PODC, pp. 25\u201334 (1997)","DOI":"10.1145\/259380.259412"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Ashwin Kumar, M.V.N., Goundan, P.R., Srinathan, K., Pandu Rangan, C.: On perfectly secure communication over arbitrary networks. In: 21st ACM PODC, pp. 193\u2013202 (2002)","DOI":"10.1145\/571855.571858"},{"volume-title":"Distributed Algorithms","year":"1997","author":"N. Lynch","key":"32_CR10","unstructured":"Lynch, N.: Distributed Algorithms. Morgan Kaufmann, San Francisco (1997)"},{"key":"32_CR11","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of ACM\u00a027, 228\u2013234 (1980)","journal-title":"Journal of ACM"},{"issue":"3","key":"32_CR12","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"M. Pease","year":"1982","unstructured":"Pease, M., Shostak, R., Lamport, L.: The byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"32_CR13","doi-asserted-by":"crossref","unstructured":"Ravikant, D.V.S., Muthuramakrishnan, V., Srikanth, V., Srinathan, K., Pandu Rangan, C.: Brief Announcement: On the round complexity of distributed consensus over synchronous networks. In: 23rd ACM PODC (2004) (to appear)","DOI":"10.1145\/1011767.1011862"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30186-8_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:46:19Z","timestamp":1605761179000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30186-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540233060","9783540301868"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30186-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}