{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:13:13Z","timestamp":1743016393621,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683848"},{"type":"electronic","value":"9783031683855"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-68385-5_12","type":"book-chapter","created":{"date-parts":[[2024,8,16]],"date-time":"2024-08-16T08:02:51Z","timestamp":1723795371000},"page":"377-411","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Characterizations for Preprocessing Against Cryptographic Salting"],"prefix":"10.1007","author":[{"given":"Fangqi","family":"Dong","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3994-7061","authenticated-orcid":false,"given":"Qipeng","family":"Liu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5894-822X","authenticated-orcid":false,"given":"Kewen","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,17]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","unstructured":"Akshima, Cash, D., Drucker, A., Wee, H.: Time-space tradeoffs and short collisions in merkle-damg\u00e5rd hash functions. In: Annual International Cryptology Conference, pp. 157\u2013186. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-56784-2_6","DOI":"10.1007\/978-3-030-56784-2_6"},{"key":"12_CR2","doi-asserted-by":"publisher","unstructured":"Akshima, Guo, S., Liu, Q.: Time-space lower bounds for finding collisions in merkle-damg\u00e5rd hash functions. In: Dodis, Y., Shrimpton, T. (eds.) Annual International Cryptology Conference, vol. 13509, pp. 192\u2013221. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_7","DOI":"10.1007\/978-3-031-15982-4_7"},{"key":"12_CR3","unstructured":"Brassard, G., Hoyer, P., Tapp, A.: Quantum algorithm for the collision problem. arXiv preprint arXiv:quant-ph\/9705002 (1997)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-319-78381-9_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2018","author":"S Coretti","year":"2018","unstructured":"Coretti, S., Dodis, Y., Guo, S., Steinberger, J.: Random oracles and non-uniformity. In: Nielsen, J.B., Rijmen, V. (eds.) EUROCRYPT 2018. LNCS, vol. 10820, pp. 227\u2013258. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78381-9_9"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-030-77886-6_21","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2021","author":"K-M Chung","year":"2021","unstructured":"Chung, K.-M., Fehr, S., Huang, Y.-H., Liao, T.-N.: On the compressed-oracle technique, and post-quantum security of proofs of sequential work. In: Canteaut, A., Standaert, F.-X. (eds.) EUROCRYPT 2021. LNCS, vol. 12697, pp. 598\u2013629. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-77886-6_21"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1007\/978-3-030-36030-6_16","volume-title":"Theory of Cryptography","author":"H Corrigan-Gibbs","year":"2019","unstructured":"Corrigan-Gibbs, H., Kogan, D.: The function-inversion problem: barriers and opportunities. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 393\u2013421. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_16"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Guo, S., Liu, Q., Qian, L.: Tight quantum time-space tradeoffs for function inversion. In: 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pp. 673\u2013684. IEEE (2020)","DOI":"10.1109\/FOCS46700.2020.00068"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Chung, K.M., Lin, H., Mahmoody, M., Pass, R.: On the power of nonuniformity in proofs of security. In: Proceedings of the 4th Conference on Innovations in Theoretical Computer Science, pp. 389\u2013400 (2013)","DOI":"10.1145\/2422436.2422480"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"David, R., Dinur, I., Goldenberg, E., Kindler, G., Shinkar, I.: Direct sum testing. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 327\u2013336 (2015)","DOI":"10.1145\/2688073.2688078"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-319-56614-6_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2017","author":"Y Dodis","year":"2017","unstructured":"Dodis, Y., Guo, S., Katz, J.: Fixing cracks in the concrete: random oracles with auxiliary input, revisited. In: Coron, J.-S., Nielsen, J.B. (eds.) EUROCRYPT 2017. LNCS, vol. 10211, pp. 473\u2013495. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-56614-6_16"},{"issue":"2","key":"12_CR11","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/s00037-012-0043-7","volume":"21","author":"A Drucker","year":"2012","unstructured":"Drucker, A.: Improved direct product theorems for randomized query complexity. Comput. Complex. 21(2), 197\u2013244 (2012)","journal-title":"Comput. Complex."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Dinur, I., Steurer, D.: Direct product testing. In: 2014 IEEE 29th Conference on Computational Complexity (CCC), pp. 188\u2013196. IEEE (2014)","DOI":"10.1109\/CCC.2014.27"},{"key":"12_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-642-14623-7_35","volume-title":"Advances in Cryptology \u2013 CRYPTO 2010","author":"A De","year":"2010","unstructured":"De, A., Trevisan, L., Tulsiani, M.: Time space tradeoffs for attacks against one-way functions and PRGs. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 649\u2013665. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14623-7_35"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Feige, U.: On the success probability of the two provers in one-round proof systems. In: 1991 Proceedings of the Sixth Annual Structure in Complexity Theory Conference, pp. 116\u2013117. IEEE Computer Society (1991)","DOI":"10.1109\/SCT.1991.160251"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gravin, N., Guo, S., Kwok, T.C., Lu, P.: Concentration bounds for almost k-wise independence with applications to non-uniform security. In: Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 2404\u20132423. SIAM (2021)","DOI":"10.1137\/1.9781611976465.143"},{"key":"12_CR16","doi-asserted-by":"publisher","unstructured":"Ghoshal, A., Komargodski, I.: On time-space tradeoffs for bounded-length collisions in merkle-damg\u00e5rd hashing. In: Dodis, Y., Shrimpton, T. (eds.) Annual International Cryptology Conference, vol. 13509, pp. 161\u2013191. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15982-4_6","DOI":"10.1007\/978-3-031-15982-4_6"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-030-90459-3_7","volume-title":"Theory of Cryptography","author":"S Guo","year":"2021","unstructured":"Guo, S., Li, Q., Liu, Q., Zhang, J.: Unifying presampling via concentration bounds. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13042, pp. 177\u2013208. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_7"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Jaiswal, R., Kabanets, V., Wigderson, A.: Uniform direct product theorems: simplified, optimized, and derandomized. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 579\u2013588 (2008)","DOI":"10.1145\/1374376.1374460"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1007\/978-3-642-15369-3_46","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R Impagliazzo","year":"2010","unstructured":"Impagliazzo, R., Kabanets, V.: Constructive proofs of concentration bounds. In: Serna, M., Shaltiel, R., Jansen, K., Rolim, J. (eds.) APPROX\/RANDOM -2010. LNCS, vol. 6302, pp. 617\u2013631. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15369-3_46"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Relativized separations of worst-case and average-case complexities for NP. In: 2011 IEEE 26th Annual Conference on Computational Complexity, pp. 104\u2013114. IEEE (2011)","DOI":"10.1109\/CCC.2011.34"},{"key":"12_CR21","unstructured":"Jain, R., Kundu, S.: A direct product theorem for one-way quantum communication. In: 36th Computational Complexity Conference (2021)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Jain, R., Kundu, S.: A direct product theorem for quantum communication complexity with applications to device-independent QKD. In: 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), pp. 1285\u20131295. IEEE (2022)","DOI":"10.1109\/FOCS52979.2021.00125"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. In: Proceedings of the Seventeenth Annual ACM Symposium on Theory of Computing, pp. 363\u2013365 (1985)","DOI":"10.1145\/22145.22185"},{"key":"12_CR24","doi-asserted-by":"publisher","unstructured":"Liu, Q.: Non-uniformity and quantum advice in the quantum random oracle model. In: Hazay, C., Stam, M. (eds.) Annual International Conference on the Theory and Applications of Cryptographic Techniques, vol. 14004, pp. 117\u2013143. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_5","DOI":"10.1007\/978-3-031-30545-0_5"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s00037-013-0066-8","volume":"22","author":"T Lee","year":"2013","unstructured":"Lee, T., Roland, J.: A strong direct product theorem for quantum query complexity. Comput. Complex. 22, 429\u2013462 (2013)","journal-title":"Comput. Complex."},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-662-49896-5_9","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2016","author":"M Mahmoody","year":"2016","unstructured":"Mahmoody, M., Mohammed, A.: On the power of hierarchical identity-based encryption. In: Fischlin, M., Coron, J.-S. (eds.) EUROCRYPT 2016. LNCS, vol. 9666, pp. 243\u2013272. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49896-5_9"},{"issue":"11","key":"12_CR27","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1145\/359168.359172","volume":"22","author":"R Morris","year":"1979","unstructured":"Morris, R., Thompson, K.: Password security: a case history. Commun. ACM 22(11), 594\u2013597 (1979)","journal-title":"Commun. ACM"},{"issue":"2","key":"12_CR28","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s00037-005-0194-x","volume":"14","author":"C Marriott","year":"2005","unstructured":"Marriott, C., Watrous, J.: Quantum arthur-merlin games. Comput. Complex. 14(2), 122\u2013152 (2005)","journal-title":"Comput. Complex."},{"issue":"3","key":"12_CR29","doi-asserted-by":"publisher","first-page":"1035","DOI":"10.1137\/S0097539795282444","volume":"28","author":"N Nisan","year":"1998","unstructured":"Nisan, N., Rudich, S., Saks, M.: Products and help bits in decision trees. SIAM J. Comput. 28(3), 1035\u20131050 (1998)","journal-title":"SIAM J. Comput."},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Raz, R.: Parallel repetition of two prover games (invited survey). In: 2010 IEEE 25th Annual Conference on Computational Complexity, pp. 3\u20136. IEEE (2010)","DOI":"10.1109\/CCC.2010.9"},{"issue":"2\u2013Jan","key":"12_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00037-003-0175-x","volume":"12","author":"R Shaltiel","year":"2003","unstructured":"Shaltiel, R.: Towards proving strong direct product theorems. Comput. Complex. 12(2\u2013Jan), 1\u201322 (2003)","journal-title":"Comput. Complex."},{"key":"12_CR32","doi-asserted-by":"crossref","unstructured":"Sherstov, A.A.: Strong direct product theorems for quantum communication and query complexity. In: Proceedings of the Forty-third Annual ACM Symposium on Theory of Computing, pp. 41\u201350 (2011)","DOI":"10.1145\/1993636.1993643"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-540-74143-5_12","volume-title":"Advances in Cryptology - CRYPTO 2007","author":"D Unruh","year":"2007","unstructured":"Unruh, D.: Random oracles and auxiliary input. In: Menezes, A. (ed.) CRYPTO 2007. LNCS, vol. 4622, pp. 205\u2013223. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74143-5_12"},{"key":"12_CR34","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science (SFCS 1982), pp. 80\u201391. IEEE (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"12_CR35","doi-asserted-by":"crossref","unstructured":"Yao, A.C.C.: Coherent functions and program checkers. In: Proceedings of the Twenty-second Annual ACM Symposium on Theory of Computing, pp. 84\u201394 (1990)","DOI":"10.1145\/100216.100226"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-030-26951-7_9","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"M Zhandry","year":"2019","unstructured":"Zhandry, M.: How to record quantum queries, and applications to quantum indifferentiability. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11693, pp. 239\u2013268. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_9"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-68385-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,26]],"date-time":"2024-11-26T19:37:50Z","timestamp":1732649870000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68385-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683848","9783031683855"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68385-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"17 August 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CRYPTO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual International Cryptology Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Santa Barbara, CA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"18 August 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 August 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"44","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}