{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:07:00Z","timestamp":1725664020082},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540572206"},{"type":"electronic","value":"9783540479765"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57220-1_77","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:21:32Z","timestamp":1330258892000},"page":"385-396","source":"Crossref","is-referenced-by-count":2,"title":["Non-interactive generation of shared pseudorandom sequences"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Cerecedo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"Matsumoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hideki","family":"Imai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,31]]},"reference":[{"key":"31_CR1","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1145\/357369.357372","volume":"1","author":"S. Akl","year":"1983","unstructured":"S. Akl and P. Taylor. \u201cCryptographic solution to a problem of access control in a hierarchy.\u201d ACM TOCS, 1, 1983, pp. 239\u2013248.","journal-title":"ACM TOCS"},{"issue":"no.2","key":"31_CR2","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1137\/0217013","volume":"17","author":"W. Alexi","year":"1988","unstructured":"W. Alexi, B. Chor, O. Goldreich and C.P. Schnorr. \u201cRSA and Rabin Functions: Certain Parts are as Hard as the Whole.\u201d SIAM Journal on Computing, vol. 17, no. 2, April 1988, pp. 194\u2013209.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR3","doi-asserted-by":"crossref","unstructured":"M. Ben-Or, S. Goldwasser and A. Wigderson. \u201cCompleteness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation.\u201d Proc. 20th STOC, ACM, 1988, pp. 1\u201310.","DOI":"10.1145\/62212.62213"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"D. Beaver. \u201cFoundations of Secure Interactive Computing.\u201d Proc. Crypto '91, Springer-Verlag, LNCS vol. 576, pp. 377\u2013391.","DOI":"10.1007\/3-540-46766-1_31"},{"key":"31_CR5","unstructured":"J.C. Benaloh. \u201cSecret Sharing Homomorphisms: Keeping Shares of a Secret Secret.\u201d Proc. Crypto '86. Springer-Verlag, LNCS vol. 293, 1987."},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"M. Blum and S. Micali. \u201cHow to Generate Cryptographically Strong Sequences Of Pseudo-Random Bits.\u201d Proc. 22nd FOCS, IEEE, 1982, pp. 112\u2013117.","DOI":"10.1109\/SFCS.1982.72"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"D. Beaver, S. Micali and P. Rogaway. \u201cThe Round Complexity of Secure Protocols.\u201d Proc. 22nd STOC, ACM, 1990, pp. 503\u2013513.","DOI":"10.1145\/100216.100287"},{"key":"31_CR8","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"J. Carter","year":"1979","unstructured":"J. Carter and M. Wegman. \u201cUniversal Classes of Hash Functions.\u201d Journal of Computer and System Sciences, 1979, vol. 18, pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"31_CR9","unstructured":"B. Chor and C. Dwork. \u201cRandomization in Byzantine Agreement.\u201d Advances in Computing Research, vol. 5, JAI Press, 1989, pp. 443\u2013497."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"B. Chor, S. Goldwasser, S. Micali and B. Awerbuch. \u201cVerifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults.\u201d Proc. 26th FOCS, IEEE, 1985, pp. 383\u2013395.","DOI":"10.1109\/SFCS.1985.64"},{"issue":"no.1","key":"31_CR11","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF00191320","volume":"5","author":"J.-H. Evertse","year":"1992","unstructured":"J.-H. Evertse and E. van Heyst. \u201cWhich New RSA-Signatures Can Be Computed from Certain Given RSA-Signatures?\u201d Journal of Cryptology, vol. 5, no. 1, 1992, pp. 41\u201352.","journal-title":"Journal of Cryptology"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"P. Feldman. \u201cA Practical Scheme for Non-Interactive Verifiable Secret Sharing.\u201d Proc. 28th FOCS, IEEE, 1987, pp. 427\u2013437.","DOI":"10.1109\/SFCS.1987.4"},{"key":"31_CR13","unstructured":"Y. Frankel and Y. Desmedt. \u201cClassification of ideal homomorphic threshold schemes over finite Abelian groups.\u201d Proc. Eurocrypt '92. To appear in Springer-Verlag, LNCS."},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"P. Feldman and S. Micali. \u201cOptimal Algorithms for Byzantine Agreement.\u201d Proc. 20th STOC, ACM, 1988, pp. 148\u2013161.","DOI":"10.1145\/62212.62225"},{"key":"31_CR15","unstructured":"Y. Frankel, Y. Desmedt and M. Burmester. \u201cNon-existence of homomorphic general sharing schemes for some key spaces.\u201d Proc. Crypto '92. To appear in Springer-Verlag, LNCS."},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"O. Goldreich, S. Micali and A. Wigderson. \u201cHow to Play Any Mental Game.\u201d Proc. 19th STOC, ACM, 1987, pp. 218\u2013229.","DOI":"10.1145\/28395.28420"},{"issue":"no.1","key":"31_CR17","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"S. Goldwasser, S. Micali and C. Rackoff. The Knowledge Complexity of Interactive Proof Systems. SIAM Journal on Computing, vol. 18, no. 1, Feb. 1989, pp. 186\u2013208.","journal-title":"SIAM Journal on Computing"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"J. H\u00e5stad. \u201cPseudo-Random Generators under Uniform Assumptions.\u201d Proc. 22nd STOC, ACM, 1990, pp. 395\u2013404.","DOI":"10.1145\/100216.100270"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, L.A. Levin and M. Luby. \u201cPseudo-Random Generation from Oneway Functions.\u201d Proc. 21st STOC, ACM, 1989, pp. 12\u201324.","DOI":"10.1145\/73007.73009"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, M. Naor. \u201cEfficient Cryptographic Schemes Provably as Secure as Subset Sum.\u201d Proc. 30th FOCS, IEEE, 1989, pp. 236\u2013241.","DOI":"10.1109\/SFCS.1989.63484"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"S. Micali and T. Rabin. \u201cCollective Coin Tossing without Assumptions nor Broadcasting.\u201d Proc. Crypto '90, Springer-Verlag, LNCS vol. 537, 1991.","DOI":"10.1007\/3-540-38424-3_18"},{"key":"31_CR22","doi-asserted-by":"crossref","unstructured":"S. Micali and P. Rogaway. Secure Computation. Proc. Crypto '91, Springer-Verlag, LNCS vol. 576, pp. 392\u2013404.","DOI":"10.1007\/3-540-46766-1_32"},{"key":"31_CR23","doi-asserted-by":"crossref","unstructured":"T.P. Pedersen. \u201cNon-Interactive and Information-Theoretic Secure Verifiable Secret Sharing.\u201d Proc. Crypto '91, Springer-Verlag, LNCS vol. 576, 1992, pp. 129\u2013140.","DOI":"10.1007\/3-540-46766-1_9"},{"key":"31_CR24","doi-asserted-by":"crossref","unstructured":"T. Rabin and M. Ben-Or. \u201cVerifiable Secret Sharing and Multi-Party Protocols with Honest Majority.\u201d Proc. 21st STOC, ACM, 1989, pp. 73\u201385.","DOI":"10.1145\/73007.73014"},{"issue":"no.1","key":"31_CR25","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1145\/357353.357357","volume":"1","author":"A. Shamir","year":"1983","unstructured":"A. Shamir. \u201cOn the Generation of Cryptographically Strong Pseudorandom Sequences.\u201d ACM Trans. on Computer Systems, vol. 1, no. 1, Feb. 1983, pp. 38\u201344.","journal-title":"ACM Trans. on Computer Systems"},{"key":"31_CR26","doi-asserted-by":"crossref","unstructured":"A.C. Yao. \u201cTheory and Applications of Trapdoor Functions.\u201d Proc. 23rd FOCS, IEEE, 1982, pp. 80\u201391.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2014 AUSCRYPT '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57220-1_77.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:09:38Z","timestamp":1605647378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57220-1_77"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540572206","9783540479765"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-57220-1_77","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}