{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T14:41:05Z","timestamp":1725806465879},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319124742"},{"type":"electronic","value":"9783319124759"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-12475-9_20","type":"book-chapter","created":{"date-parts":[[2014,10,1]],"date-time":"2014-10-01T09:25:19Z","timestamp":1412155519000},"page":"291-299","source":"Crossref","is-referenced-by-count":1,"title":["How to Use Pseudorandom Generators in Unconditional Security Settings"],"prefix":"10.1007","author":[{"given":"Koji","family":"Nuida","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-01001-9_1","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Hofheinz, D., Yilek, S.: Possibility and impossibility results for encryption and commitment secure under selective opening. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 1\u201335. Springer, Heidelberg (2009)"},{"issue":"6","key":"20_CR2","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/s10207-010-0119-9","volume":"9","author":"I. Damg\u00e5rd","year":"2010","unstructured":"Damg\u00e5rd, I., Jurik, M., Nielsen, J.B.: A generalization of Paillier\u2019s public-key system with applications to electronic voting. Int. J. Inform. Sec.\u00a09(6), 371\u2013385 (2010)","journal-title":"Int. J. Inform. Sec."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Dubrov, B., Ishai, Y.: On the randomness complexity of efficient sampling. In: Proceedings of STOC 2006, pp. 711\u2013720 (2006)","DOI":"10.1145\/1132516.1132615"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-540-71677-8_28","volume-title":"Public Key Cryptography \u2013 PKC 2007","author":"R.R. Farashahi","year":"2007","unstructured":"Farashahi, R.R., Schoenmakers, B., Sidorenko, A.: Efficient pseudorandom generators based on the DDH assumption. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol.\u00a04450, pp. 426\u2013441. Springer, Heidelberg (2007)"},{"key":"20_CR5","unstructured":"Hemenway, B., Ostrovsky, R.: Building injective trapdoor functions from oblivious transfer. Electronic Colloquium on Computational Complexity, TR10-127, Revision 1 (2010), \n                    \n                      http:\/\/eccc.hpi-web.de\/report\/2010\/127\/"},{"issue":"4","key":"20_CR6","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1090\/S0273-0979-06-01126-8","volume":"43","author":"S. Hoory","year":"2006","unstructured":"Hoory, S., Linial, N., Wigderson, A.: Expander graphs and their applications. Bull. Amer. Math. Soc.\u00a043(4), 439\u2013561 (2006)","journal-title":"Bull. Amer. Math. Soc."},{"key":"20_CR7","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Nisan, N., Wigderson, A.: Pseudorandomness for network algorithms. In: Proceedings of STOC 1994, pp. 356\u2013364 (1994)","DOI":"10.1145\/195058.195190"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1007\/978-3-642-13190-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"E. Kiltz","year":"2010","unstructured":"Kiltz, E., Mohassel, P., O\u2019Neill, A.: Adaptive trapdoor functions and chosen-ciphertext security. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 673\u2013692. Springer, Heidelberg (2010)"},{"key":"20_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/978-3-540-78524-8_18","volume-title":"Theory of Cryptography","author":"G. Kol","year":"2008","unstructured":"Kol, G., Naor, M.: Cryptography and game theory: Designing protocols for exchanging information. In: Canetti, R. (ed.) TCC 2008. LNCS, vol.\u00a04948, pp. 320\u2013339. Springer, Heidelberg (2008)"},{"issue":"4","key":"20_CR10","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-13013-7_18","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"P. Mol","year":"2010","unstructured":"Mol, P., Yilek, S.: Chosen-ciphertext security from slightly lossy trapdoor functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 296\u2013311. Springer, Heidelberg (2010)"},{"key":"20_CR12","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1006\/jctb.1994.1054","volume":"62","author":"M. Morgenstern","year":"1994","unstructured":"Morgenstern, M.: Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q. J. Combin. Theory, Series B\u00a062, 44\u201362 (1994)","journal-title":"J. Combin. Theory, Series B"},{"issue":"3","key":"20_CR13","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10623-009-9285-z","volume":"52","author":"K. Nuida","year":"2009","unstructured":"Nuida, K., Fujitsu, S., Hagiwara, M., Kitagawa, T., Watanabe, H., Ogawa, K., Imai, H.: An improvement of discrete Tardos fingerprinting codes. Des. Codes Cryptography\u00a052(3), 339\u2013362 (2009)","journal-title":"Des. Codes Cryptography"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1109\/TIT.2012.2216978","volume":"59","author":"K. Nuida","year":"2013","unstructured":"Nuida, K., Hanaoka, G.: On the security of pseudorandomized information-theoretically secure schemes. IEEE Trans. Inform. Theory\u00a059(1), 635\u2013652 (2013)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"20_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-540-85174-5_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Vaikuntanathan, V., Waters, B.: A framework for efficient and composable oblivious transfer. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 554\u2013571. Springer, Heidelberg (2008)"},{"key":"20_CR16","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Proceedings of STOC 2008, pp. 187\u2013196 (2008)","DOI":"10.1145\/1374376.1374406"},{"issue":"11","key":"20_CR17","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Commun. ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12475-9_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T01:12:21Z","timestamp":1559005941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-12475-9_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319124742","9783319124759"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12475-9_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}