{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:06:13Z","timestamp":1746331573267,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662443804"},{"type":"electronic","value":"9783662443811"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44381-1_4","type":"book-chapter","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T04:27:09Z","timestamp":1405312029000},"page":"55-70","source":"Crossref","is-referenced-by-count":0,"title":["Cryptography with Streaming Algorithms"],"prefix":"10.1007","author":[{"given":"Periklis A.","family":"Papakonstantinou","sequence":"first","affiliation":[]},{"given":"Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography with constant input locality. Journal of Cryptology, 429\u2013469; In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 92\u2013110. Springer, Heidelberg (2007)","key":"4_CR1","DOI":"10.1007\/978-3-540-74143-5_6"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1137\/0220039","volume":"20","author":"J. Chen","year":"1991","unstructured":"Chen, J., Yap, C.-K.: Reversal complexity. SIAM Journal on Computing\u00a020(4), 622\u2013638 (1991)","journal-title":"SIAM Journal on Computing"},{"unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature? In: ICS, pp. 1\u201319 (2010)","key":"4_CR3"},{"doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: In: Symposium on Theory of Computing (STOC), pp. 12\u201324 (1989)","key":"4_CR4","DOI":"10.1145\/73007.73009"},{"doi-asserted-by":"crossref","unstructured":"Vadhan, S.P., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. In: Symposium on Theory of Computing (STOC), pp. 817\u2013836 (2012)","key":"4_CR5","DOI":"10.1145\/2213977.2214051"},{"unstructured":"Yu, X., Yung, M.: Space Lower-Bounds for Pseudorandom-Generators. In: Structure in Complexity Theory Conference, pp. 186\u2013197 (1994)","key":"4_CR6"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D. Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: Simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 700\u2013718. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Symposium on Theory of Computing (STOC), pp. 84\u201393 (2005)","key":"4_CR8","DOI":"10.1145\/1060590.1060603"},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","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)","journal-title":"Computational Complexity"},{"issue":"4","key":"4_CR10","doi-asserted-by":"publisher","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 of Computing (SICOMP)\u00a036(4), 845\u2013888 (2006)","journal-title":"SIAM Journal of Computing (SICOMP)"},{"issue":"1","key":"4_CR11","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/s00037-007-0237-6","volume":"17","author":"B. Applebaum","year":"2008","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: On pseudorandom generators with linear stretch in ${\\rm NC}\\sp 0$ . Computational Complexity\u00a017(1), 38\u201369 (2008)","journal-title":"Computational Complexity"},{"key":"4_CR12","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)"},{"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":"4_CR13","DOI":"10.1109\/SFCS.1989.63485"},{"issue":"4","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A Pseudorandom Generator from any One-way Function. SIAM Journal of Computing (SICOMP)\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM Journal of Computing (SICOMP)"},{"unstructured":"Bar-Yossef, Z., Reingold, O., Shaltiel, R., Trevisan, L.: Streaming Computation of Combinatorial Objects. In: Annual IEEE Conference on Computational Complexity (CCC), vol.\u00a017 (2002)","key":"4_CR15"},{"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":"4_CR16","DOI":"10.1145\/1806689.1806750"},{"doi-asserted-by":"crossref","unstructured":"Grohe, M., Hernich, A., Schweikardt, N.: Lower bounds for processing data with few random accesses to external memory. Journal of the ACM\u00a056(3): Art. 12, 58 (2009)","key":"4_CR17","DOI":"10.1145\/1516512.1516514"},{"issue":"1-3","key":"4_CR18","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.tcs.2008.04.026","volume":"401","author":"A. Hernich","year":"2008","unstructured":"Hernich, A., Schweikardt, N.: Reversal complexity revisited. Theoretical Computer Science\u00a0401(1-3), 191\u2013205 (2008)","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2077336.2077339","volume":"3","author":"P. Beame","year":"2012","unstructured":"Beame, P., Huynh, T.: The Value of Multiple Read\/Write Streams for Approximating Frequency Moments. ACM Transactions on Computation Theory\u00a03(2), 6 (2012)","journal-title":"ACM Transactions on Computation Theory"},{"issue":"1","key":"4_CR20","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0022-0000(89)90037-8","volume":"38","author":"D.A. Barrington","year":"1989","unstructured":"Barrington, D.A.: Bounded-width polynomial-size branching programs recognize exactly those languages in ${\\rm NC}\\sp 1$ . Journal of Computer and System Sciences\u00a038(1), 150\u2013164 (1989)","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S.: Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information. In: Symposium on Theory of Computing (STOC), pp. 365\u2013377 (1982)","key":"4_CR21","DOI":"10.1145\/800070.802212"},{"doi-asserted-by":"crossref","unstructured":"Alekhnovich, M.: More on average case vs approximation complexity. In: Foundations of Computer Science (FOCS), pp. 298\u2013307 (2003)","key":"4_CR22","DOI":"10.1109\/SFCS.2003.1238204"},{"doi-asserted-by":"crossref","unstructured":"Kilian, J.: Founding cryptography on oblivious transfer. In: Symposium on Theory of Computing (STOC), pp. 20\u201331 (1988)","key":"4_CR23","DOI":"10.1145\/62212.62215"},{"doi-asserted-by":"crossref","unstructured":"Grohe, M., Schweikardt, N.: Lower bounds for sorting with few random accesses to external memory. In: Symposium on Principles of Database Systems (PODS), pp. 238\u2013249 (2005)","key":"4_CR24","DOI":"10.1145\/1065167.1065197"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44381-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T19:47:25Z","timestamp":1746301645000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44381-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662443804","9783662443811"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44381-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}