{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,27]],"date-time":"2025-04-27T09:03:05Z","timestamp":1745744585885,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031683787"},{"type":"electronic","value":"9783031683794"}],"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_9","type":"book-chapter","created":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:17:23Z","timestamp":1723753043000},"page":"286-312","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Fine-Grained Non-interactive Key Exchange, Revisited"],"prefix":"10.1007","author":[{"given":"Balthazar","family":"Bauer","sequence":"first","affiliation":[]},{"given":"Geoffroy","family":"Couteau","sequence":"additional","affiliation":[]},{"given":"Elahe","family":"Sadeghi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,16]]},"reference":[{"key":"9_CR1","series-title":"Part I, LNCS 14004","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-031-30545-0_3","volume-title":"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: EUROCRYPT 2023. Part I, LNCS 14004, pp. 55\u201385. Springer, Heidelberg (2023). https:\/\/doi.org\/10.1007\/978-3-031-30545-0_3"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Brzuska, C., Couteau, G.: On building fine-grained one-way functions from strong average-case hardness. In: Dunkelman, O., Dziembowski, S. (eds) Advances in Cryptology \u2013 EUROCRYPT 2022. EUROCRYPT 2022. LNCS, vol. 13276. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_20","DOI":"10.1007\/978-3-031-07085-3_20"},{"key":"9_CR3","series-title":"LNCS 4948","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: TCC 2008. LNCS 4948, pp. 55\u201372. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78524-8_4"},{"key":"9_CR4","series-title":"LNCS 6841","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-3-642-22792-9_22","volume-title":"CRYPTO 2011","author":"G Brassard","year":"2011","unstructured":"Brassard, G., H\u00f8yer, P., Kalach, K., Kaplan, M., Laplante, S., Salvail, L.: Merkle puzzles in a quantum world. In: CRYPTO 2011. LNCS 6841, pp. 391\u2013410. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22792-9_22"},{"key":"9_CR5","unstructured":"Badrinarayanan, S., Ishai, Y., Khurana, D., Sahai, A., Wichs, D.: Refuting the dream XOR lemma via ideal obfuscation and resettable MPC. In: 3rd Conference on Information-Theoretic Cryptography, ITC 2022, 5-7 July 2022, Cambridge, MA, USA. LIPIcs, vol. 230, pp. 10:1\u201310:21. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"9_CR6","series-title":"LNCS 5677","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-03356-8_22","volume-title":"CRYPTO 2009","author":"B Barak","year":"2009","unstructured":"Barak, B., Mahmoody-Ghidary, M.: Merkle puzzles are optimal - an $$O(n^2)$$-query attack on any key exchange from a random oracle. In: CRYPTO 2009. LNCS 5677, pp. 374\u2013390. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03356-8_22"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Average-case fine-grained hardness. In: 49th ACM STOC, pp. 483\u2013496. ACM Press (June 2017)","DOI":"10.1145\/3055399.3055466"},{"key":"9_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"789","DOI":"10.1007\/978-3-319-96884-1_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2018","author":"M Ball","year":"2018","unstructured":"Ball, M., Rosen, A., Sabin, M., Vasudevan, P.N.: Proofs of work from worst-case assumptions. In: Shacham, H., Boldyreva, A. (eds.) CRYPTO 2018. LNCS, vol. 10991, pp. 789\u2013819. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96884-1_26"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-662-44371-2_27","volume-title":"Advances in Cryptology \u2013 CRYPTO 2014","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. LNCS, vol. 8616, pp. 480\u2013499. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44371-2_27"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-030-03810-6_3","volume-title":"Theory of Cryptography","author":"M Campanelli","year":"2018","unstructured":"Campanelli, M., Gennaro, R.: Fine-grained secure computation. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018. LNCS, vol. 11240, pp. 66\u201397. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_3"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/978-3-642-40041-4_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"J-S Coron","year":"2013","unstructured":"Coron, J.-S., Lepoint, T., Tibouchi, M.: Practical multilinear maps over the integers. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. LNCS, vol. 8042, pp. 476\u2013493. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40041-4_26"},{"issue":"6","key":"9_CR12","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":"9_CR13","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":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/978-3-662-53015-3_19","volume-title":"Advances in Cryptology \u2013 CRYPTO 2016","author":"A Degwekar","year":"2016","unstructured":"Degwekar, A., Vaikuntanathan, V., Vasudevan, P.N.: Fine-grained cryptography. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016. LNCS, vol. 9816, pp. 533\u2013562. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53015-3_19"},{"issue":"3","key":"9_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":"9_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-642-36362-7_17","volume-title":"Public-Key Cryptography \u2013 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"},{"issue":"1","key":"9_CR17","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."},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Hirahara, S., Ilango, R., Williams, R.: Beating brute force for compression problems. Electron. Colloquium Comput. Complex., TR23-171 (2023)","DOI":"10.1145\/3618260.3649778"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/10722028_23","volume-title":"Algorithmic Number Theory","author":"A Joux","year":"2000","unstructured":"Joux, A.: A one round protocol for tripartite Diffie\u2013Hellman. In: Bosma, W. (ed.) ANTS 2000. LNCS, vol. 1838, pp. 385\u2013393. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722028_23"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-030-26954-8_20","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"R LaVigne","year":"2019","unstructured":"LaVigne, R., Lincoln, A., Vassilevska Williams, V.: Public-key cryptography in the fine-grained setting. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 605\u2013635. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_20"},{"key":"9_CR21","unstructured":"Merkle, R.: C.s. 244 project proposal. Facsimile. http:\/\/www.merkle.com\/1974 (1974)"},{"issue":"4","key":"9_CR22","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":"9_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1007\/11792086_41","volume-title":"Algorithmic Number Theory","author":"I Mironov","year":"2006","unstructured":"Mironov, I., Mityagin, A., Nissim, K.: Hard instances of the constrained discrete logarithm problem. In: Hess, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 582\u2013598. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11792086_41"},{"key":"9_CR24","unstructured":"Mazor, N., Pass, R.: The non-uniform perebor conjecture for time-bounded kolmogorov complexity is false. Cryptology ePrint Archive (2023)"},{"key":"9_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/BFb0054118","volume-title":"Advances in Cryptology \u2014 EUROCRYPT\u201998","author":"U Maurer","year":"1998","unstructured":"Maurer, U., Wolf, S.: Lower bounds on generic algorithms in groups. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 72\u201384. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0054118"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"O\u2019Bryant, K.: A complete annotated bibliography of work related to sidon sequences. Electronic J. Combinatorics [electronic only] 11 (2004)","DOI":"10.37236\/32"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Pollard, J.M.: A Monte Carlo method for factorization. BIT 15, 331\u2013334 (1975). http:\/\/cr.yp.to\/bib\/entries.html#1975\/pollard","DOI":"10.1007\/BF01933667"},{"issue":"4","key":"9_CR28","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM (JACM) 27(4), 701\u2013717 (1980)","journal-title":"J. ACM (JACM)"},{"issue":"2","key":"9_CR29","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0020-0190(00)00173-3","volume":"79","author":"C Schnorr","year":"2001","unstructured":"Schnorr, C.: Small generic hardcore subsets for the discrete logarithm: short secret dl-keys. Inf. Process. Lett. 79(2), 93\u201398 (2001)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"9_CR30","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0020-0190(00)00173-3","volume":"79","author":"C-P Schnorr","year":"2001","unstructured":"Schnorr, C.-P.: Small generic hardcore subsets for the discrete logarithm: short secret dl-keys. Inf. Process. Lett. 79(2), 93\u201398 (2001)","journal-title":"Inf. Process. Lett."},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1007\/3-540-69053-0_18","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201997","author":"V Shoup","year":"1997","unstructured":"Shoup, V.: Lower bounds for discrete logarithms and related problems. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 256\u2013266. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/3-540-69053-0_18"},{"key":"9_CR32","doi-asserted-by":"publisher","unstructured":"Wang, Y., Pan, J.: Non-Interactive Zero-Knowledge Proofs with Fine-Grained Security. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022. LNCS, vol. 13276. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_11","DOI":"10.1007\/978-3-031-07085-3_11"},{"key":"9_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/3-540-09519-5_73","volume-title":"Symbolic and Algebraic Computation","author":"R Zippel","year":"1979","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: Ng, E.W. (ed.) Symbolic and Algebraic Computation. LNCS, vol. 72, pp. 216\u2013226. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09519-5_73"}],"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_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,15]],"date-time":"2024-08-15T20:19:12Z","timestamp":1723753152000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-68379-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031683787","9783031683794"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-68379-4_9","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":"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"}}]}}