{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:12:40Z","timestamp":1755997960881},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452383"},{"type":"electronic","value":"9783642452390"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45239-0_5","type":"book-chapter","created":{"date-parts":[[2013,12,11]],"date-time":"2013-12-11T03:20:44Z","timestamp":1386732044000},"page":"65-84","source":"Crossref","is-referenced-by-count":19,"title":["On the Relationship between Functional Encryption, Obfuscation, and Fully Homomorphic Encryption"],"prefix":"10.1007","author":[{"given":"Jo\u00ebl","family":"Alwen","sequence":"first","affiliation":[]},{"given":"Manuel","family":"Barbosa","sequence":"additional","affiliation":[]},{"given":"Pooya","family":"Farshim","sequence":"additional","affiliation":[]},{"given":"Rosario","family":"Gennaro","sequence":"additional","affiliation":[]},{"given":"S. Dov","family":"Gordon","sequence":"additional","affiliation":[]},{"given":"Stefano","family":"Tessaro","sequence":"additional","affiliation":[]},{"given":"David A.","family":"Wilson","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5_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":"5_CR2","unstructured":"Agrawal, S., Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption: new perspectives and lower bounds. Cryptology ePrint Archive, Report 2012\/468 (2012)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-36362-7_10","volume-title":"Public-Key Cryptography \u2013 PKC 2013","author":"M. Barbosa","year":"2013","unstructured":"Barbosa, M., Farshim, P.: On the semantic security of functional encryption schemes. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol.\u00a07778, pp. 143\u2013161. Springer, Heidelberg (2013)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-14623-7_36","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"M. Bellare","year":"2010","unstructured":"Bellare, M., Cash, D.: Pseudorandom functions and permutations provably secure against related-key attacks. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 666\u2013684. Springer, Heidelberg (2010)"},{"key":"5_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/3-540-39200-9_31","volume-title":"Advances in Cryptology \u2013 EUROCRPYT 2003","author":"M. Bellare","year":"2003","unstructured":"Bellare, M., Kohno, T.: A theoretical treatment of related-key attacks: RKA-PRPs, RKA-PRFs, and applications. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol.\u00a02656, pp. 491\u2013506. Springer, Heidelberg (2003)"},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., O\u2019Neill, A.: Semantically-secure functional encryption: possibility results, impossibility results and the quest for a general definition. Cryptology ePrint Archive, Report 2012\/515 (2012)","DOI":"10.1007\/978-3-319-02937-5_12"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-642-19571-6_16","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2011","unstructured":"Boneh, D., Sahai, A., Waters, B.: Functional encryption: definitions and challenges. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol.\u00a06597, pp. 253\u2013273. Springer, Heidelberg (2011)"},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-11799-2_5","volume-title":"Theory of Cryptography","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":"5_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-28914-9_23","volume-title":"Theory of Cryptography","author":"N. Chandran","year":"2012","unstructured":"Chandran, N., Chase, M., Vaikuntanathan, V.: Functional re-encryption and collusion-resistant obfuscation. In: Cramer, R. (ed.) TCC 2012. LNCS, vol.\u00a07194, pp. 404\u2013421. Springer, Heidelberg (2012)"},{"key":"5_CR10","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Smith, A.: Correcting Errors Without Leaking Partial Information. In: Gabow, H.N., Fagin, R. (eds.) STOC 2005, pp. 654\u2013663. ACM Press (May 2005)","DOI":"10.1145\/1060590.1060688"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)","DOI":"10.1145\/1536414.1536440"},{"key":"5_CR12","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: Succinct functional encryption and applications: reusable garbled circuits and beyond. In: Boneh, D., Roughgarden, T., Feigenbaum, J. (eds.) STOC 2013, pp. 555\u2013564. ACM (2013)"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-32009-5_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"S. Gorbunov","year":"2012","unstructured":"Gorbunov, S., Vaikuntanathan, V., Wee, H.: Functional encryption with bounded collusions via multi-party computation. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 162\u2013179. Springer, Heidelberg (2012)"},{"key":"5_CR14","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":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45708-9_8","volume-title":"Advances in Cryptology - CRYPTO 2002","author":"J.B. Nielsen","year":"2002","unstructured":"Nielsen, J.B.: Separating random oracle proofs from complexity theoretic proofs: the non-committing encryption case. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol.\u00a02442, pp. 111\u2013126. Springer, Heidelberg (2002)"},{"key":"5_CR16","unstructured":"O\u2019Neill, A.: Definitional issues in functional encryption. Cryptology ePrint Archive, Report 2010\/556 (2010)"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Regev, O.: On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. In: Gabow, H.N., Fagin, R. (eds.) STOC 2005, pp. 84\u201393. ACM Press (May 2005)","DOI":"10.1145\/1060590.1060603"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-46035-7_9","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"A.Y. Russell","year":"2002","unstructured":"Russell, A.Y., Wang, H.: How to Fool an Unbounded Adversary with a Short Key. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 133\u2013148. Springer, Heidelberg (2002)"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-32009-5_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"B. Waters","year":"2012","unstructured":"Waters, B.: Functional encryption for regular languages. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol.\u00a07417, pp. 218\u2013235. Springer, Heidelberg (2012)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Wee, H.: On Obfuscating Point Functions. In: Gabow, H.N., Fagin, R. (eds.) STOC 2005, pp. 523\u2013532. ACM Press (May 2005)","DOI":"10.1145\/1060590.1060669"}],"container-title":["Lecture Notes in Computer Science","Cryptography and Coding"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45239-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T07:36:54Z","timestamp":1558769814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45239-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452383","9783642452390"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45239-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}