{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:33:28Z","timestamp":1757309608977,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642389795"},{"type":"electronic","value":"9783642389801"}],"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-38980-1_31","type":"book-chapter","created":{"date-parts":[[2013,6,20]],"date-time":"2013-06-20T18:26:48Z","timestamp":1371752808000},"page":"487-501","source":"Crossref","is-referenced-by-count":13,"title":["Leakage Resilient IBE and IPE under the DLIN Assumption"],"prefix":"10.1007","author":[{"given":"Kaoru","family":"Kurosawa","sequence":"first","affiliation":[]},{"given":"Le","family":"Trieu Phong","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert [16], pp. 553\u2013572","DOI":"10.1007\/978-3-642-13190-5_28"},{"key":"31_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, S., Freeman, D.M., Vaikuntanathan, V.: Functional encryption for inner product predicates from learning with errors. Cryptology ePrint Archive, Report 2011\/410 (2011), \n                    \n                      http:\/\/eprint.iacr.org\/\n                    \n                    \n                   (accepted to Asiacrypt 2011)","DOI":"10.1007\/978-3-642-25385-0_2"},{"key":"31_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-00457-5_28","volume-title":"Theory of Cryptography","author":"A. Akavia","year":"2009","unstructured":"Akavia, A., Goldwasser, S., Vaikuntanathan, V.: Simultaneous hardcore bits and cryptography against memory attacks. In: Reingold, O. (ed.) TCC 2009. LNCS, vol.\u00a05444, pp. 474\u2013495. Springer, Heidelberg (2009)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Alwen, J., Dodis, Y., Naor, M., Segev, G., Walfish, S., Wichs, D.: Public-key encryption in the bounded-retrieval model. In: Gilbert [16] pp. 113\u2013134","DOI":"10.1007\/978-3-642-13190-5_6"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-14496-7_1","volume-title":"Information Theoretic Security","author":"J. Alwen","year":"2010","unstructured":"Alwen, J., Dodis, Y., Wichs, D.: Survey: Leakage resilience and the bounded retrieval model. In: Kurosawa, K. (ed.) ICITS 2009. LNCS, vol.\u00a05973, pp. 1\u201318. Springer, Heidelberg (2010)"},{"key":"31_CR6","doi-asserted-by":"crossref","unstructured":"Bellare, M., Kiltz, E., Peikert, C., Waters, B.: Identity-based (lossy) trapdoor functions and applications. In: Pointcheval, Johansson [25], pp. 228\u2013245","DOI":"10.1007\/978-3-642-29011-4_15"},{"key":"31_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/978-3-642-01001-9_24","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M. Bellare","year":"2009","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: Simplified proof and improved concrete security for Waters\u2019 IBE scheme. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol.\u00a05479, pp. 407\u2013424. Springer, Heidelberg (2009)"},{"key":"31_CR8","doi-asserted-by":"crossref","unstructured":"Bellare, M., Waters, B., Yilek, S.: Identity-based encryption secure against selective opening attack. In: Ishai [17], pp. 235\u2013252","DOI":"10.1007\/978-3-642-19571-6_15"},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-540-28628-8_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X., Shacham, H.: Short group signatures. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol.\u00a03152, pp. 41\u201355. Springer, Heidelberg (2004)"},{"issue":"4","key":"31_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/s00145-004-0314-9","volume":"17","author":"D. Boneh","year":"2004","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the Weil pairing. J. Cryptology\u00a017(4), 297\u2013319 (2004)","journal-title":"J. Cryptology"},{"key":"31_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1007\/978-3-540-70936-7_29","volume-title":"Theory of Cryptography","author":"D. Boneh","year":"2007","unstructured":"Boneh, D., Waters, B.: Conjunctive, subset, and range queries on encrypted data. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol.\u00a04392, pp. 535\u2013554. Springer, Heidelberg (2007)"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Kalai, Y.T., Katz, J., Vaikuntanathan, V.: Overcoming the hole in the bucket: Public-key cryptography resilient to continual memory leakage. In: Trevisan [27], pp. 501\u2013510, Full version available at \n                    \n                      http:\/\/eprint.iacr.org\/2010\/278.pdf","DOI":"10.1109\/FOCS.2010.55"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert [16], pp. 523\u2013552","DOI":"10.1007\/978-3-642-13190-5_27"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"Chow, S.S.M., Dodis, Y., Rouselakis, Y., Waters, B.: Practical leakage-resilient identity-based encryption from simple assumptions. In: Al-Shaer, E., Keromytis, A.D., Shmatikov, V. (eds.) ACM Conference on Computer and Communications Security, pp. 152\u2013161. ACM (2010)","DOI":"10.1145\/1866307.1866325"},{"key":"31_CR15","unstructured":"Dodis, Y., Haralambiev, K., L\u00f3pez-Alt, A., Wichs, D.: Cryptography against continuous memory attacks. In: Trevisan [27], pp. 511\u2013520"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","year":"2010","unstructured":"Gilbert, H. (ed.): EUROCRYPT 2010. LNCS, vol.\u00a06110. Springer, Heidelberg (2010)"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Theory of Cryptography","year":"2011","unstructured":"Ishai, Y. (ed.): TCC 2011. LNCS, vol.\u00a06597. Springer, Heidelberg (2011)"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-78967-3_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"J. Katz","year":"2008","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 146\u2013162. Springer, Heidelberg (2008)"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Lewko, A.B.: Tools for simulating features of composite order bilinear groups in the prime order setting. In: Pointcheval, Johansson [25], pp. 318\u2013335","DOI":"10.1007\/978-3-642-29011-4_20"},{"key":"31_CR20","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Okamoto, T., Sahai, A., Takashima, K., Waters, B.: Fully secure functional encryption: Attribute-based encryption and (hierarchical) inner product encryption. In: Gilbert [16], pp. 62\u201391","DOI":"10.1007\/978-3-642-13190-5_4"},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"Lewko, A.B., Rouselakis, Y., Waters, B.: Achieving leakage resilience through dual system encryption. In: Ishai [17], pp. 70\u201388","DOI":"10.1007\/978-3-642-19571-6_6"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1007\/978-3-642-03356-8_2","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"M. Naor","year":"2009","unstructured":"Naor, M., Segev, G.: Public-key cryptosystems resilient to key leakage. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol.\u00a05677, pp. 18\u201335. Springer, Heidelberg (2009), Full version available at \n                    \n                      http:\/\/research.microsoft.com\/en-us\/um\/people\/gilse\/papers\/KeyLeakage.pdf"},{"key":"31_CR23","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":"31_CR24","doi-asserted-by":"crossref","unstructured":"Okamoto, T., Takashima, K.: Adaptively attribute-hiding (hierarchical) inner product encryption. In: Pointcheval, Johansson [25], pp. 591\u2013608","DOI":"10.1007\/978-3-642-29011-4_35"},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","first-page":"2012","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","year":"2012","unstructured":"Pointcheval, D., Johansson, T. (eds.): EUROCRYPT 2012. LNCS, vol.\u00a07237, pp. 2012\u20132031. Springer, Heidelberg (2012)"},{"key":"31_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-39568-7_5","volume-title":"Advances in Cryptology","author":"A. Shamir","year":"1985","unstructured":"Shamir, A.: Identity-based cryptosystems and signature schemes. In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol.\u00a0196, pp. 47\u201353. Springer, Heidelberg (1985)"},{"key":"31_CR27","unstructured":"Trevisan, L. (ed.): 51th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2010, Las Vegas, Nevada, USA, October 23-26, 2010. IEEE Computer Society (2010)"},{"key":"31_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11426639_7","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"B. Waters","year":"2005","unstructured":"Waters, B.: Efficient identity-based encryption without random oracles. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol.\u00a03494, pp. 114\u2013127. Springer, Heidelberg (2005)"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Yuen, T.H., Chow, S.S.M., Zhang, Y., Yiu, S.M.: Identity-based encryption resilient to continual auxiliary leakage. In: Pointcheval, Johansson [25], pp. 117\u2013134","DOI":"10.1007\/978-3-642-29011-4_9"}],"container-title":["Lecture Notes in Computer Science","Applied Cryptography and Network Security"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38980-1_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:35:39Z","timestamp":1558301739000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38980-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642389795","9783642389801"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38980-1_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}