{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T16:04:42Z","timestamp":1750694682584,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291633"},{"type":"electronic","value":"9783540320753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561927_22","type":"book-chapter","created":{"date-parts":[[2005,10,10]],"date-time":"2005-10-10T14:14:47Z","timestamp":1128953687000},"page":"288-302","source":"Crossref","is-referenced-by-count":10,"title":["Distributed Computing with Imperfect Randomness"],"prefix":"10.1007","author":[{"given":"Shafi","family":"Goldwasser","sequence":"first","affiliation":[]},{"given":"Madhu","family":"Sudan","sequence":"additional","affiliation":[]},{"given":"Vinod","family":"Vaikuntanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Barak, B., Impagliazzo, R., Wigderson, A.: Extracting randomness using few independent sources. In: FOCS, pp. 384\u2013393 (2004)","DOI":"10.1109\/FOCS.2004.29"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols (extended abstract). In: PODC, pp. 27\u201330 (1983)","DOI":"10.1145\/800221.806707"},{"key":"22_CR3","unstructured":"Ben-Or, M., Pavlov, E.: Byzantine agreement in the full-information non-adaptive model (unpublished manuscript)"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Bracha, G.: An asynchronous [(n-1)\/3]-resilient consensus protocol. In: PODC, pp. 154\u2013162 (1984)","DOI":"10.1145\/800222.806743"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Canetti, R., Rabin, T.: Fast asynchronous byzantine agreement with optimal resilience. In: STOC, pp. 42\u201351 (1993)","DOI":"10.1145\/167088.167105"},{"issue":"6","key":"22_CR6","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1109\/TSE.1985.232245","volume":"11","author":"B. Chor","year":"1985","unstructured":"Chor, B., Coan, B.A.: A simple and efficient randomized byzantine agreement algorithm. IEEE Trans. Software Eng.\u00a011(6), 531\u2013539 (1985)","journal-title":"IEEE Trans. Software Eng."},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O.: Unbiased bits from sources of weak randomness and probabilistic communication complexity. In: FOCS, pp. 429\u2013442 (1985)","DOI":"10.1109\/SFCS.1985.62"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1007\/978-3-540-45198-3_22","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"2003","unstructured":"Dodis, Y., Oliveira, R.: On extracting private randomness over a public channel. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol.\u00a02764, pp. 252\u2013263. Springer, Heidelberg (2003)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Ong, S.J., Manoj, P., Sahai, A.: On the (im)possibility of cryptography with imperfect randomness. In: FOCS, pp. 196\u2013205 (2004)","DOI":"10.1109\/FOCS.2004.44"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Spencer, J.: On the (non)universality of the one-time pad. In: FOCS, p. 376 (2002)","DOI":"10.1109\/SFCS.2002.1181962"},{"issue":"3","key":"22_CR11","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1137\/0219032","volume":"19","author":"C. Dwork","year":"1990","unstructured":"Dwork, C., Shmoys, D.B., Stockmeyer, L.J.: Flipping persuasively in constant time. SIAM J. Comput.\u00a019(3), 472\u2013499 (1990)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"22_CR12","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1214\/aoms\/1177692552","volume":"43","author":"P. Elias","year":"1972","unstructured":"Elias, P.: The efficient construction of an unbiased random sequence. Ann. Math. Statist.\u00a043(3), 865\u2013870 (1972)","journal-title":"Ann. Math. Statist."},{"key":"22_CR13","unstructured":"Feldman, P.: Asynchronous byzantine agreement in expected constant number of rounds (unpublished manuscript)"},{"issue":"4","key":"22_CR14","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1137\/S0097539790187084","volume":"26","author":"P. Feldman","year":"1997","unstructured":"Feldman, P., Micali, S.: An optimal probabilistic protocol for synchronous byzantine agreement. SIAM J. Comput.\u00a026(4), 873\u2013933 (1997)","journal-title":"SIAM J. Comput."},{"key":"22_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. In: PODS, pp. 1\u20137 (1983)","DOI":"10.1145\/588058.588060"},{"issue":"1","key":"22_CR16","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1137\/S0097539794265232","volume":"27","author":"J.A. Garay","year":"1998","unstructured":"Garay, J.A., Moses, Y.: Fully polynomial byzantine agreement for > processors in + 1 rounds. SIAM J. Comput.\u00a027(1), 247\u2013290 (1998)","journal-title":"SIAM J. Comput."},{"key":"22_CR17","unstructured":"Goldwasser, S., Vaikuntanathan, V.: Distributed computing with imperfect randomness part \u0131\u0131 (manuscript) (in preparation)"},{"key":"22_CR18","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 the ACM\u00a027, 228\u2013234 (1980)","journal-title":"Journal of the ACM"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized byzantine generals. In: FOCS, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"22_CR20","doi-asserted-by":"crossref","unstructured":"Raz, R.: Extractors with weak random seeds. In: STOC (to appear, 2005)","DOI":"10.1145\/1060590.1060593"},{"key":"22_CR21","doi-asserted-by":"crossref","unstructured":"Santha, M., Vazirani, U.V.: Generating quasi-random sequences from slightly-random sources. In: FOCS, Singer Island, pp. 434\u2013440 (1984)","DOI":"10.1109\/SFCS.1984.715945"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Vazirani, U.V.: Towards a strong communication complexity theory or generating quasi-random sequences from two communicating slightly-random sources (extended abstract). In: STOC, pp. 366\u2013378 (1985)","DOI":"10.1145\/22145.22186"},{"key":"22_CR23","first-page":"768","volume-title":"von Neumann\u2019s Collected Works","author":"J. Neumann von","year":"1963","unstructured":"von Neumann, J.: Various techniques for use in connection with random digits. In: von Neumann\u2019s Collected Works, vol.\u00a05, pp. 768\u2013770. Pergamon, Oxford (1963)"},{"key":"22_CR24","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: General weak random sources. In: FOCS 1990, pp. 534\u2013543 (1990)","DOI":"10.1109\/FSCS.1990.89574"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561927_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T21:43:58Z","timestamp":1736027038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561927_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291633","9783540320753"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/11561927_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}