{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:46:08Z","timestamp":1743155168969,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300561"},{"type":"electronic","value":"9783642300578"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30057-8_33","type":"book-chapter","created":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T17:05:50Z","timestamp":1337360750000},"page":"558-575","source":"Crossref","is-referenced-by-count":1,"title":["Correlated Product Security from Any One-Way Function"],"prefix":"10.1007","author":[{"given":"Brett","family":"Hemenway","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steve","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rafail","family":"Ostrovsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"33_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/978-3-642-13190-5_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"T. Acar","year":"2010","unstructured":"Acar, T., Belenkiy, M., Bellare, M., Cash, D.: Cryptographic Agility and Its Relation to Circular Encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 403\u2013422. Springer, Heidelberg (2010)"},{"key":"33_CR2","unstructured":"Applebaum, B., Harnik, D., Ishai, Y.: Semantic security under related-key attacks and applications. In: ITCS 2011 (2011)"},{"key":"33_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-74143-5_30","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"M. Bellare","year":"2007","unstructured":"Bellare, M., Boldyreva, A., O\u2019Neill, A.: Deterministic and Efficiently Searchable Encryption. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol.\u00a04622, pp. 535\u2013552. Springer, Heidelberg (2007)"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/978-3-540-85174-5_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"A. Boldyreva","year":"2008","unstructured":"Boldyreva, A., Fehr, S., O\u2019Neill, A.: On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 335\u2013359. Springer, Heidelberg (2008)"},{"key":"33_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/978-3-540-85174-5_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"M. Bellare","year":"2008","unstructured":"Bellare, M., Fischlin, M., O\u2019Neill, A., Ristenpart, T.: Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 360\u2013378. Springer, Heidelberg (2008)"},{"key":"33_CR6","unstructured":"Braverman, M., Hassidim, A., Kalai, Y.T.: Leaky Pseudo-entropy functions. In: ITCS 2011 (2011)"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1007\/978-3-642-22792-9_31","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"Z. Brakerski","year":"2011","unstructured":"Brakerski, Z., Segev, G.: Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol.\u00a06841, pp. 543\u2013560. Springer, Heidelberg (2011)"},{"key":"33_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13013-7_17","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"D.M. Freeman","year":"2010","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More Constructions of Lossy and Correlation-Secure Trapdoor Functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 279\u2013295. Springer, Heidelberg (2010)"},{"issue":"4","key":"33_CR9","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O. Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. Journal of the ACM\u00a033(4), 792\u2013807 (1986)","journal-title":"Journal of the ACM"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1007\/978-3-642-19571-6_12","volume-title":"Theory of Cryptography","author":"V. Goyal","year":"2011","unstructured":"Goyal, V., O\u2019Neill, A., Rao, V.: Correlated-Input Secure Hash Functions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 182\u2013200. Springer, Heidelberg (2011)"},{"issue":"4","key":"33_CR11","doi-asserted-by":"publisher","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 J. Comput.\u00a028(4), 1364\u20131396 (1999)","journal-title":"SIAM J. Comput."},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-540-45146-4_9","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"Y. Ishai","year":"2003","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending Oblivious Transfers Efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 145\u2013161. Springer, Heidelberg (2003)"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Levin, L.A., Luby, M.: Pseudo-random generation from one-way functions (extended abstract). In: STOC 1989, pp. 12\u201324 (1989)","DOI":"10.1145\/73007.73009"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF02252873","volume":"1","author":"M. Luby","year":"1989","unstructured":"Luby, M., Rackoff, C.: A study of password security. Journal of Cryptology\u00a01(3), 151\u2013158 (1989)","journal-title":"Journal of Cryptology"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of psuedo-random functions. In: FOCS 1995, pp. 170\u2013181 (1995)","DOI":"10.1109\/SFCS.1995.492474"},{"key":"33_CR16","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/1536414.1536461","volume-title":"STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing","author":"C. Peikert","year":"2009","unstructured":"Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: STOC 2009: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, pp. 333\u2013342. ACM, New York (2009)"},{"key":"33_CR17","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/1374376.1374406","volume-title":"STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing","author":"C. Peikert","year":"2008","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: STOC 2008: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, pp. 187\u2013196. ACM, New York (2008)"},{"key":"33_CR18","unstructured":"Reingold, O.: Pseudo-Random Synthesizers Functions and Permutations. PhD thesis, The Weizmann Institute of Science (1998)"},{"key":"33_CR19","unstructured":"Rosen, A., Segev, G.: Efficient lossy trapdoor functions based on the composite residuosity assumption (2008), http:\/\/eprint.iacr.org\/2008\/134"},{"key":"33_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/978-3-642-00457-5_25","volume-title":"Theory of Cryptography","author":"A. Rosen","year":"2009","unstructured":"Rosen, A., Segev, G.: Chosen-Ciphertext Security via Correlated Products. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 419\u2013436. Springer, Heidelberg (2009)"},{"key":"33_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-11799-2_11","volume-title":"Theory of Cryptography","author":"Y. Vahlis","year":"2010","unstructured":"Vahlis, Y.: Two Is a Crowd? A Black-Box Separation of One-Wayness and Security under Correlated Inputs. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 165\u2013182. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Public Key Cryptography \u2013 PKC 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30057-8_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T09:10:06Z","timestamp":1743153006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30057-8_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300561","9783642300578"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30057-8_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}