{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,1]],"date-time":"2026-10-01T14:52:53Z","timestamp":1790866373534,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540582014","type":"print"},{"value":"9783540485667","type":"electronic"}],"license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58201-0_99","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:34:11Z","timestamp":1330252451000},"page":"568-579","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Randomness in distribution protocols"],"prefix":"10.1007","author":[{"given":"Carlo","family":"Blundo","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alfredo","family":"De Santis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ugo","family":"Vaccaro","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"47_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, Proof Verification and Hardness of Approximation Problems, Proc. 33th IEEE Symp. on Foundations of Computer Science, pp. 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"47_CR2","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation, Proceedings of 20th Annual ACM Symposium on Theory of Computing,\u201d pp. 1\u201310, 1988.","DOI":"10.1145\/62212.62213"},{"key":"47_CR3","doi-asserted-by":"crossref","unstructured":"G. R. Blakley, Safeguarding Cryptographic Keys, Proceedings AFIPS 1979 National Computer Conference, pp.313\u2013317, June 1979.","DOI":"10.1109\/MARK.1979.8817296"},{"key":"47_CR4","first-page":"335","volume-title":"Lecture Notes in Computer Science, Vol. 209","author":"R. Blom","year":"1984","unstructured":"R. Blom, An Optimal Class of Symmetric Key Generation Systems, Advances in Cryptology: Proceedings of Eurocrypt 84, Lecture Notes in Computer Science, Vol. 209, Springer-Verlag, Berlin, 1984, pp. 335\u2013338."},{"key":"47_CR5","first-page":"411","volume-title":"Lecture Notes in Computer Science, Vol. 196","author":"G. R. Blakley","year":"1985","unstructured":"G. R. Blakley and C. Meadows, Security of Ramp Schemes, Proceedings of Crypto '84, \u201cAdvances in Cryptology\u201d, Lecture Notes in Computer Science, Vol. 196, G. R. Blakley and D. Chaum, Eds., Springer-Verlag, Berlin, pp. 411\u2013431, 1985."},{"key":"47_CR6","unstructured":"C. Blundo, A. Giorgio Gaggia, and D. R. Stinson, On the Dealer's Randomness Required in Secret Sharing Schemes, Technical Report UNL-CSE-93-024, Department of Computer Science and Engineering, University of Nebraska, November 1993."},{"key":"47_CR7","doi-asserted-by":"crossref","unstructured":"C. Blundo and A. Cresti, Space Requirements for Broadcast Encryption, Technical Report UNL-CSE-94-006, Department of Computer Science and Engineering, University of Nebraska, February 1994.","DOI":"10.1007\/BFb0053444"},{"key":"47_CR8","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, L. Gargano, and U. Vaccaro, On the Information Rate of Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 CRYPTO 92\u201d, E. Brickell Ed., Lectures Notes in Computer Science, vol. 740, pp. 149\u2013169, 1993, Springer-Verlag.","DOI":"10.1007\/3-540-48071-4_11"},{"key":"47_CR9","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, A. Herzberg, S. Kutten, U. Vaccaro, and M. Yung, Perfectly-Secure Key Distribution for Dynamic Conferences, in \u201cAdvances in Cryptology \u2014 CRYPTO 92\u201d, E. Brickell Ed., vol. 740, Lectures Notes n Computer Science, pp. 471\u2013486, 1993, Springer-Verlag.","DOI":"10.1007\/3-540-48071-4_33"},{"key":"47_CR10","doi-asserted-by":"crossref","unstructured":"C. Blundo, A. De Santis, D. R. Stinson, and U. Vaccaro, Graph Decomposition and Secret Sharing Schemes, in \u201cAdvances in Cryptology \u2014 Eurocrypt '92\u201d, Lecture Notes in Computer Science, Vol. 658, R. Rueppel Ed., Springer-Verlag, pp. 1\u201324, 1993, also to appear in J. of Cryptology.","DOI":"10.1007\/3-540-47555-9_1"},{"key":"47_CR11","doi-asserted-by":"crossref","unstructured":"C. Blundo, A De Santis, and U. Vaccaro, Efficient Sharing of Many Secrets, Proceedings of STACS '93, Lecture Notes in Computer Science, Vol. 665, P. Enjalbert, A. Finkel, K. W. Wagner Eds., Springer-Verlag, pp. 692\u2013703, 1993.","DOI":"10.1007\/3-540-56503-5_68"},{"issue":"No.2","key":"47_CR12","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF00196772","volume":"4","author":"E. F. Brickell","year":"1991","unstructured":"E. F. Brickell and D. M. Davenport, On the Classification of Ideal Secret Sharing Schemes, J. Cryptology, Vol. 4, No. 2, pp. 123\u2013124, 1991.","journal-title":"J. Cryptology"},{"key":"47_CR13","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF00198463","volume":"6","author":"R. M. Capocelli","year":"1993","unstructured":"R. M. Capocelli, A. De Santis, L. Gargano, and U. Vaccaro, On the Size of Shares for Secret Sharing Schemes, Journal of Cryptology, vol. 6, pp. 157\u2013167, 1993.","journal-title":"Journal of Cryptology"},{"key":"47_CR14","doi-asserted-by":"crossref","unstructured":"T. M. Cover and J. A. Thomas, Elements of Information Theory, John Wiley & Sons, 1991.","DOI":"10.1002\/0471200611"},{"key":"47_CR15","doi-asserted-by":"crossref","unstructured":"M. Franklin and M. Yung, Communication Complexity of Secure Computation, Proceedings of 24th ACM Symposium on Theory of Computing, pp. 699\u2013710, 1992.","DOI":"10.1145\/129712.129780"},{"key":"47_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali, and A. Wigderson, How to Play any Mental Game, Proceedings of 19th ACM Symposium on Theory of Computing, pp. 218\u2013229, 1987.","DOI":"10.1145\/28395.28420"},{"key":"47_CR17","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and D. Zuckerman, How to Recycle Random Bits, Proceedings of 30th Annual Symposium of Computer Science, pp. 248\u2013255, 1989.","DOI":"10.1109\/SFCS.1989.63486"},{"issue":"No.1","key":"47_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/TIT.1983.1056621","volume":"IT-29","author":"E. D. Karnin","year":"1983","unstructured":"E. D. Karnin, J. W. Greene, and M. E. Hellman, On Secret Sharing Systems, IEEE Trans. on Inform. Theory, Vol. IT-29, No. 1, pp. 35\u201341, Jan. 1983.","journal-title":"IEEE Trans. on Inform. Theory"},{"key":"47_CR19","unstructured":"D.E. Knuth and A.C. Yao, The Complexity of Nonuniform Random Number Generation, in \u201cAlgorithms and Complexity\u201d, J.F. Traub Ed., Academic Press, 1976, pp. 357\u2013428."},{"key":"47_CR20","doi-asserted-by":"crossref","unstructured":"D. Krizanc, D. Peleg, and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proceedings of 20th Annual ACM Symposium on Theory of Computing, 1988, pp. 93\u2013102.","DOI":"10.1145\/62212.62221"},{"issue":"No.9","key":"47_CR21","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1145\/358746.358762","volume":"24","author":"R. J. McEliece","year":"1981","unstructured":"R. J. McEliece and D. Sarwate, On Sharing Secrets and Reed-Solomon Codes, Communications of the ACM, Vol. 24, No. 9, pp. 583\u2013584, September 1981.","journal-title":"Communications of the ACM"},{"issue":"No.2","key":"47_CR22","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","volume":"36","author":"M. O. Rabin","year":"1989","unstructured":"M. O. Rabin, Efficient Dispersal of Information for Security, Load Balancing and Fault Tolerance, Journal of ACM, Vol. 36 No. 2, pp. 335\u2013348, 1989.","journal-title":"Journal of ACM"},{"issue":"No.11","key":"47_CR23","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"A. Shamir, How to Share a Secret, Communications of the ACM, Vol. 22, No. 11, pp. 612\u2013613, Nov. 1979.","journal-title":"Communications of the ACM"},{"key":"47_CR24","doi-asserted-by":"crossref","unstructured":"G. J. Simmons, An Introduction to Shared Secret and\/or Shared Control Schemes and Their Application, Contemporary Cryptology, IEEE Press, pp. 441\u2013497, 1991.","DOI":"10.1007\/3-540-38424-3_16"},{"key":"47_CR25","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1007\/BF00125203","volume":"2","author":"D. R. Stinson","year":"1992","unstructured":"D. R. Stinson, An Explication of Secret Sharing Schemes, Design, Codes and Cryptography, Vol. 2, pp. 357\u2013390, 1992.","journal-title":"Design, Codes and Cryptography"},{"key":"47_CR26","unstructured":"D. R. Stinson, Decomposition Constructions for Secret Sharing Schemes, Technical Report UNL-CSE-92-020, Department of Computer Science and Engineering, University of Nebraska, September 1992."},{"key":"47_CR27","doi-asserted-by":"crossref","unstructured":"D. Zuckerman, Simulating BPP Using a General Weak Random Source, Proc. 32th IEEE Symp. on Foundations of Computer Science, pp. 79\u201389, 1991.","DOI":"10.1109\/SFCS.1991.185351"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58201-0_99","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T18:23:14Z","timestamp":1742581394000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58201-0_99"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540582014","9783540485667"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-58201-0_99","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}