{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:38:11Z","timestamp":1770982691998,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783662456071","type":"print"},{"value":"9783662456088","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-45608-8_14","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T10:46:39Z","timestamp":1415961999000},"page":"254-273","source":"Crossref","is-referenced-by-count":20,"title":["Secret-Sharing for NP"],"prefix":"10.1007","author":[{"given":"Ilan","family":"Komargodski","sequence":"first","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-55220-5_13","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"B. Barak","year":"2014","unstructured":"Barak, B., Garg, S., Kalai, Y.T., Paneth, O., Sahai, A.: Protecting obfuscation against algebraic attacks. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol.\u00a08441, pp. 221\u2013238. Springer, Heidelberg (2014)"},{"key":"14_CR2","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":"14_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 (Preliminary version appeared in CRYPTO 2001). In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol.\u00a02139, p. 1. Springer, Heidelberg (2001)"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/978-3-642-20901-7_2","volume-title":"Coding and Cryptology","author":"A. Beimel","year":"2011","unstructured":"Beimel, A.: Secret-sharing schemes: A survey. In: Chee, Y.M., Guo, Z., Ling, S., Shao, F., Tang, Y., Wang, H., Xing, C. (eds.) IWCC 2011. LNCS, vol.\u00a06639, pp. 11\u201346. Springer, Heidelberg (2011)"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1137\/S0895480102412868","volume":"19","author":"A. Beimel","year":"2005","unstructured":"Beimel, A., Ishai, Y.: On the power of nonlinear secrect-sharing. SIAM Journal on Discrete Mathematics\u00a019(1), 258\u2013280 (2005)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Rogaway, P.: Robust computational secret sharing and a unified account of classical secret-sharing goals. In: ACM Conference on Computer and Communications Security, pp. 172\u2013184. ACM (2007)","DOI":"10.1145\/1315245.1315268"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/0-387-34799-2_3","volume-title":"Advances in Cryptology - CRYPTO \u201988","author":"J.C. Benaloh","year":"1990","unstructured":"Benaloh, J.C., Leichter, J.: Generalized secret sharing and monotone functions. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol.\u00a0403, pp. 27\u201335. Springer, Heidelberg (1990)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Blakley, G.R.: Safeguarding cryptographic keys. In: Proceedings of the AFIPS National Computer Conference, vol.\u00a022, pp. 313\u2013317 (1979)","DOI":"10.1109\/MARK.1979.8817296"},{"key":"14_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"D. Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 480\u2013499. Springer, Heidelberg (2014)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Rothblum, G.N.: Black-box obfuscation for d-CNFs. In: ITCS, pp. 235\u2013250. ACM (2014)","DOI":"10.1145\/2554797.2554820"},{"key":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54242-8_1","volume-title":"Theory of Cryptography","author":"Z. Brakerski","year":"2014","unstructured":"Brakerski, Z., Rothblum, G.N.: Virtual black-box obfuscation for all circuits via generic graded encoding. In: Lindell, Y. (ed.) TCC 2014. LNCS, vol.\u00a08349, pp. 1\u201325. Springer, Heidelberg (2014)"},{"issue":"6","key":"14_CR12","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/950620.950623","volume":"50","author":"C. Dwork","year":"2003","unstructured":"Dwork, C., Naor, M., Reingold, O., Stockmeyer, L.J.: Magic functions. Journal of the ACM\u00a050(6), 852\u2013921 (2003)","journal-title":"Journal of the ACM"},{"key":"14_CR13","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: FOCS, pp. 40\u201349 (2013)","DOI":"10.1109\/FOCS.2013.13"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Garg, S., Gentry, C., Sahai, A., Waters, B.: Witness encryption and its applications. In: STOC, pp. 467\u2013476. ACM (2013)","DOI":"10.1145\/2488608.2488667"},{"key":"14_CR15","first-page":"309","volume":"2014","author":"C. Gentry","year":"2014","unstructured":"Gentry, C., Lewko, A.B., Sahai, A., Waters, B.: Indistinguishability obfuscation from the multilinear subgroup elimination assumption. IACR Cryptology ePrint Archive\u00a02014, 309 (2014)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-662-44371-2_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"C. Gentry","year":"2014","unstructured":"Gentry, C., Lewko, A.B., Waters, B.: Witness encryption from instance independent assumptions. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 426\u2013443. Springer, Heidelberg (2014)"},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/0022-0000(84)90070-9","volume":"28","author":"S. Goldwasser","year":"1984","unstructured":"Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences\u00a028(2), 270\u2013299 (1984)","journal-title":"Journal of Computer and System Sciences"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Grigni, M., Sipser, M.: Monotone complexity. In: Proceedings of LMS Workshop on Boolean Function Complexity, vol.\u00a0169, pp. 57\u201375. Cambridge University Press (1992)","DOI":"10.1017\/CBO9780511526633.006"},{"issue":"4","key":"14_CR19","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, 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":"14_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: A personal view of average-case complexity. In: Structure in Complexity Theory Conference, pp. 134\u2013147. IEEE Computer Society (1995)","DOI":"10.1109\/SCT.1995.514853"},{"issue":"1","key":"14_CR21","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/BF02620229","volume":"6","author":"M. Ito","year":"1993","unstructured":"Ito, M., Saito, A., Nishizeki, T.: Multiple assignment scheme for sharing secret. Journal of Cryptology\u00a06(1), 15\u201320 (1993)","journal-title":"Journal of Cryptology"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Karchmer, M., Wigderson, A.: On span programs. In: Structure in Complexity Theory Conference, pp. 102\u2013111. IEEE Computer Society (1993)","DOI":"10.1109\/SCT.1993.336536"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"Komargodski, I., Moran, T., Naor, M., Pass, R., Rosen, A., Yogev, E.: One-way functions and (im)perfect obfuscation. IACR Cryptology ePrint Archive\u00a02014, 347 (2014), to appear in FOCS 2014","DOI":"10.1109\/FOCS.2014.47"},{"key":"14_CR24","first-page":"213","volume":"2014","author":"I. Komargodski","year":"2014","unstructured":"Komargodski, I., Naor, M., Yogev, E.: Secret-sharing for NP. IACR Cryptology ePrint Archive\u00a02014, 213 (2014)","journal-title":"IACR Cryptology ePrint Archive"},{"key":"14_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/3-540-48329-2_12","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"H. Krawczyk","year":"1994","unstructured":"Krawczyk, H.: Secret sharing made short. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol.\u00a0773, pp. 136\u2013146. Springer, Heidelberg (1994)"},{"issue":"2","key":"14_CR26","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/BF00196774","volume":"4","author":"M. Naor","year":"1991","unstructured":"Naor, M.: Bit commitment using pseudorandomness. Journal of Cryptology\u00a04(2), 151\u2013158 (1991)","journal-title":"Journal of Cryptology"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/978-3-540-45146-4_6","volume-title":"Advances in Cryptology - CRYPTO 2003","author":"M. Naor","year":"2003","unstructured":"Naor, M.: On cryptographic assumptions and challenges. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol.\u00a02729, pp. 96\u2013109. Springer, Heidelberg (2003)"},{"key":"14_CR28","unstructured":"Naor, M.: Secret sharing for access structures beyond P (2006), slides: http:\/\/www.wisdom.weizmann.ac.il\/~naor\/PAPERS\/minicrypt.html"},{"key":"14_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-662-44371-2_28","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"R. Pass","year":"2014","unstructured":"Pass, R., Seth, K., Telang, S.: Indistinguishability obfuscation from semantically-secure multilinear encodings. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol.\u00a08616, pp. 500\u2013517. Springer, Heidelberg (2014)"},{"key":"14_CR30","unstructured":"Razborov, A.A.: Lower bounds for the monotone complexity of some Boolean functions. Dokl. Ak. Nauk. SSSR\u00a0281, 798\u2013801 (1985), english translation in: Soviet Math. Dokl. Vol. 31, pp. 354-357 (1985)"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: STOC, pp. 475\u2013484. ACM (2014)","DOI":"10.1145\/2591796.2591825"},{"issue":"11","key":"14_CR32","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A. Shamir","year":"1979","unstructured":"Shamir, A.: How to share a secret. Communications of the ACM\u00a022(11), 612\u2013613 (1979)","journal-title":"Communications of the ACM"},{"key":"14_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-540-24582-7_12","volume-title":"Progress in Cryptology - INDOCRYPT 2003","author":"V. Vinod","year":"2003","unstructured":"Vinod, V., Narayanan, A., Srinathan, K., Pandu Rangan, C., Kim, K.: On the power of computational secret sharing. In: Johansson, T., Maitra, S. (eds.) INDOCRYPT 2003. LNCS, vol.\u00a02904, pp. 162\u2013176. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-45608-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:56:00Z","timestamp":1747158960000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-45608-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662456071","9783662456088"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-45608-8_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]}}}