{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:37:17Z","timestamp":1758274637983},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319641997"},{"type":"electronic","value":"9783319642000"}],"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-64200-0_13","type":"book-chapter","created":{"date-parts":[[2017,7,26]],"date-time":"2017-07-26T08:58:41Z","timestamp":1501059521000},"page":"215-230","source":"Crossref","is-referenced-by-count":0,"title":["Deterministic Identity-Based Encryption from Lattices with More Compact Public Parameters"],"prefix":"10.1007","author":[{"given":"Daode","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Fuyang","family":"Fang","sequence":"additional","affiliation":[]},{"given":"Bao","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/978-3-642-13190-5_28","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"S Agrawal","year":"2010","unstructured":"Agrawal, S., Boneh, D., Boyen, X.: Efficient lattice (H)IBE in the standard model. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 553\u2013572. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_28"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-48523-6_1","volume-title":"Automata, Languages and Programming","author":"M Ajtai","year":"1999","unstructured":"Ajtai, M.: Generating hard instances of the short basis problem. In: Wiedermann, J., Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 1\u20139. Springer, Heidelberg (1999). doi: 10.1007\/3-540-48523-6_1"},{"key":"13_CR3","unstructured":"Alwen, J., Peikert, C.: Generating shorter bases for hard random lattices. In: STACS 2009, pp. 75\u201386 (2009)"},{"key":"13_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29011-4_15","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"M Bellare","year":"2012","unstructured":"Bellare, M., Kiltz, E., Peikert, C., Waters, B.: Identity-based (lossy) trapdoor functions and applications. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 228\u2013245. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_15"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-662-49096-9_9","volume-title":"Theory of Cryptography","author":"A Bogdanov","year":"2016","unstructured":"Bogdanov, A., Guo, S., Masny, D., Richelson, S., Rosen, A.: On the hardness of learning with rounding over small modulus. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 209\u2013224. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49096-9_9"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-642-13190-5_27","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2010","author":"D Cash","year":"2010","unstructured":"Cash, D., Hofheinz, D., Kiltz, E., Peikert, C.: Bonsai trees, or how to delegate a lattice basis. In: Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 523\u2013552. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13190-5_27"},{"issue":"1","key":"13_CR7","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1137\/060651380","volume":"38","author":"Y Dodis","year":"2008","unstructured":"Dodis, Y., Ostrovsky, R., Reyzin, L., Smith, A.D.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97\u2013139 (2008)","journal-title":"SIAM J. Comput."},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-54631-0_14","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"A Escala","year":"2014","unstructured":"Escala, A., Herranz, J., Libert, B., R\u00e0fols, C.: Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 239\u2013256. Springer, Heidelberg (2014). doi: 10.1007\/978-3-642-54631-0_14"},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Fang, F., Li, B., Xianhui, L., Liu, Y., Jia, D., Xue, H.: (Deterministic) Hierarchical identity-based encryption from learning with rounding over small modulus. In: AsiaCCS 2016, pp. 907\u2013912 (2016)","DOI":"10.1145\/2897845.2897922"},{"key":"13_CR10","unstructured":"Goldwasser, S., Kalai, Y.T., Peikert, C., Vaikuntanathan, V.: Robustness of the learning with errors assumption. In: ICS 2010, pp. 230\u2013240 (2010)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-46497-7_5","volume-title":"Theory of Cryptography","author":"T Jager","year":"2015","unstructured":"Jager, T.: Verifiable random functions from weaker assumptions. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9015, pp. 121\u2013143. Springer, Heidelberg (2015). doi: 10.1007\/978-3-662-46497-7_5"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1007\/978-3-662-53890-6_23","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2016","author":"S Katsumata","year":"2016","unstructured":"Katsumata, S., Yamada, S.: Partitioning via non-linear polynomial functions: more compact ibes from ideal lattices and bilinear maps. In: Cheon, J.H., Takagi, T. (eds.) ASIACRYPT 2016. LNCS, vol. 10032, pp. 682\u2013712. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53890-6_23"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/978-3-642-29011-4_41","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2012","author":"D Micciancio","year":"2012","unstructured":"Micciancio, D., Peikert, C.: Trapdoors for lattices: simpler, tighter, faster, smaller. In: Pointcheval, D., Johansson, T. (eds.) EUROCRYPT 2012. LNCS, vol. 7237, pp. 700\u2013718. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-29011-4_41"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: STOC 2005, pp. 84\u201393 (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"13_CR15","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: Blakley, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196, pp. 47\u201353. Springer, Heidelberg (1985). doi: 10.1007\/3-540-39568-7_5"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-32928-9_1","volume-title":"Security and Cryptography for Networks","author":"X Xie","year":"2012","unstructured":"Xie, X., Xue, R., Zhang, R.: Deterministic public key encryption and identity-based encryption from lattices in the auxiliary-input setting. In: Visconti, I., Prisco, R. (eds.) SCN 2012. LNCS, vol. 7485, pp. 1\u201318. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-32928-9_1"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-662-49896-5_2","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"S Yamada","year":"2016","unstructured":"Yamada, S.: Adaptively secure identity-based encryption from lattices with asymptotically shorter public parameters. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 32\u201362. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-49896-5_2"},{"key":"13_CR18","unstructured":"Yamada, S.: Asymptotically compact adaptively secure lattice ibes and verifiable random functions via generalized partitioning techniques. Cryptology ePrint Archive, Report 2017\/096 (2017). http:\/\/eprint.iacr.org\/2017\/096"},{"key":"13_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-662-53015-3_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"J Zhang","year":"2016","unstructured":"Zhang, J., Chen, Y., Zhang, Z.: Programmable hash functions from lattices: short signatures and IBEs with small key sizes. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 303\u2013332. Springer, Heidelberg (2016). doi: 10.1007\/978-3-662-53015-3_11"}],"container-title":["Lecture Notes in Computer Science","Advances in Information and Computer Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64200-0_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,1]],"date-time":"2019-10-01T12:38:18Z","timestamp":1569933498000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64200-0_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319641997","9783319642000"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64200-0_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}