{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T04:46:55Z","timestamp":1764132415437},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540576006"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-48285-7_36","type":"book-chapter","created":{"date-parts":[[2007,8,1]],"date-time":"2007-08-01T02:16:46Z","timestamp":1185934606000},"page":"424-434","source":"Crossref","is-referenced-by-count":7,"title":["Global, Unpredictable Bit Generation Without Broadcast"],"prefix":"10.1007","author":[{"given":"Donald","family":"Beaver","sequence":"first","affiliation":[]},{"given":"Nicol","family":"So","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich, C.P. Schnorr. \u201cRSA and Rabin Functions: Certain Parts are as Hard as the Whole.\u201d SIAM J. Computing, 17:2 (1988), 194\u2013209.","journal-title":"SIAM J. Computing"},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"D. Beaver. \u201cFoundations of Secure Interactive Computing.\u201d Proc. of Crypto 1991, 377\u2013391.","DOI":"10.1007\/3-540-46766-1_31"},{"key":"36_CR3","unstructured":"D. Beaver, H. Shan. In preparation."},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"M. Ben-Or. \u201cAnother Advantage of Free Choice.\u201d Proc. of 2nd PODC, 1983.","DOI":"10.1145\/800221.806707"},{"key":"36_CR5","first-page":"79","volume-title":"Proceedings of the the 1980 Symposium on Security and Privacy","author":"Blakley","year":"1981","unstructured":"Blakley, \u201cSecurity Proofs for Information Protection Systems.\u201d Proceedings of the the 1980 Symposium on Security and Privacy, IEEE Computer Society Press, NY (1981), 79\u201388."},{"key":"36_CR6","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum, S. Micali. \u201cHow to Generate Cryptographically Strong Sequences of Pseudo-Random Bits.\u201d SIAM J. Comput. 13 (1984), 850\u2013864.","journal-title":"SIAM J. Comput"},{"issue":"2","key":"36_CR7","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"L. Blum, M. Blum, M. Shub. \u201cA Simple Unpredictable Pseudo-Random Number Generator.\u201d SIAM J. Computing, 15:2 (1986), 364\u2013383.","journal-title":"SIAM J. Computing"},{"key":"36_CR8","unstructured":"M. Cerecedo, T. Matsumoto, H. Imai. \u201cNon-Interactive Generation of Shared Pseudorandom Sequences.\u201d To appear, Auscrypt 92."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"P. Feldman. \u201cA Practical Scheme for Non-Interactive Verifiable Secret Sharing.\u201d Proc. of the 28th FOCS, IEEE, 1987, 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"issue":"4","key":"36_CR10","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"O. Goldreich, S. Goldwasser, S. Micali. \u201cHow to Construct Random Functions.\u201d JACM 33:4 (1986), 792\u2013807.","journal-title":"JACM"},{"key":"36_CR11","unstructured":"S. Goldwasser, S. Micali. \u201cProbabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"S. Micali, P. Rogaway. \u201cSecure Computation.\u201d Proc. of Crypto 1991, 392\u2013404.","DOI":"10.1007\/3-540-46766-1_32"},{"issue":"2","key":"36_CR13","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1145\/322186.322188","volume":"27","author":"M. Pease","year":"1980","unstructured":"M. Pease, R. Shostak, L. Lamport. \u201cReaching Agreement in the Presence of Faults.\u201d JACM 27:2 (1980), 228\u2013234.","journal-title":"JACM"},{"key":"36_CR14","doi-asserted-by":"crossref","unstructured":"T. Pedersen. \u201cNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing.\u201d Proceedings of CRYPTO 91, 129\u2013140.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"36_CR15","unstructured":"M.O. Rabin. \u201cDigitalized Signatures and Public-Key Functions as Intractable as Factorization.\u201d Technical Report LCS\/TR-212, MIT, January, 1979."},{"key":"36_CR16","doi-asserted-by":"crossref","unstructured":"M.O. Rabin. \u201cRandomized Byzantine Generals.\u201d Proc. of the 24th FOCS, IEEE, 1983, 403\u2013409.","DOI":"10.1109\/SFCS.1983.48"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir. \u201cHow to Share a Secret.\u201d Communications of the ACM, 22 (1979), 612\u2013613.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 EUROCRYPT \u201993"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48285-7_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:15:29Z","timestamp":1605647729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48285-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540576006"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-48285-7_36","relation":{},"subject":[]}}