{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:06:32Z","timestamp":1764119192568,"version":"3.46.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031486203"},{"type":"electronic","value":"9783031486210"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-48621-0_7","type":"book-chapter","created":{"date-parts":[[2023,11,26]],"date-time":"2023-11-26T18:02:21Z","timestamp":1701021741000},"page":"185-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Communication Lower Bounds of\u00a0Key-Agreement Protocols via\u00a0Density Increment Arguments"],"prefix":"10.1007","author":[{"given":"Mi-Ying","family":"Huang","sequence":"first","affiliation":[]},{"given":"Xinyu","family":"Mao","sequence":"additional","affiliation":[]},{"given":"Guangxu","family":"Yang","sequence":"additional","affiliation":[]},{"given":"Jiapeng","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,27]]},"reference":[{"key":"7_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-642-15317-4_18","volume-title":"Security and Cryptography for Networks","author":"A Young","year":"2010","unstructured":"Young, A., Yung, M.: Kleptography from standard assumptions and applications. In: Garay, J.A., De Prisco, R. (eds.) SCN 2010. LNCS, vol. 6280, pp. 271\u2013290. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15317-4_18"},{"key":"7_CR2","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-031-30545-0_3","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2023","author":"A Afshar","year":"2023","unstructured":"Afshar, A., Couteau, G., Mahmoody, M., Sadeghi, E.: Fine-grained non-interactive key-exchange: constructions and lower bounds. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023. LNCS, vol. 14004, pp. 55\u201385. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_3"},{"issue":"3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s00145-019-09334-y","volume":"33","author":"B Applebaum","year":"2020","unstructured":"Applebaum, B., Holenstein, T., Mishra, M., Shayevitz, O.: The communication complexity of private simultaneous messages, revisited. J. Cryptol. 33(3), 917\u2013953 (2020)","journal-title":"J. Cryptol."},{"key":"7_CR4","doi-asserted-by":"crossref","unstructured":"Barak, B., Braverman, M., Chen, X., Rao, A.: How to compress interactive communication. In: Proceedings of the Forty-Second ACM Symposium on Theory of Computing, pp. 67\u201376 (2010)","DOI":"10.1145\/1806689.1806701"},{"key":"7_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/978-3-642-19571-6_34","volume-title":"Theory of Cryptography","author":"Z Brakerski","year":"2011","unstructured":"Brakerski, Z., Katz, J., Segev, G., Yerukhimovich, A.: Limits on the power of zero-knowledge proofs in cryptographic constructions. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 559\u2013578. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_34"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"Advances in Cryptology - CRYPTO 2009","author":"B Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal\u2013an $$O(n^2)$$-query attack on any key exchange from a random oracle. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 374\u2013390. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_22"},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cohen, S.P., Naor, M.: Low communication complexity protocols, collision resistant hash functions and secret key-agreement protocols. Cryptology ePrint Archive (2022)","DOI":"10.1007\/978-3-031-15982-4_9"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-030-17656-3_17","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"G Couteau","year":"2019","unstructured":"Couteau, G.: A note on the communication complexity of multiparty computation in the correlated randomness model. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11477, pp. 473\u2013503. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17656-3_17"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Chakrabarti, A., Shi, Y., Wirth, A., Yao, A.: Informational complexity and the direct sum problem for simultaneous message complexity. In: Proceedings 42nd IEEE Symposium on Foundations of Computer Science, pp. 270\u2013278. IEEE (2001)","DOI":"10.1109\/SFCS.2001.959901"},{"issue":"6","key":"7_CR10","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1109\/TIT.1976.1055638","volume":"22","author":"W Diffie","year":"1976","unstructured":"Diffie, W., Hellman, M.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-030-90453-1_11","volume-title":"Theory of Cryptography","author":"I Dinur","year":"2021","unstructured":"Dinur, I., Hasson, B.: Distributed Merkle\u2019s puzzles. In: Nissim, K., Waters, B. (eds.) TCC 2021. LNCS, vol. 13043, pp. 310\u2013332. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90453-1_11"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1007\/978-3-642-19571-6_27","volume-title":"Theory of Cryptography","author":"D Dachman-Soled","year":"2011","unstructured":"Dachman-Soled, D., Lindell, Y., Mahmoody, M., Malkin, T.: On the black-box complexity of optimally-fair coin tossing. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 450\u2013467. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_27"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Pitassi, T., Watson, T.: Deterministic communication vs. partition number. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 1077\u20131088. IEEE (2015)","DOI":"10.1109\/FOCS.2015.70"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"G\u00f6\u00f6s, M., Pitassi, T., Watson, T.: Query-to-communication lifting for bpp. In: 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS), pp. 132\u2013143. IEEE (2017)","DOI":"10.1109\/FOCS.2017.21"},{"issue":"1","key":"7_CR15","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/130938438","volume":"44","author":"I Haitner","year":"2015","unstructured":"Haitner, I., Hoch, J.J., Reingold, O., Segev, G.: Finding collisions in interactive protocols-tight lower bounds on the round and communication complexities of statistically hiding commitments. SIAM J. Comput. 44(1), 193\u2013242 (2015)","journal-title":"SIAM J. Comput."},{"key":"7_CR16","unstructured":"Haitner, I., Mazor, N., Oshman, R., Reingold, O., Yehudayoff, A.: On the communication complexity of key-agreement protocols. In: 10th Innovations in Theoretical Computer Science, vol. 124 of LIPIcs. Leibniz Int. Proc. Inform., Art. No. 40, p. 16. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern (2019)"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00145-014-9194-9","volume":"29","author":"I Haitner","year":"2016","unstructured":"Haitner, I., Omri, E., Zarosim, H.: Limits on the usefulness of random oracles. J. Cryptol. 29(2), 283\u2013335 (2016)","journal-title":"J. Cryptol."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Rudich, S.: Limits on the provable consequences of one-way permutations. In: Proceedings of the Twenty-First Annual ACM Symposium on Theory of Computing, pp. 44\u201361 (1989)","DOI":"10.1145\/73007.73012"},{"key":"7_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1007\/978-3-642-19571-6_37","volume-title":"Theory of Cryptography","author":"J Katz","year":"2011","unstructured":"Katz, J., Schr\u00f6der, D., Yerukhimovich, A.: Impossibility of blind signatures from one-way permutations. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 615\u2013629. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19571-6_37"},{"key":"7_CR20","unstructured":"Mazor, N.: Key-agreement with perfect completeness from random oracles. Cryptology ePrint Archive (2023)"},{"issue":"4","key":"7_CR21","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1145\/359460.359473","volume":"21","author":"RC Merkle","year":"1978","unstructured":"Merkle, R.C.: Secure communications over insecure channels. Commun. ACM 21(4), 294\u2013299 (1978)","journal-title":"Commun. ACM"},{"key":"7_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/978-3-642-22792-9_3","volume-title":"Advances in Cryptology \u2013 CRYPTO 2011","author":"M Mahmoody","year":"2011","unstructured":"Mahmoody, M., Moran, T., Vadhan, S.: Time-lock puzzles in the random oracle model. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 39\u201350. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_3"},{"key":"7_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/978-3-642-32009-5_41","volume-title":"Advances in Cryptology \u2013 CRYPTO 2012","author":"M Mahmoody","year":"2012","unstructured":"Mahmoody, M., Pass, R.: The curious case of non-interactive commitments \u2013 on the power of black-box vs. non-black-box use of primitives. In: Safavi-Naini, R., Canetti, R. (eds.) CRYPTO 2012. LNCS, vol. 7417, pp. 701\u2013718. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32009-5_41"},{"key":"7_CR24","doi-asserted-by":"crossref","unstructured":"Raz, R., McKenzie, P.: Separation of the monotone NC hierarchy. In: Proceedings 38th Annual Symposium on Foundations of Computer Science, pp. 234\u2013243. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646112"},{"key":"7_CR25","unstructured":"Yang, G., Zhang, J.: Simulation methods in communication complexity, revisited. In: Electron. Colloquium Comput. Complex., TR22-019 (2022)"},{"key":"7_CR26","unstructured":"Yang, G., Zhang, J.: Lifting theorems meet information complexity: known and new lower bounds of set-disjointness (2023)"}],"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-48621-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T01:03:13Z","timestamp":1764118993000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48621-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031486203","9783031486210"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48621-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 November 2023","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":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 December 2023","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":"tcc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2023\/","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"}]}}