{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:00:55Z","timestamp":1725897655349},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322402"},{"type":"electronic","value":"9783642322419"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32241-9_41","type":"book-chapter","created":{"date-parts":[[2012,8,13]],"date-time":"2012-08-13T15:12:12Z","timestamp":1344870732000},"page":"482-494","source":"Crossref","is-referenced-by-count":0,"title":["A Remark on One-Wayness versus Pseudorandomness"],"prefix":"10.1007","author":[{"given":"Periklis A.","family":"Papakonstantinou","sequence":"first","affiliation":[]},{"given":"Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N. Alon","year":"1986","unstructured":"Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. Journal of Algorithms\u00a07, 567\u2013583 (1986)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"41_CR2","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s00037-006-0211-8","volume":"15","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Computationally private randomizing polynomials and their applications. Computational Complexity\u00a015(2), 115\u2013162 (2006); also CCC 2005","journal-title":"Computational Complexity"},{"issue":"4","key":"41_CR3","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1137\/S0097539705446950","volume":"36","author":"B. Applebaum","year":"2006","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography in NC0. SIAM Journal on Computing (SICOMP)\u00a036(4), 845\u2013888 (2006); also FOCS 2004 (2004)","journal-title":"SIAM Journal on Computing (SICOMP)"},{"key":"41_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-19571-6_30","volume-title":"Theory of Cryptography","author":"J. Bronson","year":"2011","unstructured":"Bronson, J., Juma, A., Papakonstantinou, P.A.: Limits on the Stretch of Non-adaptive Constructions of Pseudo-Random Generators. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 504\u2013521. Springer, Heidelberg (2011)"},{"issue":"4","key":"41_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1002\/(SICI)1098-2418(199707)10:4<407::AID-RSA1>3.0.CO;2-Y","volume":"10","author":"J. Bl\u00f6mer","year":"1997","unstructured":"Bl\u00f6mer, J., Karp, R., Welzl, E.: The rank of sparse random matrices over finite fields. Random Structures Algorithms\u00a010(4), 407\u2013419 (1997)","journal-title":"Random Structures Algorithms"},{"issue":"3","key":"41_CR6","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0019-9958(82)90766-5","volume":"52","author":"A. Borodin","year":"1982","unstructured":"Borodin, A., von zur Gathen, J., Hopcroft, J.: Fast parallel matrix and GCD computations. Information and Control\u00a052(3), 241\u2013256 (1982)","journal-title":"Information and Control"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: Symposium on Theory of Computing (STOC), pp. 25\u201332 (1989)","key":"41_CR7","DOI":"10.1145\/73007.73010"},{"doi-asserted-by":"crossref","unstructured":"Goldreich, O.: Foundations of cryptography. Cambridge University Press, Cambridge (2001); Basic tools (vol. I)","key":"41_CR8","DOI":"10.1017\/CBO9780511546891"},{"key":"41_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/11787006_20","volume-title":"Automata, Languages and Programming","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: Efficient Pseudorandom Generators from Exponentially Hard One-Way Functions. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04052, pp. 228\u2013239. Springer, Heidelberg (2006)"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1007\/11818175_2","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"I. Haitner","year":"2006","unstructured":"Haitner, I., Harnik, D., Reingold, O.: On the Power of the Randomized Iterate. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol.\u00a04117, pp. 22\u201340. Springer, Heidelberg (2006)"},{"issue":"4","key":"41_CR11","doi-asserted-by":"crossref","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. Hastad","year":"1999","unstructured":"Hastad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM Journal on Computing (SICOMP)\u00a028(4), 1364\u20131396 (1999); also STOC 1989","journal-title":"SIAM Journal on Computing (SICOMP)"},{"doi-asserted-by":"crossref","unstructured":"Haitner, I., Reingold, O., Vadhan, S.: Efficiency improvements in constructing pseudorandom generators from one-way functions. In: Symposium on Theory of Computing (STOC), pp. 437\u2013446 (2010)","key":"41_CR12","DOI":"10.1145\/1806689.1806750"},{"doi-asserted-by":"crossref","unstructured":"Kharitonov, M., Goldberg, A.V., Yung, M.: Lower bounds for pseudorandom number generators. In: Foundations of Computer Science (FOCS), pp. 242\u2013247 (1989)","key":"41_CR13","DOI":"10.1109\/SFCS.1989.63485"},{"doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: A study of password security. Journal on Cryptology\u00a01(3), 151-158 (1989)","key":"#cr-split#-41_CR14.1","DOI":"10.1007\/BF02252873"},{"doi-asserted-by":"crossref","unstructured":"Luby, M., Rackoff, C.: A Study of Password Security. In: Pomerance, C. (ed.) CRYPTO 1987. LNCS, vol.\u00a0293, pp. 392-397. Springer, Heidelberg (1988)","key":"#cr-split#-41_CR14.2","DOI":"10.1007\/3-540-48184-2_34"},{"unstructured":"MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. North-Holland (1977)","key":"41_CR15"},{"issue":"3","key":"41_CR16","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0012-365X(84)90013-X","volume":"51","author":"A. Mukhopadhyay","year":"1984","unstructured":"Mukhopadhyay, A.: On the probability that the determinant of an n\u00d7n matrix over a finite field vanishes. Discrete Math.\u00a051(3), 311\u2013315 (1984)","journal-title":"Discrete Math."},{"issue":"1","key":"41_CR17","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/BF02579205","volume":"7","author":"K. Mulmuley","year":"1987","unstructured":"Mulmuley, K.: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. Combinatorica\u00a07(1), 101\u2013104 (1987)","journal-title":"Combinatorica"},{"doi-asserted-by":"crossref","unstructured":"Sipser, M.: A complexity theoretic approach to randomness. In: Symposium on Theory of Computing (STOC), pp. 330\u2013335 (1983)","key":"41_CR18","DOI":"10.1145\/800061.808762"},{"doi-asserted-by":"crossref","unstructured":"Vadhan, S.: Pseudorandomness (April 2011)","key":"41_CR19","DOI":"10.1561\/9781601985958"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32241-9_41.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T13:12:58Z","timestamp":1643202778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32241-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322402","9783642322419"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32241-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}