{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:06Z","timestamp":1759639086243},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642412264"},{"type":"electronic","value":"9783642412271"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41227-1_18","type":"book-chapter","created":{"date-parts":[[2013,10,15]],"date-time":"2013-10-15T01:04:52Z","timestamp":1381799092000},"page":"309-329","source":"Crossref","is-referenced-by-count":0,"title":["Factoring-Based Proxy Re-Encryption Schemes"],"prefix":"10.1007","author":[{"given":"Toshiyuki","family":"Isshiki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manh Ha","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keisuke","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. In: NDSS (2005)","DOI":"10.1145\/1127345.1127346"},{"issue":"1","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1127345.1127346","volume":"9","author":"G. Ateniese","year":"2006","unstructured":"Ateniese, G., Fu, K., Green, M., Hohenberger, S.: Improved proxy re-encryption schemes with applications to secure distributed storage. ACM Trans. Inf. Syst. Secur.\u00a09(1), 1\u201330 (2006)","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/11556992_10","volume-title":"Information Security","author":"J. Baek","year":"2005","unstructured":"Baek, J., Safavi-Naini, R., Susilo, W.: Certificateless public key encryption without pairing. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol.\u00a03650, pp. 134\u2013148. Springer, Heidelberg (2005)"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BFb0054122","volume-title":"Advances in Cryptology - EUROCRYPT \u201998","author":"M. Blaze","year":"1998","unstructured":"Blaze, M., Bleumer, G., Strauss, M.: Divertible protocols and atomic proxy cryptography. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol.\u00a01403, pp. 127\u2013144. Springer, Heidelberg (1998)"},{"issue":"2","key":"18_CR5","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0215025","volume":"15","author":"L. Blum","year":"1986","unstructured":"Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo- random number generator. SIAM Journal on Computing\u00a015(2), 364\u2013383 (1986)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"18_CR6","first-page":"140","volume":"1","author":"S. Canard","year":"2011","unstructured":"Canard, S., Devigne, J., Laguillaumie, F.: Improving the security of an efficient unidirectional proxy re-encryption scheme. Journal of Internet Services and Information Security\u00a01(2), 140\u2013160 (2011)","journal-title":"Journal of Internet Services and Information Security"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Canetti, R., Hohenberger, S.: Chosen-ciphertext secure proxy re-encryption. In: ACM Conference on Computer and Communications Security, pp. 185\u2013194. ACM Press (2007)","DOI":"10.1145\/1315245.1315269"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/978-3-642-12678-9_19","volume-title":"Progress in Cryptology \u2013 AFRICACRYPT 2010","author":"S.S.M. Chow","year":"2010","unstructured":"Chow, S.S.M., Weng, J., Yang, Y., Deng, R.H.: Efficient unidirectional proxy re-encryption. In: Bernstein, D.J., Lange, T. (eds.) AFRICACRYPT 2010. LNCS, vol.\u00a06055, pp. 316\u2013332. Springer, Heidelberg (2010)"},{"key":"18_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-89641-8_1","volume-title":"Cryptology and Network Security","author":"R.H. Deng","year":"2008","unstructured":"Deng, R.H., Weng, J., Liu, S., Chen, K.: Chosen-ciphertext secure proxy re-encryption without pairings. In: Franklin, M.K., Hui, L.C.K., Wong, D.S. (eds.) CANS 2008. LNCS, vol.\u00a05339, pp. 1\u201317. Springer, Heidelberg (2008)"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-48405-1_34","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"E. Fujisaki","year":"1999","unstructured":"Fujisaki, E., Okamoto, T.: Secure integration of asymmetric and symmetric encryption schemes. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 537\u2013554. Springer, Heidelberg (1999)"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-27954-6_22","volume-title":"Topics in Cryptology \u2013 CT-RSA 2012","author":"G. Hanaoka","year":"2012","unstructured":"Hanaoka, G., Kawai, Y., Kunihiro, N., Matsuda, T., Weng, J., Zhang, R., Zhao, Y.: Generic construction of chosen ciphertext secure proxy re-encryption. In: Dunkelman, O. (ed.) CT-RSA 2012. LNCS, vol.\u00a07178, pp. 349\u2013364. Springer, Heidelberg (2012)"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-642-25141-2_14","volume-title":"Advances in Information and Computer Security","author":"R. Hayashi","year":"2011","unstructured":"Hayashi, R., Matsushita, T., Yoshida, T., Fujii, Y., Okada, K.: Unforgeability of re-encryption keys against collusion attack in proxy re-encryption. In: Iwata, T., Nishigaki, M. (eds.) IWSEC 2011. LNCS, vol.\u00a07038, pp. 210\u2013229. Springer, Heidelberg (2011)"},{"key":"18_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-01001-9_18","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"D. Hofheinz","year":"2009","unstructured":"Hofheinz, D., Kiltz, E.: Practical chosen ciphertext secure encryption from factoring. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 313\u2013332. Springer, Heidelberg (2009)"},{"key":"18_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-36095-4_18","volume-title":"Topics in Cryptology \u2013 CT-RSA 2013","author":"T. Isshiki","year":"2013","unstructured":"Isshiki, T., Nguyen, M.H., Tanaka, K.: Proxy re-encryption in a stronger security model extended from CT-RSA2012. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol.\u00a07779, pp. 277\u2013292. Springer, Heidelberg (2013)"},{"key":"18_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/978-3-540-78440-1_21","volume-title":"Public Key Cryptography \u2013 PKC 2008","author":"B. Libert","year":"2008","unstructured":"Libert, B., Vergnaud, D.: Unidirectional chosen-ciphertext secure proxy re-encryption. In: Cramer, R. (ed.) PKC 2008. LNCS, vol.\u00a04939, pp. 360\u2013379. Springer, Heidelberg (2008)"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-642-13013-7_16","volume-title":"Public Key Cryptography \u2013 PKC 2010","author":"T. Matsuda","year":"2010","unstructured":"Matsuda, T., Nishimaki, R., Tanaka, K.: CCA proxy re-encryption without bilinear maps in the standard model. In: Nguyen, P.Q., Pointcheval, D. (eds.) PKC 2010. LNCS, vol.\u00a06056, pp. 261\u2013278. Springer, Heidelberg (2010)"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"C.P. Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptology\u00a04(3), 161\u2013174 (1991)","journal-title":"J. Cryptology"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Shamir, A.: On the generation of cryptographically strong pseudorandom sequences. ACM Trans. Comput. Syst.\u00a01(1) (1983)","DOI":"10.1145\/357353.357357"},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/978-3-642-14623-7_17","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"H. Wee","year":"2010","unstructured":"Wee, H.: Efficient chosen-ciphertext security via extractable hash proofs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol.\u00a06223, pp. 314\u2013332. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Provable Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41227-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T10:23:46Z","timestamp":1558607026000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41227-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642412264","9783642412271"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41227-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}