{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,7,25]],"date-time":"2022-07-25T18:48:32Z","timestamp":1658774912874},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cryptol"],"published-print":{"date-parts":[[2021,4]]},"DOI":"10.1007\/s00145-021-09378-z","type":"journal-article","created":{"date-parts":[[2021,4,9]],"date-time":"2021-04-09T21:02:20Z","timestamp":1618002140000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Obfuscating Circuits Via Composite-Order Graded Encoding"],"prefix":"10.1007","volume":"34","author":[{"given":"Benny","family":"Applebaum","sequence":"first","affiliation":[]},{"given":"Zvika","family":"Brakerski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,9]]},"reference":[{"key":"9378_CR1","doi-asserted-by":"crossref","unstructured":"P. Ananth, D. Gupta, Y. Ishai, A. Sahai, Optimizing obfuscation: avoiding Barrington\u2019s theorem. Cryptology ePrint Archive, Report 2014\/222, 2014. http:\/\/eprint.iacr.org\/.","DOI":"10.1145\/2660267.2660342"},{"key":"9378_CR2","unstructured":"B. Applebaum, Bootstrapping obfuscators via fast pseudorandom functions, in Advances in Cryptology\u2014ASIACRYPT 2014 (2014), pp. 162\u2013172"},{"key":"9378_CR3","doi-asserted-by":"crossref","unstructured":"B. Barak, O. Goldreich, R. Impagliazzo, S. Rudich, A. Sahai, S.P. Vadhan, K. Yang. On the (im)possibility of obfuscating programs. J. ACM 59(2), 6 (2012). Preliminary version in CRYPTO 2001","DOI":"10.1145\/2160158.2160159"},{"key":"9378_CR4","doi-asserted-by":"crossref","unstructured":"B. Barak, S. Garg, Y.T. Kalai, O. Paneth, A. Sahai, Protecting obfuscation against algebraic attacks. in P.Q. Nguyen, E. Oswald, editors, Advances in Cryptology\u2014EUROCRYPT 2014, vol. 8441 of Lecture Notes in Computer Science (Springer, 2014), pp. 221\u2013238","DOI":"10.1007\/978-3-642-55220-5_13"},{"key":"9378_CR5","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, G.N. Rothblum. Obfuscating conjunctions, in R. Canetti, J.A. Garay, editors, Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part II, vol. 8043 of Lecture Notes in Computer Science (Springer, 2013), pp. 416\u2013434","DOI":"10.1007\/978-3-642-40084-1_24"},{"key":"9378_CR6","unstructured":"Z. Brakerski, G.N. Rothblum, Black-box obfuscation for D-CNFS, in M. Naor, editor, Innovations in Theoretical Computer Science, ITCS\u201914, Princeton, NJ, USA, January 12\u201314, 2014 (ACM, 2014), pp. 235\u2013250"},{"key":"9378_CR7","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, G.N. Rothblum, Virtual black-box obfuscation for all circuits via generic graded encoding, in Y. Lindell, editor, Theory of Cryptography\u201411th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24\u201326, 2014. Proceedings, vol. 8349 of Lecture Notes in Computer Science (Springer, 2014), pp 1\u201325","DOI":"10.1007\/978-3-642-54242-8_1"},{"key":"9378_CR8","doi-asserted-by":"crossref","unstructured":"J.-S. Coron, T. Lepoint, M. Tibouchi, Practical multilinear maps over the integers, in R. Canetti, J.A. Garay, editors Advances in Cryptology\u2014CRYPTO 2013\u201433rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18\u201322, 2013. Proceedings, Part I, vol. 8042 of Lecture Notes in Computer Science (Springer, 2013), pp. 476\u2013493","DOI":"10.1007\/978-3-642-40041-4_26"},{"key":"9378_CR9","doi-asserted-by":"crossref","unstructured":"J.A. Garay, R. Gennaro, editors. Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17\u201321, 2014, Proceedings, Part I, vol. 8616 of Lecture Notes in Computer Science (Springer, 2014)","DOI":"10.1007\/978-3-662-44381-1"},{"key":"9378_CR10","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi. Candidate multilinear maps from ideal lattices, in T. Johansson, P.Q. Nguyen, editors, Advances in Cryptology\u2014EUROCRYPT 2013, 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26\u201330, 2013. Proceedings, vol. 7881 of Lecture Notes in Computer Science (Springer, 2013), pp. 1\u201317","DOI":"10.1007\/978-3-642-38348-9_1"},{"key":"9378_CR11","doi-asserted-by":"crossref","unstructured":"S. Garg, C. Gentry, S. Halevi, M. Raykova, A. Sahai, B. Waters. 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 (IEEE Computer Society, 2013), pp. 40\u201349","DOI":"10.1109\/FOCS.2013.13"},{"key":"9378_CR12","doi-asserted-by":"crossref","unstructured":"V. Goyal, Y. Ishai, A. Sahai, R. Venkatesan, A. Wadia. Founding cryptography on tamper-proof hardware tokens, in D. Micciancio, editor, Theory of Cryptography, 7th Theory of Cryptography Conference, TCC 2010, Zurich, Switzerland, February 9\u201311, 2010. Proceedings, vol. 5978 of Lecture Notes in Computer Science (Springer, 2010), pp. 308\u2013326","DOI":"10.1007\/978-3-642-11799-2_19"},{"key":"9378_CR13","doi-asserted-by":"crossref","unstructured":"C. Gentry, A.B. Lewko, A. Sahai, B. Waters. Indistinguishability obfuscation from the multilinear subgroup elimination assumption. IACR Cryptology ePrint Archive, 2014:309, 2014.","DOI":"10.1109\/FOCS.2015.19"},{"key":"9378_CR14","doi-asserted-by":"crossref","unstructured":"C. Gentry, A.B. Lewko, B. Waters, Witness encryption from instance independent assumptions, in Garay and Gennaro [GG14], pp. 426\u2013443. References are respective to the ePrint version: https:\/\/eprint.iacr.org\/2014\/273","DOI":"10.1007\/978-3-662-44371-2_24"},{"key":"9378_CR15","doi-asserted-by":"crossref","unstructured":"U. Maurer, Abstract models of computation in cryptography, in N.P. Smart, editor, IMA Int. Conf., vol. 3796 of Lecture Notes in Computer Science (Springer, 2005), pp. 1\u201312","DOI":"10.1007\/11586821_1"},{"key":"9378_CR16","doi-asserted-by":"crossref","unstructured":"R. Pass, K. Seth, S. Telang, Indistinguishability obfuscation from semantically-secure multilinear encodings. In Garay and Gennaro [GG14], pp. 500\u2013517","DOI":"10.1007\/978-3-662-44371-2_28"},{"key":"9378_CR17","doi-asserted-by":"crossref","unstructured":"J. Schwartz, Fast probabilistic algorithms for verification of polynomial identities. J. ACM, 27(2):701\u2013717, 1980","DOI":"10.1145\/322217.322225"},{"key":"9378_CR18","doi-asserted-by":"crossref","unstructured":"V. Shoup. Lower bounds for discrete logarithms and related problems, in W. Fumy, editor, EUROCRYPT, vol. 1233 of Lecture Notes in Computer Science (Springer, 1997), pp. 256\u2013266","DOI":"10.1007\/3-540-69053-0_18"},{"key":"9378_CR19","unstructured":"J. Zimmerman, How to obfuscate programs directly. Cryptology ePrint Archive, Report 2014\/776, 2014. Appeared in Eurocrypt 2015 [?]"},{"key":"9378_CR20","unstructured":"R. Zippel, Probabilistic algorithms for sparse polynomials, in International Symposiumon on Symbolic and Algebraic Computation (1979), pp. 216\u2013226"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09378-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-021-09378-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-021-09378-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,25]],"date-time":"2021-04-25T03:09:08Z","timestamp":1619320148000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-021-09378-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["9378"],"URL":"https:\/\/doi.org\/10.1007\/s00145-021-09378-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,4]]},"assertion":[{"value":"23 February 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 September 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 February 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 April 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"14"}}