{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:14:58Z","timestamp":1779934498047,"version":"3.53.1"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1347350"],"award-info":[{"award-number":["CNS-1347350"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1314722"],"award-info":[{"award-number":["CNS-1314722"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS- 1413964"],"award-info":[{"award-number":["CNS- 1413964"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2017,12]]},"DOI":"10.1007\/s00453-017-0276-6","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T13:17:26Z","timestamp":1484227046000},"page":"1353-1373","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["On the Implausibility of Differing-Inputs Obfuscation and Extractable Witness Encryption with Auxiliary Input"],"prefix":"10.1007","volume":"79","author":[{"given":"Sanjam","family":"Garg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Craig","family":"Gentry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shai","family":"Halevi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Daniel","family":"Wichs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"key":"276_CR1","unstructured":"Ananth, P., Boneh, D., Garg, S., Sahai, A., Zhandry, M.: Differing-inputs obfuscation and applications. Cryptology ePrint Archive. Report 2013\/689 (2013) http:\/\/eprint.iacr.org\/"},{"key":"276_CR2","doi-asserted-by":"crossref","unstructured":"Applebaum, B.: Bootstrapping obfuscators via fast pseudorandom functions. In: Sarkar and Iwata [21], pp. 162\u2013172","DOI":"10.1007\/978-3-662-45608-8_9"},{"key":"276_CR3","unstructured":"Bitansky, N., Canetti, R., Cohn, H., Goldwasser, S., Kalai, Y.T., Paneth, O., Rosen, A.: The impossibility of obfuscation with auxiliary input or a universal simulator. In: Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part II, pp. 71\u201389 (2014)"},{"key":"276_CR4","doi-asserted-by":"crossref","unstructured":"Boyle, E., Chung, K.-M., Pass, R.: On extractability obfuscation. In: Lindell [10], pp. 52\u201373","DOI":"10.1007\/978-3-642-54242-8_3"},{"key":"276_CR5","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Canetti, R., Paneth, O., Rosen, A.: On the existence of extractable one-way functions. In: Shmoys [20], pp. 505\u2013514","DOI":"10.1145\/2591796.2591859"},{"key":"276_CR6","doi-asserted-by":"crossref","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. In: CRYPTO, pp. 1\u201318 (2001)","DOI":"10.1007\/3-540-44647-8_1"},{"issue":"2","key":"276_CR7","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1145\/2160158.2160159","volume":"59","author":"B Barak","year":"2012","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S.P., Yang, K.: On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012)","journal-title":"J. ACM"},{"key":"276_CR8","doi-asserted-by":"crossref","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Phong, Q. Nguyen, Elisabeth O., (eds.) Advances in Cryptology\u2014EUROCRYPT 2014\u201433rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11\u201315, 2014. Proceedings, volume 8441 of Lecture Notes in Computer Science, pp. 221\u2013238. Springer (2014)","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"276_CR9","unstructured":"Boyle, E., Pass, R.: Limits of extractability assumptions with distributional auxiliary input. In: Tetsu I., Jung H.C. (eds.) Advances in cryptology\u2014ASIACRYPT 2015\u201421st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, November 29\u2014December 3, 2015, Proceedings, Part II, volume 9453 of Lecture Notes in Computer Science, pp. 236\u2013261. Springer, (2015)"},{"key":"276_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. In: Lindell [18], pp. 1\u201325","DOI":"10.1007\/978-3-642-54242-8_1"},{"key":"276_CR11","doi-asserted-by":"crossref","unstructured":"Bellare, M., Stepanovs, I., Tessaro, S.: Poly-many hardcore bits for any one-way function and a framework for differing-inputs obfuscation. In: Sarkar, Iwata [2,21], pp. 102\u2013121","DOI":"10.1007\/978-3-662-45608-8_6"},{"key":"276_CR12","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Halevi, S., Raykova, M., Sahai, A., Waters, B.: Candidate indistinguishability obfuscation and functional encryption for all circuits. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October, 2013, Berkeley, CA, USA, pp. 40\u201349. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"276_CR13","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: Dan, B., Tim, R., Joan, F., (eds), Symposium on Theory of Computing Conference, STOC\u201913, Palo Alto, CA, USA, June 1\u20134, 2013, pp. 467\u2013476. ACM (2013)"},{"key":"276_CR14","unstructured":"Goldwasser, S., Kalai, Y.T.: On the impossibility of obfuscation with auxiliary input. In: FOCS, pp. 553\u2013562 (2005)"},{"key":"276_CR15","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. In: Ran C., Juan A.G. (eds), CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, pp. 536\u2013553. Springer (2013)","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"276_CR16","doi-asserted-by":"crossref","unstructured":"Hada, S.: Zero-knowledge and code obfuscation. In: Tatsuaki O., (ed), ASIACRYPT, volume 1976 of Lecture Notes in Computer Science, pp. 443\u2013457. Springer (2000)","DOI":"10.1007\/3-540-44448-3_34"},{"key":"276_CR17","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Pandey, O., Sahai, A.: Public-coin differing-inputs obfuscation and its applications. In: Yevgeniy D., Jesper\u00a0Buus N., (eds), Theory of Cryptography\u201412th Theory of Cryptography Conference, TCC 2015, Warsaw, Poland, March 23\u201325, 2015, Proceedings, Part II, volume 9015 of Lecture Notes in Computer Science, pp. 668\u2013697. Springer (2015)","DOI":"10.1007\/978-3-662-46497-7_26"},{"key":"276_CR18","doi-asserted-by":"crossref","unstructured":"Lindell, Y. (ed): Theory of cryptography\u201411th Theory of cryptography conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings, volume 8349 of Lecture Notes in Computer Science. Springer (2014)","DOI":"10.1007\/978-3-642-54242-8"},{"key":"276_CR19","doi-asserted-by":"crossref","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Dan B., (ed), CRYPTO, volume 2729 of Lecture Notes in Computer Science, pp. 96\u2013109. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_6"},{"key":"276_CR20","unstructured":"Shmoys, D.B. (ed): Symposium on Theory of Computing, STOC 2014, New York, NY, USA, May 31\u2014June 03, 2014. ACM (2014)"},{"key":"276_CR21","doi-asserted-by":"crossref","unstructured":"Sarkar, P., Iwata, T. (eds): Advances in cryptology\u2014ASIACRYPT 2014\u201420th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7\u201311, 2014, Proceedings, Part II, volume 8874 of Lecture Notes in Computer Science. Springer (2014)","DOI":"10.1007\/978-3-662-45608-8"},{"key":"276_CR22","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys [20], pp. 475\u2013484","DOI":"10.1145\/2591796.2591825"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-017-0276-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0276-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-017-0276-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,14]],"date-time":"2025-06-14T10:36:18Z","timestamp":1749897378000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-017-0276-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":22,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,12]]}},"alternative-id":["276"],"URL":"https:\/\/doi.org\/10.1007\/s00453-017-0276-6","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,12]]},"assertion":[{"value":"1 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 January 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 January 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}