{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T22:59:27Z","timestamp":1773269967178,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":25,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819562022","type":"print"},{"value":"9789819562039","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-6203-9_4","type":"book-chapter","created":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T02:27:00Z","timestamp":1767320820000},"page":"66-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive Batched K-out-of-N Oblivious Transfers Extension"],"prefix":"10.1007","author":[{"given":"Zhaoyi","family":"Liu","sequence":"first","affiliation":[]},{"given":"Huijie","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Shen","sequence":"additional","affiliation":[]},{"given":"Jianfei","family":"Sun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,1,2]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Badrinarayanan, S., Miao, P., Shi, X., Tromanhauser, M., Zeng, R.: Updatable private set intersection revisited: extended functionalities, deletion, and worst-case complexity. Cryptology ePrint Archive, Paper 2024\/1446 (2024)","DOI":"10.1007\/978-981-96-0938-3_7"},{"key":"4_CR2","unstructured":"Bienstock, A., Patel, S., Seo, J.Y., Yeo, K.: Near-optimal oblivious key-value stores for efficient PSI, PSU and volume-hiding multi-maps. Cryptology ePrint Archive, Paper 2023\/903 (2023)"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Aranha, D.F., Lin, C., Orlandi, C., Simkin, M.: Laconic private set-intersection from pairings. In: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS \u201922, pp. 111\u2013124. Association for Computing Machinery, New York (2022)","DOI":"10.1145\/3548606.3560642"},{"key":"4_CR4","doi-asserted-by":"publisher","unstructured":"Garimella, G., Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: Oblivious key-value stores and amplification for private set intersection. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021. LNCS, vol. 12826, pp. 395\u2013425. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_14","DOI":"10.1007\/978-3-030-84245-1_14"},{"key":"4_CR5","unstructured":"Badrinarayanan, S., et al.: A plug-n-play framework for scaling private set intersection to billion-sized sets. Cryptology ePrint Archive, Paper 2022\/294 (2022)"},{"key":"4_CR6","unstructured":"Pinkas, B., Schneider, T., Segev, G., Zohner, M.: Phasing: private set intersection using permutation-based hashing. In: 24th USENIX Security Symposium (USENIX Security 15), pp. 515\u2013530 (2015)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Annual International Cryptology Conference, pp. 145\u2013161. Springer (2003)","DOI":"10.1007\/978-3-540-45146-4_9"},{"key":"4_CR8","doi-asserted-by":"publisher","unstructured":"Kolesnikov, V., Kumaresan, R.: Improved OT extension for transferring short secrets. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8043, pp. 54\u201370. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_4","DOI":"10.1007\/978-3-642-40084-1_4"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"Kolesnikov, V., Kumaresan, R., Rosulek, M., Trieu, N.: Efficient batched oblivious prf with applications to private set intersection. In: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pp. 818\u2013829 (2016)","DOI":"10.1145\/2976749.2978381"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Pinkas, B., Rosulek, M., Trieu, N., Yanai, A.: SpOT-Light: lightweight private set intersection from sparse OT extension. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 401\u2013431. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_13","DOI":"10.1007\/978-3-030-26954-8_13"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer and extensions for faster secure computation. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security, pp. 535\u2013548 (2013)","DOI":"10.1145\/2508859.2516738"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Chase, M., Miao, P.: Private set intersection in the internet setting from lightweight oblivious PRF. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020. LNCS, vol. 12172, pp. 34\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_2","DOI":"10.1007\/978-3-030-56877-1_2"},{"key":"4_CR13","first-page":"187","volume":"2005","author":"MO Rabin","year":"2005","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptol. ePrint Arch. 2005, 187 (2005)","journal-title":"IACR Cryptol. ePrint Arch."},{"issue":"6","key":"4_CR14","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM 28(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC \u201996, pp. 479\u2013488. Association for Computing Machinery, New York (1996)","DOI":"10.1145\/237814.237996"},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"Asharov, G., Lindell, Y., Schneider, T., Zohner, M.: More efficient oblivious transfer extensions with security for malicious adversaries. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 673\u2013701. Springer (2015)","DOI":"10.1007\/978-3-662-46800-5_26"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"Mansy, D., Rindal, P.: Endemic oblivious transfer. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 309\u2013326 (2019)","DOI":"10.1145\/3319535.3354210"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Canetti, R., Sarkar, P., Wang, X.: Blazing Fast OT for Three-Round UC OT Extension. In: Kiayias, A., Kohlweiss, M., Wallden, P., Zikas, V. (eds.) PKC 2020. LNCS, vol. 12111, pp. 299\u2013327. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-45388-6_11","DOI":"10.1007\/978-3-030-45388-6_11"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Keller, M., Orsini, E., Scholl, P.: Actively secure ot extension with optimal overhead. In: Annual Cryptology Conference, pp. 724\u2013741. Springer (2015)","DOI":"10.1007\/978-3-662-47989-6_35"},{"key":"4_CR20","doi-asserted-by":"publisher","unstructured":"Chou, T., Orlandi, C.: The simplest protocol for oblivious transfer. In: Lauter, K., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATINCRYPT 2015. LNCS, vol. 9230, pp. 40\u201358. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-22174-8_3","DOI":"10.1007\/978-3-319-22174-8_3"},{"key":"4_CR21","unstructured":"Hauck, E., Loss, J.: Efficient and universally composable protocols for oblivious transfer from the cdh assumption. Cryptology ePrint Archive (2017)"},{"issue":"4","key":"4_CR22","doi-asserted-by":"publisher","first-page":"1732","DOI":"10.1007\/s00145-020-09355-y","volume":"33","author":"C Hazay","year":"2020","unstructured":"Hazay, C., Scholl, P., Soria-Vazquez, E.: Low cost constant round mpc combining bmr and oblivious transfer. J. Cryptol. 33(4), 1732\u20131786 (2020)","journal-title":"J. Cryptol."},{"key":"4_CR23","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D.: Equational security proofs of oblivious transfer protocols. In: Abdalla, M., Dahab, R. (eds.) PKC 2018. LNCS, vol. 10769, pp. 527\u2013553. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-76578-5_18","DOI":"10.1007\/978-3-319-76578-5_18"},{"key":"4_CR24","doi-asserted-by":"publisher","unstructured":"Orr\u00f9, M., Orsini, E., Scholl, P.: Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection. In: Handschuh, H. (ed.) CT-RSA 2017. LNCS, vol. 10159, pp. 381\u2013396. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52153-4_22","DOI":"10.1007\/978-3-319-52153-4_22"},{"issue":"10s","key":"4_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3503045","volume":"54","author":"VK Yadav","year":"2022","unstructured":"Yadav, V.K., Andola, N., Verma, S., Venkatesan, S.: A survey of oblivious transfer protocol. ACM Computing Surveys (CSUR) 54(10s), 1\u201337 (2022)","journal-title":"ACM Computing Surveys (CSUR)"}],"container-title":["Lecture Notes in Computer Science","Information Security and Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-6203-9_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T07:36:32Z","timestamp":1773214592000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-6203-9_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819562022","9789819562039"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-6203-9_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 January 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Inscrypt","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security and Cryptology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi'an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisc22025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/inscrypt2025.xidian.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}