{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:07:21Z","timestamp":1742998041744,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031780165"},{"type":"electronic","value":"9783031780172"}],"license":[{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:00:00Z","timestamp":1732752000000},"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-3-031-78017-2_7","type":"book-chapter","created":{"date-parts":[[2024,11,27]],"date-time":"2024-11-27T23:48:19Z","timestamp":1732751299000},"page":"195-223","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Bit-Security Preserving Hardness Amplification"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1121-8633","authenticated-orcid":false,"given":"Shun","family":"Watanabe","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5552-8457","authenticated-orcid":false,"given":"Kenji","family":"Yasunaga","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,11,28]]},"reference":[{"key":"7_CR1","unstructured":"Aslam, J.A.: Improving algorithms for boosting. In: Proceedings of the 13th Annual Conference on Computational Learning Theory, pp. 200\u2013207 (2000)"},{"key":"7_CR2","doi-asserted-by":"publisher","unstructured":"Bader, C., Jager, T., Li, Y., Sch\u00e4ge, S.: On the impossibility of tight cryptographic reductions. In: Fischlin, M., Coron, J. (eds.) Advances in Cryptology - EUROCRYPT 2016. Lecture Notes in Computer Science, vol.\u00a09666, pp. 273\u2013304. Springer (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_10","DOI":"10.1007\/978-3-662-49896-5_10"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Hardt, M., Kale, S.: The uniform hardcore lemma via approximate Bregman projections. In: Proceedings of the 2009 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1193\u20131200 (2009)","DOI":"10.1137\/1.9781611973068.129"},{"key":"7_CR4","doi-asserted-by":"publisher","unstructured":"Bellare, M., Ristenpart, T.: Simulation without the artificial abort: Simplified proof and improved concrete security for Water\u2019s IBE scheme. In: Advances in Cryptology - EUROCRYPT 2009, 28th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Lecture Notes in Computer Science, vol.\u00a05479, pp. 407\u2013424. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-01001-9_24","DOI":"10.1007\/978-3-642-01001-9_24"},{"key":"7_CR5","doi-asserted-by":"publisher","unstructured":"Csisz\u00e1r, I., Shields, P.C.: Information theory and statistics: a tutorial. Found. Trends Commun. Inf. Theory 1(4) (2004). https:\/\/doi.org\/10.1561\/0100000004","DOI":"10.1561\/0100000004"},{"key":"7_CR6","doi-asserted-by":"publisher","unstructured":"Diemert, D., Jager, T.: On the tight security of TLS 1.3: Theoretically sound cryptographic parameters for real-world deployments. J. Cryptol. 34(3), 30 (2021). https:\/\/doi.org\/10.1007\/s00145-021-09388-x","DOI":"10.1007\/s00145-021-09388-x"},{"key":"7_CR7","doi-asserted-by":"publisher","unstructured":"Dodis, Y., Impagliazzo, R., Jaiswal, R., Kabanets, V.: Security amplification for interactive cryptographic primitives. In: Reingold, O. (ed.) Theory of Cryptography, 6th Theory of Cryptography Conference, TCC 2009, San Francisco, CA, USA, March 15-17, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05444, pp. 128\u2013145. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-00457-5_9","DOI":"10.1007\/978-3-642-00457-5_9"},{"issue":"7","key":"7_CR8","doi-asserted-by":"publisher","first-page":"3797","DOI":"10.1109\/TIT.2014.2320500","volume":"60","author":"T van Erven","year":"2014","unstructured":"van Erven, T., Harremo\u00ebs, P.: R\u00e9nyi divergence and Kullback-Leibler divergence. IEEE Trans. Inform. Theory 60(7), 3797\u20133820 (2014)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Goldmann, M., H\u00e5stad, J., Razborov, A.: Majority gates vs. general weighted threshold gates. Comput. Complex. 2, 277\u2013300 (1992)","DOI":"10.1007\/BF01200426"},{"key":"7_CR10","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On Yao\u2019s XOR lemma. Electronic Colloquium on Computational Complexity (March 1995)"},{"key":"7_CR11","doi-asserted-by":"publisher","unstructured":"Goldreich, O.: The Foundations of Cryptography - Volume 1: Basic Techniques. Cambridge University Press (2001). https:\/\/doi.org\/10.1017\/CBO9780511546891, http:\/\/www.wisdom.weizmann.ac.il\/%7Eoded\/foc-vol1.html","DOI":"10.1017\/CBO9780511546891"},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Goldreich, O.: On security preserving reductions - revised terminology. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Lecture Notes in Computer Science, vol.\u00a06650, pp. 540\u2013546. Springer (2011)","DOI":"10.1007\/978-3-642-22670-0_34"},{"key":"7_CR13","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Impagliazzo, R., Levin, L.A., Venkatesan, R., Zuckerman, D.: Security preserving amplification of hardness. In: 31st Annual Symposium on Foundations of Computer Science, St. Louis, Missouri, USA, October 22-24, 1990, Volume I, pp. 318\u2013326. IEEE Computer Society (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89550","DOI":"10.1109\/FSCS.1990.89550"},{"key":"7_CR14","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On Yao\u2019s XOR-lemma. In: Goldreich, O. (ed.) Studies in Complexity and Cryptography. Miscellanea on the Interplay between Randomness and Computation, Lecture Notes in Computer Science, vol.\u00a06650, pp. 273\u2013301. Springer (2011). https:\/\/doi.org\/10.1007\/978-3-642-22670-0_23","DOI":"10.1007\/978-3-642-22670-0_23"},{"issue":"85","key":"7_CR15","first-page":"1","volume":"24","author":"F G\u00f6tze","year":"2019","unstructured":"G\u00f6tze, F., Sambale, H., Sinulis, A.: Higher order concentration for functions of weakly dependent random variables. Electron. J. Probab. 24(85), 1\u201319 (2019)","journal-title":"Electron. J. Probab."},{"key":"7_CR16","doi-asserted-by":"publisher","unstructured":"Haitner, I., Reingold, O., Vadhan, S.P.: Efficiency improvements in constructing pseudorandom generators from one-way functions. SIAM J. Comput. 42(3), 1405\u20131430 (2013). https:\/\/doi.org\/10.1137\/100814421","DOI":"10.1137\/100814421"},{"key":"7_CR17","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00145-003-0141-4","volume":"17","author":"G Hast","year":"2004","unstructured":"Hast, G.: Nearly one-sided tests and the Goldreich-Levin predicate. J. Cryptol. 17, 209\u2013229 (2004)","journal-title":"J. Cryptol."},{"key":"7_CR18","doi-asserted-by":"publisher","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","DOI":"10.1137\/S0097539793244708"},{"key":"7_CR19","unstructured":"Hatano, K., Warmuth, M.K.: Boosting versus covering. In: Advances in Neural Information Processing Systems. vol.\u00a016 (2003)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Hatano, K., Watanabe, O.: Learning $$r$$-of-$$k$$ functions by boosting. In: Proceedings of the 15th International Conference on Algorithmic Learning Theory, pp. 114\u2013126 (2004)","DOI":"10.1007\/978-3-540-30215-5_10"},{"key":"7_CR21","doi-asserted-by":"publisher","unstructured":"Herzberg, A., Luby, M.: Pubic randomness in cryptography. In: Brickell, E.F. (ed.) Advances in Cryptology - CRYPTO \u201992, 12th Annual International Cryptology Conference, Santa Barbara, California, USA, August 16-20, 1992, Proceedings. Lecture Notes in Computer Science, vol.\u00a0740, pp. 421\u2013432. Springer (1992). https:\/\/doi.org\/10.1007\/3-540-48071-4_29","DOI":"10.1007\/3-540-48071-4_29"},{"key":"7_CR22","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC \u201905), pp. 664\u2013673. ACM Press (2005)","DOI":"10.1145\/1060590.1060689"},{"key":"7_CR23","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distribution for somewhat hard problems. In: Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science (FOCS \u201995), pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"7_CR24","unstructured":"Kale, S.: Boosting and hard-core set constructions: a simplified approach (2007), electronic Colloquium on Computational Complexity (ECCC), Report No.\u00a0131"},{"key":"7_CR25","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1022949332276","volume":"51","author":"AR Klivans","year":"2003","unstructured":"Klivans, A.R., Servedio, R.A.: Boosting and hard-core set construction. Mach. Learn. 51, 217\u2013238 (2003)","journal-title":"Mach. Learn."},{"key":"7_CR26","doi-asserted-by":"crossref","unstructured":"Lanzenberger, D., Maurer, U.: Direct product hardness amplification. In: Nissim, K., Waters, B. (eds.) Theory of Cryptography - 19th International Conference, TCC 2021, Raleigh, NC, USA, November 8-11, 2021, Proceedings, Part II. Lecture Notes in Computer Science, vol. 13043, pp. 605\u2013625. Springer (2021)","DOI":"10.1007\/978-3-030-90453-1_21"},{"key":"7_CR27","doi-asserted-by":"publisher","unstructured":"Lee, K.: Bit security as cost to demonstrate advantage. IACR Commun. Cryptol. 1(1) (2024). https:\/\/doi.org\/10.62056\/an5txol7","DOI":"10.62056\/an5txol7"},{"key":"7_CR28","doi-asserted-by":"publisher","unstructured":"Li, B., Micciancio, D., Schultz, M., Sorrell, J.: Securing approximate homomorphic encryption using differential privacy. In: Dodis, Y., Shrimpton, T. (eds.) Advances in Cryptology - CRYPTO 2022. Lecture Notes in Computer Science, vol. 13507, pp. 560\u2013589. Springer (2022). https:\/\/doi.org\/10.1007\/978-3-031-15802-5_20","DOI":"10.1007\/978-3-031-15802-5_20"},{"key":"7_CR29","doi-asserted-by":"publisher","DOI":"10.1515\/9780691206844","volume-title":"Pseudorandomness and cryptographic applications","author":"M Luby","year":"1996","unstructured":"Luby, M.: Pseudorandomness and cryptographic applications. Princeton University Press, Princeton computer science notes (1996)"},{"key":"7_CR30","doi-asserted-by":"crossref","unstructured":"Maurer, U., Tessaro, S.: A hardcore lemma for computational indistinguishability: Security amplification for arbitrary weak PRGs with optimal stretch. In: TCC 2010. Lecture Notes in Computer Science, vol.\u00a05078, pp. 237\u2013254. Springer (2010)","DOI":"10.1007\/978-3-642-11799-2_15"},{"key":"7_CR31","doi-asserted-by":"publisher","unstructured":"Maurer, U.M., Tessaro, S.: Computational indistinguishability amplification: Tight product theorems for system composition. In: Halevi, S. (ed.) Advances in Cryptology - CRYPTO 2009, 29th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2009. Proceedings. Lecture Notes in Computer Science, vol.\u00a05677, pp. 355\u2013373. Springer (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_21","DOI":"10.1007\/978-3-642-03356-8_21"},{"key":"7_CR32","doi-asserted-by":"publisher","unstructured":"Micciancio, D., Walter, M.: On the bit security of cryptographic primitives. In: Nielsen, J.B., Rijmen, V. (eds.) Advances in Cryptology - EUROCRYPT 2018. Lecture Notes in Computer Science, vol. 10820, pp. 3\u201328. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_1","DOI":"10.1007\/978-3-319-78381-9_1"},{"key":"7_CR33","doi-asserted-by":"publisher","unstructured":"Morgan, A., Pass, R.: On the security loss of unique signatures. In: Theory of Cryptography. Theory of Cryptography, vol. 11239, pp. 507\u2013536. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-03807-6_19","DOI":"10.1007\/978-3-030-03807-6_19"},{"key":"7_CR34","doi-asserted-by":"publisher","unstructured":"Myers, S.A.: Efficient amplification of the security of weak pseudo-random function generators. J. Cryptol. 16(1), 1\u201324 (2003). https:\/\/doi.org\/10.1007\/s00145-002-0007-1","DOI":"10.1007\/s00145-002-0007-1"},{"key":"7_CR35","doi-asserted-by":"crossref","unstructured":"Schapire, R.E., Freund, Y.: Boosting: Foundations and Algorithms. MIT Press (2012)","DOI":"10.7551\/mitpress\/8291.001.0001"},{"issue":"3","key":"7_CR36","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1007614523901","volume":"37","author":"RE Schapire","year":"1999","unstructured":"Schapire, R.E., Singer, Y.: Improved boosting algorithm using confidence-rated predictions. Mach. Learn. 37(3), 297\u2013336 (1999)","journal-title":"Mach. Learn."},{"key":"7_CR37","doi-asserted-by":"crossref","unstructured":"Vadhan, S., Zheng, C.J.: A uniform min-max theorem with applications in cryptography. In: Advances in Cryptography\u2013CRYPTO \u201913. Lecture Notes in Computer Science, vol.\u00a08042, pp. 93\u2013110. Springer (2013)","DOI":"10.1007\/978-3-642-40041-4_6"},{"key":"7_CR38","doi-asserted-by":"publisher","unstructured":"Vadhan, S., Zheng, C.J.: Characterizing pseudoentropy and simplifying pseudorandom generator constructions. STOC \u201912, Association for Computing Machinery, New York, NY, USA (2012). https:\/\/doi.org\/10.1145\/2213977.2214051","DOI":"10.1145\/2213977.2214051"},{"key":"7_CR39","doi-asserted-by":"crossref","unstructured":"Watanabe, S., Yasunaga, K.: Bit security as computational cost for winning games with high probability. In: Tibouchi, M., Wang, H. (eds.) Advances in Cryptology - ASIACRYPT 2021. Lecture Notes in Computer Science, vol. 13092, pp. 161\u2013188. Springer (2021)","DOI":"10.1007\/978-3-030-92078-4_6"},{"key":"7_CR40","doi-asserted-by":"crossref","unstructured":"Watanabe, S., Yasunaga, K.: Unified view for notions of bit security. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology - ASIACRYPT 2023. Lecture Notes in Computer Science, vol. 14443, pp. 361\u2013389. Springer (2023)","DOI":"10.1007\/978-981-99-8736-8_12"},{"key":"7_CR41","unstructured":"Wegener, I.: The Complexity of Boolean Functions. Wiley (1991)"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-78017-2_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,28]],"date-time":"2024-11-28T00:16:46Z","timestamp":1732753006000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-78017-2_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,28]]},"ISBN":["9783031780165","9783031780172"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-78017-2_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,11,28]]},"assertion":[{"value":"28 November 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Milan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"2 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 December 2024","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":"tcc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}