{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:01:49Z","timestamp":1725904909418},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319612720"},{"type":"electronic","value":"9783319612737"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-61273-7_28","type":"book-chapter","created":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T11:22:58Z","timestamp":1499944978000},"page":"521-543","source":"Crossref","is-referenced-by-count":0,"title":["Watermarking Cryptographic Programs"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Nishimaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,14]]},"reference":[{"key":"28_CR1","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 \u2014 CRYPTO 2001","author":"B Barak","year":"2001","unstructured":"Barak, B., Goldreich, O., Impagliazzo, R., Rudich, S., Sahai, A., Vadhan, S., Yang, K.: On the (im)possibility of obfuscating programs. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 1\u201318. Springer, Heidelberg (2001). doi:\n10.1007\/3-540-44647-8_1"},{"issue":"2","key":"28_CR2","doi-asserted-by":"crossref","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":"28_CR3","unstructured":"Boneh, D., Lewi, K., Wu, D.J.: Constraining pseudorandom functions privately. Cryptology ePrint Archive, Report 2015\/1167 (2015). \nhttp:\/\/eprint.iacr.org\/2015\/1167"},{"key":"28_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"Advances in Cryptology - ASIACRYPT 2013","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-42045-0_15"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-642-54631-0_29","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"E Boyle","year":"2014","unstructured":"Boyle, E., Goldwasser, S., Ivan, I.: Functional signatures and pseudorandom functions. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 501\u2013519. Springer, Heidelberg (2014). doi:\n10.1007\/978-3-642-54631-0_29"},{"key":"28_CR6","first-page":"1115","volume-title":"48th ACM STOC","author":"A Cohen","year":"2016","unstructured":"Cohen, A., Holmgren, J., Nishimaki, R., Vaikuntanathan, V., Wichs, D.: Watermarking cryptographic capabilities. In: Wichs, D., Mansour, Y. (eds.) 48th ACM STOC, pp. 1115\u20131127. ACM Press, New York (2016)"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1007\/978-3-540-78440-1_18","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"SD Galbraith","year":"2008","unstructured":"Galbraith, S.D., Verheul, E.R.: An analysis of the vector decomposition problem. In: Cramer, R. (ed.) PKC 2008. LNCS, vol. 4939, pp. 308\u2013327. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-78440-1_18"},{"key":"28_CR8","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 FOCS, pp. 40\u201349. IEEE Computer Society Press, October 2013","DOI":"10.1109\/FOCS.2013.13"},{"issue":"4","key":"28_CR9","doi-asserted-by":"crossref","first-page":"792","DOI":"10.1145\/6490.6503","volume":"33","author":"O Goldreich","year":"1986","unstructured":"Goldreich, O., Goldwasser, S., Micali, S.: How to construct random functions. J. ACM 33(4), 792\u2013807 (1986)","journal-title":"J. ACM"},{"key":"28_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"362","DOI":"10.1007\/978-3-540-70936-7_20","volume-title":"Theory of Cryptography","author":"N Hopper","year":"2007","unstructured":"Hopper, N., Molnar, D., Wagner, D.: From weak to strong watermarking. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 362\u2013382. Springer, Heidelberg (2007). doi:\n10.1007\/978-3-540-70936-7_20"},{"key":"28_CR11","first-page":"669","volume-title":"ACM CCS 2013","author":"A Kiayias","year":"2013","unstructured":"Kiayias, A., Papadopoulos, S., Triandopoulos, N., Zacharias, T.: Delegatable pseudorandom functions and applications. In: Sadeghi, A.-R., Gligor, V.D., Yung, M. (eds.) ACM CCS 2013, pp. 669\u2013684. ACM Press, New York (2013)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-642-29011-4_20","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"A Lewko","year":"2012","unstructured":"Lewko, A.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 318\u2013335. Springer, Heidelberg (2012). doi:\n10.1007\/978-3-642-29011-4_20"},{"key":"28_CR13","first-page":"11","volume-title":"57th FOCS","author":"H Lin","year":"2016","unstructured":"Lin, H., Vaikuntanathan, V.: Indistinguishability obfuscation from DDH-like assumptions on constant-degree graded encodings. In: Dinur, I. (ed.) 57th FOCS, pp. 11\u201320. IEEE Computer Society Press, Washington, D.C. (2016)"},{"key":"28_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-38348-9_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2013","author":"R Nishimaki","year":"2013","unstructured":"Nishimaki, R.: How to watermark cryptographic functions. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 111\u2013125. Springer, Heidelberg (2013). doi:\n10.1007\/978-3-642-38348-9_7"},{"key":"28_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-540-85538-5_4","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"T Okamoto","year":"2008","unstructured":"Okamoto, T., Takashima, K.: Homomorphic encryption and signatures from vector decomposition. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 57\u201374. Springer, Heidelberg (2008). doi:\n10.1007\/978-3-540-85538-5_4"},{"key":"28_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-14623-7_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"T Okamoto","year":"2010","unstructured":"Okamoto, T., Takashima, K.: Fully secure functional encryption with general relations from the decisional linear assumption. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 191\u2013208. Springer, Heidelberg (2010). doi:\n10.1007\/978-3-642-14623-7_11"},{"key":"28_CR17","first-page":"475","volume-title":"46th ACM STOC","author":"A Sahai","year":"2014","unstructured":"Sahai, A., Waters, B.: How to use indistinguishability obfuscation: deniable encryption, and more. In: Shmoys, D.B. (ed.) 46th ACM STOC, pp. 475\u2013484. ACM Press, New York (2014)"},{"key":"28_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-642-03356-8_36","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Waters","year":"2009","unstructured":"Waters, B.: Dual system encryption: realizing fully secure IBE and HIBE under simple assumptions. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 619\u2013636. Springer, Heidelberg (2009). doi:\n10.1007\/978-3-642-03356-8_36"},{"key":"28_CR19","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Fujiwara, T.: Toward digital watermarking for cryptographic data. IEICE Trans. 94-A(1), 270\u2013272 (2011)","DOI":"10.1587\/transfun.E94.A.270"},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Mitsunari, S., Fujiwara, T.: The vector decomposition problem. IEICE Trans. 93-A(1), 188\u2013193 (2010)","DOI":"10.1587\/transfun.E93.A.188"}],"container-title":["Lecture Notes in Computer Science","Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61273-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,13]],"date-time":"2017-07-13T11:30:35Z","timestamp":1499945435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61273-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319612720","9783319612737"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61273-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}