{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:01:20Z","timestamp":1743008480528,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":44,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662538890"},{"type":"electronic","value":"9783662538906"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53890-6_22","type":"book-chapter","created":{"date-parts":[[2016,11,8]],"date-time":"2016-11-08T12:11:32Z","timestamp":1478607092000},"page":"655-681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["D\u00e9j\u00e0 Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions"],"prefix":"10.1007","author":[{"given":"Melissa","family":"Chase","sequence":"first","affiliation":[]},{"given":"Mary","family":"Maller","sequence":"additional","affiliation":[]},{"given":"Sarah","family":"Meiklejohn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,9]]},"reference":[{"key":"22_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"554","DOI":"10.1007\/978-3-642-01001-9_32","volume-title":"Advances in Cryptology - EUROCRYPT 2009","author":"M Abdalla","year":"2009","unstructured":"Abdalla, M., Catalano, D., Fiore, D.: Verifiable random functions from identity-based key encapsulation. In: Joux, A. (ed.) EUROCRYPT 2009. LNCS, vol. 5479, pp. 554\u2013571. Springer, Heidelberg (2009). doi:10.1007\/978-3-642-01001-9_32"},{"issue":"3","key":"22_CR2","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/s00145-013-9153-x","volume":"27","author":"M Abdalla","year":"2014","unstructured":"Abdalla, M., Catalano, D., Fiore, D.: Verifiable random functions: relations to identity-based key encapsulation and new constructions. J. Cryptology 27(3), 544\u2013593 (2014)","journal-title":"J. Cryptology"},{"key":"22_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/978-3-662-44371-2_14","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"M Abe","year":"2014","unstructured":"Abe, M., Groth, J., Ohkubo, M., Tango, T.: Converting cryptographic schemes from symmetric to asymmetric bilinear groups. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 241\u2013260. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44371-2_14"},{"key":"22_CR4","doi-asserted-by":"crossref","unstructured":"Akinyele, J.A., Garman, C., Hohenberger, S., Automating fast, secure translations from type-I to type-III pairing schemes. In: Ray, I., Li, N., Kruegel, C. (eds.), ACM CCS 15, pp. 1370\u20131381, Denver, CO, USA. ACM Press, 12\u201316 October 2015","DOI":"10.1145\/2810103.2813601"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/978-3-662-48797-6_22","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"N Attrapadung","year":"2015","unstructured":"Attrapadung, N., Hanaoka, G., Yamada, S.: A framework for identity-based encryption with almost tight security. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 521\u2013549. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48797-6_22"},{"key":"22_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1007\/978-3-662-46494-6_26","volume-title":"Theory of Cryptography","author":"C Bader","year":"2015","unstructured":"Bader, C., Hofheinz, D., Jager, T., Kiltz, E., Li, Y.: Tightly-secure authenticated key exchange. In: Dodis, Y., Nielsen, J.B. (eds.) TCC 2015. LNCS, vol. 9014, pp. 629\u2013658. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46494-6_26"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/3-540-68339-9_34","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1996","author":"M Bellare","year":"1996","unstructured":"Bellare, M., Rogaway, P.: The exact security of digital signatures-how to sign with RSA and Rabin. In: Maurer, U. (ed.) EUROCRYPT 1996. LNCS, vol. 1070, pp. 399\u2013416. Springer, Heidelberg (1996). doi:10.1007\/3-540-68339-9_34"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-19571-6_15","volume-title":"Theory of Cryptography","author":"M Bellare","year":"2011","unstructured":"Bellare, M., Waters, B., Yilek, S.: Identity-based encryption secure against selective opening attack. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 235\u2013252. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-19571-6_15"},{"key":"22_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-662-44371-2_23","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","author":"O Blazy","year":"2014","unstructured":"Blazy, O., Kiltz, E., Pan, J.: (Hierarchical) identity-based encryption from affine message authentication. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014. LNCS, vol. 8616, pp. 408\u2013425. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-44371-2_23"},{"key":"22_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Short signatures without random Oracles. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 56\u201373. Springer, Heidelberg (2004). doi:10.1007\/978-3-540-24676-3_4"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1007\/11426639_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Boyen, X., Goh, E.-J.: Hierarchical identity based encryption with constant size ciphertext. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 440\u2013456. Springer, Heidelberg (2005). doi:10.1007\/11426639_26"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/11535218_16","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Gentry, C., Waters, B.: Collusion resistant broadcast encryption with short ciphertexts and private keys. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 258\u2013275. Springer, Heidelberg (2005). doi:10.1007\/11535218_16"},{"key":"22_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.-J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 325\u2013341. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-30576-7_18"},{"issue":"5","key":"22_CR14","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1016\/j.jnt.2010.05.001","volume":"131","author":"D Boneh","year":"2011","unstructured":"Boneh, D., Rubin, K., Silverberg, A.: Finding ordinary composite order elliptic curves using the Cocks-Pinch method. J. Number Theory 131(5), 832\u2013841 (2011)","journal-title":"J. Number Theory"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-540-85538-5_3","volume-title":"Pairing-Based Cryptography \u2013 Pairing 2008","author":"X Boyen","year":"2008","unstructured":"Boyen, X.: The uber-assumption family. In: Galbraith, S.D., Paterson, K.G. (eds.) Pairing 2008. LNCS, vol. 5209, pp. 39\u201356. Springer, Heidelberg (2008). doi:10.1007\/978-3-540-85538-5_3"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/11818175_17","volume-title":"Advances in Cryptology - CRYPTO 2006","author":"X Boyen","year":"2006","unstructured":"Boyen, X., Waters, B.: Anonymous hierarchical identity-based encryption (Without Random Oracles). In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 290\u2013307. Springer, Heidelberg (2006). doi:10.1007\/11818175_17"},{"key":"22_CR17","doi-asserted-by":"crossref","unstructured":"Chase, M., Maller, M., Meiklejohn, S.: D\u00e9j\u00e0 Q all over again: tighter and broader reductions of q-type assumptions. Cryptology ePrint Archive, Report 2016\/840 (2016). https:\/\/eprint.iacr.org\/2016\/840","DOI":"10.1007\/978-3-662-53890-6_22"},{"key":"22_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-642-55220-5_34","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2014","author":"M Chase","year":"2014","unstructured":"Chase, M., Meiklejohn, S.: D\u00e9j\u00e0 Q: using dual systems to revisit q-type assumptions. In: Nguyen, P.Q., Oswald, E. (eds.) EUROCRYPT 2014. LNCS, vol. 8441, pp. 622\u2013639. Springer, Heidelberg (2014). doi:10.1007\/978-3-642-55220-5_34"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Chase, M., Meiklejohn, S.: D\u00e9j\u00e0 Q: using dual systems to revisit q-type assumptions. Cryptology ePrint Archive, Report 2014\/570 (2014). http:\/\/eprint.iacr.org\/2014\/570","DOI":"10.1007\/978-3-642-55220-5_34"},{"key":"22_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-662-46803-6_20","volume-title":"Advances in Cryptology - EUROCRYPT 2015","author":"J Chen","year":"2015","unstructured":"Chen, J., Gay, R., Wee, H.: Improved dual system ABE in prime-order groups via predicate encodings. In: Oswald, E., Fischlin, M. (eds.) EUROCRYPT 2015. LNCS, vol. 9057, pp. 595\u2013624. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46803-6_20"},{"key":"22_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-642-40084-1_25","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J Chen","year":"2013","unstructured":"Chen, J., Wee, H.: Fully, (Almost) tightly secure IBE and dual system groups. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 435\u2013460. Springer, Heidelberg (2013). doi:10.1007\/978-3-642-40084-1_25"},{"key":"22_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11761679_1","volume-title":"Advances in Cryptology - EUROCRYPT 2006","author":"JH Cheon","year":"2006","unstructured":"Cheon, J.H.: Security analysis of the strong Diffie-Hellman problem. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 1\u201311. Springer, Heidelberg (2006). doi:10.1007\/11761679_1"},{"key":"22_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/978-3-540-30580-4_28","volume-title":"Public Key Cryptography - PKC 2005","author":"Y Dodis","year":"2005","unstructured":"Dodis, Y., Yampolskiy, A.: A verifiable random function with short proofs and keys. In: Vaudenay, S. (ed.) PKC 2005. LNCS, vol. 3386, pp. 416\u2013431. Springer, Heidelberg (2005). doi:10.1007\/978-3-540-30580-4_28"},{"key":"22_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-49890-3_1","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"R Gay","year":"2016","unstructured":"Gay, R., Hofheinz, D., Kiltz, E., Wee, H.: Tightly CCA-secure encryption without pairings. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9665, pp. 1\u201327. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49890-3_1"},{"key":"22_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/978-3-642-34961-4_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"M Gerbush","year":"2012","unstructured":"Gerbush, M., Lewko, A., O\u2019Neill, A., Waters, B.: Dual Form Signatures: an approach for proving security from static assumptions. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 25\u201342. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-34961-4_4"},{"key":"22_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1007\/978-3-662-49096-9_21","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2016","unstructured":"Goldwasser, S., Tauman Kalai, Y.: Cryptographic Assumptions: a position paper. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9562, pp. 505\u2013522. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49096-9_21"},{"key":"22_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1007\/978-3-642-25385-0_4","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2011","author":"B Hemenway","year":"2011","unstructured":"Hemenway, B., Libert, B., Ostrovsky, R., Vergnaud, D.: Lossy Encryption: constructions from general assumptions and efficient selective opening chosen ciphertext security. In: Lee, D.H., Wang, X. (eds.) ASIACRYPT 2011. LNCS, vol. 7073, pp. 70\u201388. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-25385-0_4"},{"key":"22_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-642-32009-5_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"D Hofheinz","year":"2012","unstructured":"Hofheinz, D., Jager, T.: Tightly secure signatures and public-key encryption. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 590\u2013607. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-32009-5_35"},{"key":"22_CR29","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:10.1007\/978-3-642-29011-4_20"},{"key":"22_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/978-3-662-46447-2_17","volume-title":"Public-Key Cryptography \u2013 PKC 2015","author":"A Lewko","year":"2015","unstructured":"Lewko, A., Meiklejohn, S.: A Profitable Sub-prime Loan: obtaining the advantages of composite order in prime-order bilinear groups. In: Katz, J. (ed.) PKC 2015. LNCS, vol. 9020, pp. 377\u2013398. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-46447-2_17"},{"key":"22_CR31","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. 6110, pp. 62\u201391. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-13190-5_4"},{"key":"22_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-642-11799-2_27","volume-title":"Theory of Cryptography","author":"A Lewko","year":"2010","unstructured":"Lewko, A., Waters, B.: New techniques for dual system encryption and fully secure HIBE with short ciphertexts. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 455\u2013479. Springer, Heidelberg (2010). doi:10.1007\/978-3-642-11799-2_27"},{"key":"22_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-20465-4_31","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Decentralizing attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 568\u2013588. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20465-4_31"},{"key":"22_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1007\/978-3-642-20465-4_30","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"A Lewko","year":"2011","unstructured":"Lewko, A., Waters, B.: Unbounded HIBE and attribute-based encryption. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 547\u2013567. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-20465-4_30"},{"key":"22_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-662-45608-8_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2014","author":"B Libert","year":"2014","unstructured":"Libert, B., Joye, M., Yung, M., Peters, T.: Concise multi-challenge CCA-secure encryption and signatures with almost tight security. In: Sarkar, P., Iwata, T. (eds.) ASIACRYPT 2014. LNCS, vol. 8874, pp. 1\u201321. Springer, Heidelberg (2014). doi:10.1007\/978-3-662-45608-8_1"},{"key":"22_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/978-3-662-48797-6_28","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"B Libert","year":"2015","unstructured":"Libert, B., Peters, T., Joye, M., Yung, M.: Compactly hiding linear spans. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 681\u2013707. Springer, Heidelberg (2015). doi:10.1007\/978-3-662-48797-6_28"},{"key":"22_CR37","unstructured":"Meiklejohn, S., Shacham, H.: New trapdoor projection maps for composite-order bilinear groups. Cryptology ePrint Archive, Report 2013\/657 (2013). http:\/\/eprint.iacr.org\/2013\/657"},{"issue":"1","key":"22_CR38","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1587\/transfun.E96.A.42","volume":"96\u2013A","author":"T Okamoto","year":"2013","unstructured":"Okamoto, T., Takashima, K.: Efficient (hierarchical) inner-product encryption tightly reduced from the decisional linear assumption. IEICE Trans. 96\u2013A(1), 42\u201352 (2013)","journal-title":"IEICE Trans."},{"key":"22_CR39","doi-asserted-by":"crossref","unstructured":"Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) 40th ACM STOC, pp. 187\u2013196, Victoria, British Columbia, Canada. ACM Press, 17\u201320 May 2008","DOI":"10.1145\/1374376.1374406"},{"key":"22_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 1997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). doi:10.1007\/3-540-69053-0_18"},{"key":"22_CR41","unstructured":"Waters, B.: Ciphertext-policy attribute-based encryption: an expressive, efficient, and provably secure realization. Cryptology ePrint Archive, Report 2008\/290 (2008). http:\/\/eprint.iacr.org\/2008\/290"},{"key":"22_CR42","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:10.1007\/978-3-642-03356-8_36"},{"key":"22_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/978-3-642-19379-8_4","volume-title":"Public Key Cryptography \u2013 PKC 2011","author":"B Waters","year":"2011","unstructured":"Waters, B.: Ciphertext-Policy Attribute-Based Encryption: an expressive, efficient, and provably secure realization. In: Catalano, D., Fazio, N., Gennaro, R., Nicolosi, A. (eds.) PKC 2011. LNCS, vol. 6571, pp. 53\u201370. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-19379-8_4"},{"key":"22_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-49099-0_9","volume-title":"Theory of Cryptography","author":"H Wee","year":"2016","unstructured":"Wee, H.: D\u00e9j\u00e0 Q: Encore! Un Petit IBE. In: Kushilevitz, E., Malkin, T. (eds.) TCC 2016. LNCS, vol. 9563, pp. 237\u2013258. Springer, Heidelberg (2016). doi:10.1007\/978-3-662-49099-0_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2016"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-53890-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:41:46Z","timestamp":1709822506000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-53890-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662538890","9783662538906"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53890-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 November 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hanoi","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vietnam","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.asiacrypt2016.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}