{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,28]],"date-time":"2026-05-28T02:31:56Z","timestamp":1779935516212,"version":"3.53.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642383472","type":"print"},{"value":"9783642383489","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-38348-9_7","type":"book-chapter","created":{"date-parts":[[2013,5,9]],"date-time":"2013-05-09T00:46:38Z","timestamp":1368060398000},"page":"111-125","source":"Crossref","is-referenced-by-count":24,"title":["How to Watermark Cryptographic Functions"],"prefix":"10.1007","author":[{"given":"Ryo","family":"Nishimaki","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"2","key":"7_CR1","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\u00a059(2), 6 (2012)","journal-title":"J. ACM"},{"issue":"3","key":"7_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1137\/S0097539701398521","volume":"32","author":"D. Boneh","year":"2003","unstructured":"Boneh, D., Franklin, M.K.: Identity-based encryption from the Weil pairing. SIAM J. Comput.\u00a032(3), 586\u2013615 (2003)","journal-title":"SIAM J. Comput."},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/3-540-48658-5_25","volume-title":"Advances in Cryptology - CRYPTO \u201994","author":"B. Chor","year":"1994","unstructured":"Chor, B., Fiat, A., Naor, M.: Tracing traitors. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol.\u00a0839, pp. 257\u2013270. Springer, Heidelberg (1994)"},{"issue":"8","key":"7_CR4","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1109\/TSE.2002.1027797","volume":"28","author":"C.S. Collberg","year":"2002","unstructured":"Collberg, C.S., Thomborson, C.D.: Watermarking, tamper-proofing, and obfuscation-tools for software protection. IEEE Trans. Software Eng.\u00a028(8), 735\u2013746 (2002)","journal-title":"IEEE Trans. Software Eng."},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-642-13013-7_17","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"D.M. Freeman","year":"2010","unstructured":"Freeman, D.M., Goldreich, O., Kiltz, E., Rosen, A., Segev, G.: More constructions of lossy and correlation-secure trapdoor functions. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 279\u2013295. Springer, Heidelberg (2010)"},{"key":"7_CR6","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":"S.D. 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.\u00a04939, pp. 308\u2013327. Springer, Heidelberg (2008)"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/978-3-642-30057-8_37","volume-title":"Public Key Cryptography \u2013 PKC 2012","author":"B. Hemenway","year":"2012","unstructured":"Hemenway, B., Ostrovsky, R.: Extended-DDH and lossy trapdoor functions. In: Fischlin, M., Buchmann, J., Manulis, M. (eds.) PKC 2012. LNCS, vol.\u00a07293, pp. 627\u2013643. Springer, Heidelberg (2012)"},{"key":"7_CR8","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.J. Hopper","year":"2007","unstructured":"Hopper, N.J., Molnar, D., Wagner, D.: From weak to strong watermarking. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 362\u2013382. Springer, Heidelberg (2007)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-72738-5_1","volume-title":"Applied Cryptography and Network Security","author":"Q. Huang","year":"2007","unstructured":"Huang, Q., Wong, D.S., Zhao, Y.: Generic transformation to strongly unforgeable signatures. In: Katz, J., Yung, M. (eds.) ACNS 2007. LNCS, vol.\u00a04521, pp. 1\u201317. Springer, Heidelberg (2007)"},{"key":"7_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/3-540-46035-7_30","volume-title":"Advances in Cryptology - EUROCRYPT 2002","author":"A. Kiayias","year":"2002","unstructured":"Kiayias, A., Yung, M.: Traitor tracing with constant transmission rate. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol.\u00a02332, pp. 450\u2013465. Springer, Heidelberg (2002)"},{"key":"7_CR11","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.\u00a07237, pp. 318\u2013335. Springer, Heidelberg (2012)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-642-13190-5_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"A. Lewko","year":"2010","unstructured":"Lewko, A., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: Attribute-based encryption and (Hierarchical) inner product encryption. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol.\u00a06110, pp. 62\u201391. Springer, Heidelberg (2010)"},{"issue":"2","key":"7_CR13","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1137\/0217022","volume":"17","author":"M. Luby","year":"1988","unstructured":"Luby, M., Rackoff, C.: How to construct pseudorandom permutations from pseudorandom functions. SIAM J. Computing\u00a017(2), 373\u2013386 (1988)","journal-title":"SIAM J. Computing"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/3-540-49162-7_14","volume-title":"Public Key Cryptography","author":"D. Naccache","year":"1999","unstructured":"Naccache, D., Shamir, A., Stern, J.P.: How to copyright a function? In: Imai, H., Zheng, Y. (eds.) PKC 1999. LNCS, vol.\u00a01560, pp. 188\u2013196. Springer, Heidelberg (1999)"},{"key":"7_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.\u00a05209, pp. 57\u201374. Springer, Heidelberg (2008)"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-642-10366-7_13","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"T. Okamoto","year":"2009","unstructured":"Okamoto, T., Takashima, K.: Hierarchical predicate encryption for inner-products. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol.\u00a05912, pp. 214\u2013231. Springer, Heidelberg (2009)"},{"key":"7_CR17","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.\u00a06223, pp. 191\u2013208. Springer, Heidelberg (2010)"},{"key":"7_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-19379-8_3","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"T. Okamoto","year":"2011","unstructured":"Okamoto, T., Takashima, K.: Efficient attribute-based signatures for non-monotone predicates in the standard model. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol.\u00a06571, pp. 35\u201352. Springer, Heidelberg (2011)"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-642-29011-4_35","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"T. Okamoto","year":"2012","unstructured":"Okamoto, T., Takashima, K.: Adaptively attribute-hiding (Hierarchical) inner product encryption. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 591\u2013608. Springer, Heidelberg (2012)"},{"issue":"6","key":"7_CR20","doi-asserted-by":"publisher","first-page":"1803","DOI":"10.1137\/080733954","volume":"40","author":"C. Peikert","year":"2011","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. SIAM J. Comput.\u00a040(6), 1803\u20131844 (2011)","journal-title":"SIAM J. Comput."},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Rompel, J.: One-way functions are necessary and sufficient for secure signatures. In: STOC, pp. 387\u2013394. ACM (1990)","DOI":"10.1145\/100216.100269"},{"key":"7_CR22","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.\u00a05677, pp. 619\u2013636. Springer, Heidelberg (2009)"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Fujiwara, T.: Toward digital watermarking for cryptographic data. IEICE Transactions\u00a094-A(1), 270\u2013272 (2011)","DOI":"10.1587\/transfun.E94.A.270"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Yoshida, M., Mitsunari, S., Fujiwara, T.: The vector decomposition problem. IEICE Transactions\u00a093A-(1), 188\u2013193 (2010)","DOI":"10.1587\/transfun.E93.A.188"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 EUROCRYPT 2013"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38348-9_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:42:21Z","timestamp":1558316541000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38348-9_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642383472","9783642383489"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38348-9_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}