{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:57:53Z","timestamp":1743105473652,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":39,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819780129"},{"type":"electronic","value":"9789819780136"}],"license":[{"start":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T00:00:00Z","timestamp":1727827200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T00:00:00Z","timestamp":1727827200000},"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":[[2025]]},"DOI":"10.1007\/978-981-97-8013-6_5","type":"book-chapter","created":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T09:02:02Z","timestamp":1727859722000},"page":"101-122","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Compact Post-quantum Bounded-Collusion Identity-Based Encryption"],"prefix":"10.1007","author":[{"given":"Shingo","family":"Sato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junji","family":"Shikata","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,2]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1007\/s00145-007-9006-6","volume":"21","author":"M Abdalla","year":"2008","unstructured":"Abdalla, M., et al.: Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions. J. Cryptol. 21(3), 350\u2013391 (2008)","journal-title":"J. Cryptol."},{"key":"5_CR2","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). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_28"},{"key":"5_CR3","unstructured":"Albrecht, M.R., et al.: Classic McEliece (2024). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"issue":"3\u20134","key":"5_CR4","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1561\/0100000099","volume":"15","author":"M Aldridge","year":"2019","unstructured":"Aldridge, M., Johnson, O., Scarlett, J.: Group testing: an information theory perspective. Found. Trends Commun. Inf. Theory 15(3\u20134), 196\u2013392 (2019)","journal-title":"Found. Trends Commun. Inf. Theory"},{"key":"5_CR5","unstructured":"Aragon, N., et al.: BIKE (2024). https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-540-28628-8_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2004","author":"D Boneh","year":"2004","unstructured":"Boneh, D., Boyen, X.: Secure identity based encryption without random oracles. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 443\u2013459. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28628-8_27"},{"issue":"5","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1301","DOI":"10.1137\/S009753970544713X","volume":"36","author":"D Boneh","year":"2007","unstructured":"Boneh, D., Canetti, R., Halevi, S., Katz, J.: Chosen-ciphertext security from identity-based encryption. SIAM J. Comput. 36(5), 1301\u20131328 (2007)","journal-title":"SIAM J. Comput."},{"key":"5_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3-540-44647-8_13","volume-title":"Advances in Cryptology \u2014 CRYPTO 2001","author":"D Boneh","year":"2001","unstructured":"Boneh, D., Franklin, M.: Identity-based encryption from the weil pairing. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 213\u2013229. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44647-8_13"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Bos, J.W., et al.: CRYSTALS - Kyber: a CCA-secure module-lattice-based KEM. In: EuroS &P, pp. 353\u2013367. IEEE (2018)","DOI":"10.1109\/EuroSP.2018.00032"},{"key":"5_CR10","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). https:\/\/doi.org\/10.1007\/978-3-642-13190-5_27"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1007\/978-3-319-76953-0_23","volume-title":"Topics in Cryptology \u2013 CT-RSA 2018","author":"D Chang","year":"2018","unstructured":"Chang, D., Chauhan, A.K., Kumar, S., Sanadhya, S.K.: Revocable identity-based encryption from codes with rank metric. In: Smart, N.P. (ed.) CT-RSA 2018. LNCS, vol. 10808, pp. 435\u2013451. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76953-0_23"},{"key":"5_CR12","doi-asserted-by":"crossref","unstructured":"Cheraghchi, M., Nakos, V.: Combinatorial group testing and sparse recovery schemes with near-optimal decoding time. In: FOCS, pp. 1203\u20131213. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00115"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/978-3-030-31578-8_25","volume-title":"Cryptology and Network Security","author":"KY Choi","year":"2019","unstructured":"Choi, K.Y., Kim, E., Yoon, H., Moon, D., Cho, J.: Generic construction of bounded-collusion IBE via table-based id-to-key map. In: Mu, Y., Deng, R.H., Huang, X. (eds.) CANS 2019. LNCS, vol. 11829, pp. 457\u2013469. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31578-8_25"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-03326-2_3","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"T Debris-Alazard","year":"2018","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Two attacks on rank metric code-based schemes: RankSign and an IBE scheme. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11272, pp. 62\u201392. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03326-2_3"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/3-540-46035-7_5","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"Y Dodis","year":"2002","unstructured":"Dodis, Y., Katz, J., Xu, S., Yung, M.: Key-insulated public key cryptosystems. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 65\u201382. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_5"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1214\/aoms\/1177731363","volume":"14","author":"R Dorfman","year":"1943","unstructured":"Dorfman, R.: The detection of defective members of large populations. Ann. Math. Stat. 14(4), 436\u2013440 (1943)","journal-title":"Ann. Math. Stat."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Du, D.Z., Hwang, F.K.: Combinatorial Group Testing and Its Applications. Series on Applied Mathematics, 2nd edn, vol.\u00a012. World Scientific (2000)","DOI":"10.1142\/9789812798107"},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/978-3-319-63697-9_7","volume-title":"Advances in Cryptology \u2013 CRYPTO 2017","author":"P Gaborit","year":"2017","unstructured":"Gaborit, P., Hauteville, A., Phan, D.H., Tillich, J.-P.: Identity-based encryption from codes with rank metric. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017. LNCS, vol. 10403, pp. 194\u2013224. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63697-9_7"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: STOC, pp. 197\u2013206. ACM (2008)","DOI":"10.1145\/1374376.1374407"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-642-28914-9_32","volume-title":"Theory of Cryptography","author":"S Goldwasser","year":"2012","unstructured":"Goldwasser, S., Lewko, A., Wilson, D.A.: Bounded-collusion IBE from key homomorphism. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 564\u2013581. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28914-9_32"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/978-3-031-07082-2_15","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"P Grubbs","year":"2022","unstructured":"Grubbs, P., Maram, V., Paterson, K.G.: Anonymous, robust post-quantum public key encryption. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 402\u2013432. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_15"},{"issue":"339","key":"5_CR22","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1080\/01621459.1972.10481257","volume":"67","author":"FK Hwang","year":"1972","unstructured":"Hwang, F.K.: A method for detecting all defective members in a population by group testing. J. Am. Stat. Assoc. 67(339), 605\u2013608 (1972)","journal-title":"J. Am. Stat. Assoc."},{"issue":"9","key":"5_CR23","doi-asserted-by":"publisher","first-page":"5592","DOI":"10.1109\/TIT.2019.2902397","volume":"65","author":"HA Inan","year":"2019","unstructured":"Inan, H.A., Kairouz, P., Wootters, M., \u00d6zg\u00fcr, A.: On the optimality of the Kautz-singleton construction in probabilistic group testing. IEEE Trans. Inf. Theory 65(9), 5592\u20135603 (2019)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Indyk, P., Ngo, H.Q., Rudra, A.: Efficiently decodable non-adaptive group testing. In: SODA, pp. 1126\u20131142. SIAM (2010)","DOI":"10.1137\/1.9781611973075.91"},{"issue":"4","key":"5_CR25","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1109\/TIT.1964.1053689","volume":"10","author":"WH Kautz","year":"1964","unstructured":"Kautz, W.H., Singleton, R.C.: Nonrandom binary superimposed codes. IEEE Trans. Inf. Theory 10(4), 363\u2013377 (1964)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"298","key":"5_CR26","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/01621459.1962.10480672","volume":"57","author":"CH Li","year":"1962","unstructured":"Li, C.H.: A sequential method for screening experimental variables. J. Am. Stat. Assoc. 57(298), 455\u2013477 (1962)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"5_CR27","first-page":"84","volume":"23","author":"MB Malyutov","year":"1978","unstructured":"Malyutov, M.B.: The separating property of random matrices. Math. Notes Acad. Sci. USSR 23(1), 84\u201391 (1978)","journal-title":"Math. Notes Acad. Sci. USSR"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-31368-4_1","volume-title":"Public-Key Cryptography - PKC 2023","author":"V Maram","year":"2023","unstructured":"Maram, V., Xagawa, K.: Post-quantum anonymity of Kyber. In: Boldyreva, A., Kolesnikov, V. (eds.) PKC 2023. LNCS, vol. 13940, pp. 3\u201335. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-31368-4_1"},{"key":"5_CR29","unstructured":"Melchor, C.A., et al.: HQC (2024), https:\/\/csrc.nist.gov\/Projects\/post-quantum-cryptography\/round-4-submissions"},{"key":"5_CR30","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). https:\/\/doi.org\/10.1007\/978-3-642-29011-4_41"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-642-22006-7_47","volume-title":"Automata, Languages and Programming","author":"HQ Ngo","year":"2011","unstructured":"Ngo, H.Q., Porat, E., Rudra, A.: Efficiently decodable error-correcting list disjunct matrices and applications - (extended abstract). In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 557\u2013568. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_47"},{"issue":"1\u20133","key":"5_CR32","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10623-008-9175-9","volume":"49","author":"R Nojima","year":"2008","unstructured":"Nojima, R., Imai, H., Kobara, K., Morozov, K.: Semantic security for the McEliece cryptosystem without random oracles. Des. Codes Cryptogr. 49(1\u20133), 289\u2013305 (2008)","journal-title":"Des. Codes Cryptogr."},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"748","DOI":"10.1007\/978-3-540-70575-8_61","volume-title":"Automata, Languages and Programming","author":"E Porat","year":"2008","unstructured":"Porat, E., Rothschild, A.: Explicit non-adaptive combinatorial group testing schemes. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008. LNCS, vol. 5125, pp. 748\u2013759. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70575-8_61"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"300","DOI":"10.1137\/0108018","volume":"8","author":"IS Reed","year":"1960","unstructured":"Reed, I.S., Solomon, G.: Polynomial codes over certain finite fields. J. Soc. Ind. Appl. Math. 8(2), 300\u2013304 (1960)","journal-title":"J. Soc. Ind. Appl. Math."},{"key":"5_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-642-20465-4_4","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2011","author":"D Stehl\u00e9","year":"2011","unstructured":"Stehl\u00e9, D., Steinfeld, R.: Making NTRU as secure as worst-case problems over ideal lattices. In: Paterson, K.G. (ed.) EUROCRYPT 2011. LNCS, vol. 6632, pp. 27\u201347. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20465-4_4"},{"key":"5_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/978-3-642-54631-0_15","volume-title":"Public-Key Cryptography \u2013 PKC 2014","author":"S Tessaro","year":"2014","unstructured":"Tessaro, S., Wilson, D.A.: Bounded-collusion identity-based encryption from semantically-secure public-key encryption: generic constructions with short ciphertexts. In: Krawczyk, H. (ed.) PKC 2014. LNCS, vol. 8383, pp. 257\u2013274. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54631-0_15"},{"key":"5_CR37","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1186\/1471-2105-7-28","volume":"7","author":"N Thierry-Mieg","year":"2006","unstructured":"Thierry-Mieg, N.: A new pooling strategy for high-throughput screening: the shifted transversal design. BMC Bioinform. 7, 28 (2006)","journal-title":"BMC Bioinform."},{"key":"5_CR38","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). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_36"},{"key":"5_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/978-3-031-07082-2_20","volume-title":"Advances in Cryptology - EUROCRYPT 2022","author":"K Xagawa","year":"2022","unstructured":"Xagawa, K.: Anonymity of NIST PQC round 3 KEMs. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13277, pp. 551\u2013581. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07082-2_20"}],"container-title":["Lecture Notes in Computer Science","Cryptology and Network Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-8013-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T09:02:28Z","timestamp":1727859748000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-8013-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,2]]},"ISBN":["9789819780129","9789819780136"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-8013-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,2]]},"assertion":[{"value":"2 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CANS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Cryptology and Network Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambridge","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 September 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cans2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2024.cansconference.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}