{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T23:48:35Z","timestamp":1769298515639,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642146220","type":"print"},{"value":"9783642146237","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14623-7_28","type":"book-chapter","created":{"date-parts":[[2010,8,10]],"date-time":"2010-08-10T08:15:26Z","timestamp":1281428126000},"page":"520-537","source":"Crossref","is-referenced-by-count":64,"title":["On Strong Simulation and Composable Point Obfuscation"],"prefix":"10.1007","author":[{"given":"Nir","family":"Bitansky","sequence":"first","affiliation":[]},{"given":"Ran","family":"Canetti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"28_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/978-3-540-70936-7_30","volume-title":"Theory of Cryptography","author":"B. Adida","year":"2007","unstructured":"Adida, B., Wikstr\u00f6m, D.: How to shuffle in public. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 555\u2013574. Springer, Heidelberg (2007)"},{"key":"28_CR2","unstructured":"Applebaum, B., Harnik, D., Ishai, Y.: Semantic security under related-key attacks and applications (2010) (manusript)"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-44647-8_1","volume-title":"Advances in Cryptology - CRYPTO 2001","author":"B. Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, pp. 1\u201318. Springer, Heidelberg (2001)"},{"key":"28_CR4","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R.: On strong simulation and composable point obfuscation (2010), http:\/\/eprint.iacr.org","DOI":"10.1007\/978-3-642-14623-7_28"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/3-540-36492-7_6","volume-title":"Selected Areas in Cryptography","author":"J. Black","year":"2003","unstructured":"Black, J., Rogaway, P., Shrimpton, T.: Encryption-scheme security in the presence of key-dependent messages. In: Nyberg, K., Heys, H.M. (eds.) SAC 2002. LNCS, vol.\u00a02595, pp. 62\u201375. Springer, Heidelberg (2003)"},{"key":"28_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0054851","volume-title":"Algorithmic Number Theory","author":"D. Boneh","year":"1998","unstructured":"Boneh, D.: The decision diffie-hellman problem. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol.\u00a01423, pp. 48\u201363. Springer, Heidelberg (1998)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1007\/978-3-540-85174-5_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2008","author":"D. Boneh","year":"2008","unstructured":"Boneh, D., Halevi, S., Hamburg, M., Ostrovsky, R.: Circular-secure encryption from decision diffie-hellman. In: Wagner, D. (ed.) CRYPTO 2008. LNCS, vol.\u00a05157, pp. 108\u2013125. Springer, Heidelberg (2008)"},{"key":"28_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/BFb0052255","volume-title":"Advances in Cryptology - CRYPTO \u201997","author":"R. Canetti","year":"1997","unstructured":"Canetti, R.: Towards realizing random oracles: Hash functions that hide all partial information. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol.\u00a01294, pp. 455\u2013469. Springer, Heidelberg (1997)"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1007\/978-3-540-78967-3_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"R. Canetti","year":"2008","unstructured":"Canetti, R., Dakdouk, R.R.: Obfuscating point functions with multibit output. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 489\u2013508. Springer, Heidelberg (2008)"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"52","DOI":"10.1007\/978-3-642-11799-2_4","volume-title":"TCC 2010","author":"R. Canetti","year":"2010","unstructured":"Canetti, R., Kalai, Y.T., Varia, M., Wichs, D.: On symmetric encryption and point obfuscation. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 52\u201371. Springer, Heidelberg (2010)"},{"key":"28_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R., Micciancio, D., Reingold, O.: Perfectly one-way probabilistic hash functions (preliminary version). In: STOC, pp. 131\u2013140 (1998)","DOI":"10.1145\/276698.276721"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1007\/978-3-642-11799-2_5","volume-title":"TCC 2010","author":"R. Canetti","year":"2010","unstructured":"Canetti, R., Rothblum, G.N., Varia, M.: Obfuscation of hyperplane membership. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol.\u00a05978, pp. 72\u201389. Springer, Heidelberg (2010)"},{"key":"28_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-00457-5_6","volume-title":"Theory of Cryptography","author":"R. Canetti","year":"2009","unstructured":"Canetti, R., Varia, M.: Non-malleable obfuscation. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 73\u201390. Springer, Heidelberg (2009)"},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting errors without leaking partial information. In: STOC, pp. 654\u2013663 (2005)","DOI":"10.1145\/1060590.1060688"},{"key":"28_CR15","unstructured":"Goldwasser, S., Kalai, Y., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS (2010)"},{"key":"28_CR16","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS, pp. 553\u2013562 (2005)","DOI":"10.1109\/SFCS.2005.60"},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-540-70936-7_11","volume-title":"Theory of Cryptography","author":"S. Goldwasser","year":"2007","unstructured":"Goldwasser, S., Rothblum, G.N.: On best-possible obfuscation. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 194\u2013213. Springer, Heidelberg (2007)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-642-13190-5_5","volume-title":"EUROCRYPT 2010","author":"S. Hada","year":"2010","unstructured":"Hada, S.: Secure obfuscation for encrypted signatures. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 92\u2013112. Springer, Heidelberg (2010)"},{"key":"28_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-642-00457-5_13","volume-title":"Theory of Cryptography","author":"I. Haitner","year":"2009","unstructured":"Haitner, I., Holenstein, T.: On the (im)possibility of key dependent encryption. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 202\u2013219. Springer, Heidelberg (2009)"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Halevi, S., Krawczyk, H.: Security under key-dependent inputs. In: ACM Conference on Computer and Communications Security, pp. 466\u2013475 (2007)","DOI":"10.1145\/1315245.1315303"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-70936-7_12","volume-title":"Theory of Cryptography","author":"D. Hofheinz","year":"2007","unstructured":"Hofheinz, D., Malone-Lee, J., Stam, M.: Obfuscation for cryptographic purposes. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 214\u2013232. Springer, Heidelberg (2007)"},{"key":"28_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/978-3-540-70936-7_13","volume-title":"Theory of Cryptography","author":"S. Hohenberger","year":"2007","unstructured":"Hohenberger, S., Rothblum, G.N., Shelat, A., Vaikuntanathan, V.: Securely obfuscating re-encryption. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 233\u2013252. Springer, Heidelberg (2007)"},{"key":"28_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-540-24676-3_2","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"B. Lynn","year":"2004","unstructured":"Lynn, B., Prabhakaran, M., Sahai, A.: Positive results and techniques for obfuscation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 20\u201339. Springer, Heidelberg (2004)"},{"key":"28_CR24","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"28_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology - EUROCRYPT \u201997","author":"V. Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol.\u00a01233, pp. 256\u2013266. Springer, Heidelberg (1997)"},{"key":"28_CR26","doi-asserted-by":"crossref","unstructured":"Wee, H.: On obfuscating point functions. In: STOC, pp. 523\u2013532 (2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14623-7_28.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:55:40Z","timestamp":1606186540000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-14623-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642146220","9783642146237"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14623-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}