{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:28:37Z","timestamp":1786753717482,"version":"3.56.0"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031683787","type":"print"},{"value":"9783031683794","type":"electronic"}],"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-68379-4_8","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T16:17:23Z","timestamp":1723738643000},"page":"251-285","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fine-Grained Non-interactive Key-Exchange Without Idealized Assumptions"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1198-1903","authenticated-orcid":false,"given":"Yuyu","family":"Wang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-2296-8510","authenticated-orcid":false,"given":"Chuanjie","family":"Su","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7459-6850","authenticated-orcid":false,"given":"Jiaxin","family":"Pan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Abboud, A., Williams, V.V., Weimann, O.: Consequences of faster alignment of sequences. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 39\u201351. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_4","DOI":"10.1007\/978-3-662-43948-7_4"},{"key":"8_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-031-30545-0_3","volume-title":"EUROCRYPT 2023, Part I","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, Part I. LNCS, vol. 14004, pp. 55\u201385. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_3"},{"key":"8_CR3","unstructured":"Backurs, A., Tzamos, C.: Improving viterbi is hard: better runtimes imply faster clique algorithms. In: Proceedings of the 34th International Conference on Machine Learning (ICML 2017), vol. 70, pp. 311\u2013321. JMLR.org (2017)"},{"key":"8_CR4","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1007\/978-3-030-56877-1_24","volume-title":"CRYPTO 2020, Part III","author":"M Ball","year":"2020","unstructured":"Ball, M., Dachman-Soled, D., Kulkarni, M.: New techniques for zero-knowledge: leveraging inefficient provers to reduce assumptions, interaction, and trust. In: Micciancio, D., Ristenpart, T. (eds.) CRYPTO 2020, Part III. LNCS, vol. 12172, pp. 674\u2013703. Springer, Heidelberg (2020). https:\/\/doi.org\/10.1007\/978-3-030-56877-1_24"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Barrington, D.A.M.: Bounded-width polynomial-size branching programs recognize exactly those languages in $$\\text{NC}^1$$. In: 18th ACM STOC, pp. 1\u20135. ACM Press (1986)","DOI":"10.1145\/12130.12131"},{"key":"8_CR6","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-540-78524-8_4","volume-title":"TCC 2008","author":"E Biham","year":"2008","unstructured":"Biham, E., Goren, Y.J., Ishai, Y.: Basing weak public-key cryptography on strong one-way functions. In: Canetti, R. (ed.) TCC 2008. LNCS, vol. 4948, pp. 55\u201372. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_4"},{"key":"8_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-642-42045-0_15","volume-title":"ASIACRYPT 2013, Part II","author":"D Boneh","year":"2013","unstructured":"Boneh, D., Waters, B.: Constrained pseudorandom functions and their applications. In: Sako, K., Sarkar, P. (eds.) ASIACRYPT 2013, Part II. LNCS, vol. 8270, pp. 280\u2013300. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-42045-0_15"},{"key":"8_CR8","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/s00453-016-0242-8","volume-title":"CRYPTO 2014, Part I","author":"D Boneh","year":"2014","unstructured":"Boneh, D., Zhandry, M.: Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation. In: Garay, J.A., Gennaro, R. (eds.) CRYPTO 2014, Part I. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/s00453-016-0242-8"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Bringmann, K., Gawrychowski, P., Mozes, S., Weimann, O.: Tree edit distance cannot be computed in strongly subcubic time (unless APSP can). In: Czumaj, A. (ed.) 29th SODA, pp. 1190\u20131206. ACM-SIAM (2018)","DOI":"10.1137\/1.9781611975031.77"},{"key":"8_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1007\/BFb0052243","volume-title":"CRYPTO\u201997","author":"C Cachin","year":"1997","unstructured":"Cachin, C., Maurer, U.M.: Unconditional security against memory-bounded adversaries. In: Kaliski, B.S., Jr. (ed.) CRYPTO\u201997. LNCS, vol. 1294, pp. 292\u2013306. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0052243"},{"key":"8_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-03810-6_3","volume-title":"TCC 2018, Part II","author":"M Campanelli","year":"2018","unstructured":"Campanelli, M., Gennaro, R.: Fine-grained secure computation. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 66\u201397. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_3"},{"key":"8_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-662-53015-3_19","volume-title":"CRYPTO 2016, Part III","author":"A Degwekar","year":"2016","unstructured":"Degwekar, A., Vaikuntanathan, V., Vasudevan, P.N.: Fine-grained cryptography. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part III. LNCS, vol. 9816, pp. 533\u2013562. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_19"},{"issue":"6","key":"8_CR13","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.E.: New directions in cryptography. IEEE Trans. Inf. Theory 22(6), 644\u2013654 (1976)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"8_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-031-30545-0_4","volume-title":"EUROCRYPT 2023, Part I","author":"Y Dodis","year":"2023","unstructured":"Dodis, Y., Quach, W., Wichs, D.: Speak much, remember little: cryptography in the bounded storage model, revisited. In: Hazay, C., Stam, M. (eds.) EUROCRYPT 2023, Part I. LNCS, vol. 14004, pp. 86\u2013116. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_4"},{"issue":"3","key":"8_CR15","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s00145-021-09390-3","volume":"34","author":"S Egashira","year":"2021","unstructured":"Egashira, S., Wang, Y., Tanaka, K.: Fine-grained cryptography revisited. J. Cryptol. 34(3), 23 (2021)","journal-title":"J. Cryptol."},{"key":"8_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36362-7_17","volume-title":"PKC 2013","author":"ESV Freire","year":"2013","unstructured":"Freire, E.S.V., Hofheinz, D., Kiltz, E., Paterson, K.G.: Non-interactive key exchange. In: Kurosawa, K., Hanaoka, G. (eds.) PKC 2013. LNCS, vol. 7778, pp. 254\u2013271. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-36362-7_17"},{"key":"8_CR17","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-96881-0_2","volume-title":"CRYPTO 2018, Part II","author":"G Fuchsbauer","year":"2018","unstructured":"Fuchsbauer, G., Kiltz, E., Loss, J.: The algebraic group model and its applications. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 33\u201362. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_2"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC, pp. 25\u201332. ACM (1989)","DOI":"10.1145\/73007.73010"},{"issue":"1","key":"8_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00145-021-09406-y","volume":"35","author":"S Guo","year":"2022","unstructured":"Guo, S., Kamath, P., Rosen, A., Sotiraki, K.: Limits on the efficiency of (ring) lwe-based non-interactive key exchange. J. Cryptol. 35(1), 1 (2022)","journal-title":"J. Cryptol."},{"issue":"3","key":"8_CR20","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0020-0190(87)90053-6","volume":"26","author":"J H\u00e5stad","year":"1987","unstructured":"H\u00e5stad, J.: One-way permutations in NC0. Inf. Process. Lett. 26(3), 153\u2013155 (1987)","journal-title":"Inf. Process. Lett."},{"key":"8_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-96881-0_3","volume-title":"CRYPTO 2018, Part II","author":"J Hesse","year":"2018","unstructured":"Hesse, J., Hofheinz, D., Kohl, L.: On tightly secure non-interactive key exchange. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018, Part II. LNCS, vol. 10992, pp. 65\u201394. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-319-96881-0_3"},{"key":"8_CR22","unstructured":"Hofheinz, D.: Fully secure constrained pseudorandom functions using random oracles. Cryptology ePrint Archive, Paper 2014\/372 (2014). https:\/\/eprint.iacr.org\/2014\/372"},{"issue":"4","key":"8_CR23","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s00145-004-0312-y","volume":"17","author":"A Joux","year":"2004","unstructured":"Joux, A.: A one round protocol for tripartite diffie-hellman. J. Cryptol. 17(4), 263\u2013276 (2004)","journal-title":"J. Cryptol."},{"key":"8_CR24","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-030-26954-8_20","volume-title":"CRYPTO 2019, Part III","author":"R LaVigne","year":"2019","unstructured":"LaVigne, R., Lincoln, A., Williams, V.V.: Public-key cryptography in the fine-grained setting. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 605\u2013635. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_20"},{"key":"8_CR25","doi-asserted-by":"crossref","unstructured":"Lincoln, A., Williams, V.V., Williams, R.R.: Tight hardness for shortest cycles and paths in sparse graphs. In: Czumaj, A. (ed.) 29th SODA, pp. 1236\u20131252. ACM-SIAM (2018)","DOI":"10.1137\/1.9781611975031.80"},{"key":"8_CR26","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11586821_1","volume-title":"10th IMA International Conference on Cryptography and Coding","author":"UM Maurer","year":"2005","unstructured":"Maurer, U.M.: Abstract models of computation in cryptography (invited paper). In: Smart, N.P. (ed.) 10th IMA International Conference on Cryptography and Coding. LNCS, vol. 3796, pp. 1\u201312. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11586821_1"},{"issue":"4","key":"8_CR27","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":"8_CR28","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-60693-9_11","volume-title":"5th IMA International Conference on Cryptography and Coding","author":"CJ Mitchell","year":"1995","unstructured":"Mitchell, C.J.: A storage complexity based analogue of Maurer key establishment using public channels. In: Boyd, C. (ed.) 5th IMA International Conference on Cryptography and Coding. LNCS, vol. 1025, pp. 84\u201393. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60693-9_11"},{"key":"8_CR29","doi-asserted-by":"crossref","unstructured":"Razborov, A.A.: Lower bounds on the size of bounded depth circuits over a complete basis with logical addition. Math. Notes Acad. Sci. USSR 41(4) (1987)","DOI":"10.1007\/BF01137685"},{"key":"8_CR30","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"EUROCRYPT\u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT\u201997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"8_CR31","doi-asserted-by":"crossref","unstructured":"Smolensky, R.: Algebraic methods in the theory of lower bounds for Boolean circuit complexity. In: Aho, A. (ed.) 19th ACM STOC, pp. 77\u201382. ACM Press (1987)","DOI":"10.1145\/28395.28404"},{"key":"8_CR32","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1007\/978-3-031-07085-3_11","volume-title":"EUROCRYPT 2022, Part II","author":"Y Wang","year":"2022","unstructured":"Wang, Y., Pan, J.: Non-interactive zero-knowledge proofs with fine-grained security. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 305\u2013335. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_11"},{"key":"8_CR33","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s00145-023-09479-x","volume-title":"CRYPTO 2021, Part IV","author":"Y Wang","year":"2021","unstructured":"Wang, Y., Pan, J., Chen, Y.: Fine-grained secure attribute-based encryption. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 179\u2013207. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/s00145-023-09479-x"},{"key":"8_CR34","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Simulating BPP using a general weak random source. In: 32nd FOCS, pp. 79\u201389. IEEE Computer Society Press (1991)","DOI":"10.1109\/SFCS.1991.185351"}],"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-68379-4_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,15]],"date-time":"2026-08-15T00:05:50Z","timestamp":1786752350000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68379-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683787","9783031683794"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68379-4_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"16 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"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}