{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T05:55:21Z","timestamp":1757570121351,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031577246"},{"type":"electronic","value":"9783031577253"}],"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-57725-3_12","type":"book-chapter","created":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:56:16Z","timestamp":1713056176000},"page":"356-386","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Rate-1 Fully Local Somewhere Extractable Hashing from\u00a0DDH"],"prefix":"10.1007","author":[{"given":"Pedro","family":"Branco","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5914-7635","authenticated-orcid":false,"given":"Nico","family":"D\u00f6ttling","sequence":"additional","affiliation":[]},{"given":"Akshayaram","family":"Srinivasan","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0001-2086-8398","authenticated-orcid":false,"given":"Riccardo","family":"Zanotto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,4,14]]},"reference":[{"key":"12_CR1","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1007\/978-3-030-03810-6_17","volume-title":"TCC 2018, Part II","author":"P Ananth","year":"2018","unstructured":"Ananth, P., Lombardi, A.: Succinct garbling schemes from functional encryption through a local simulation paradigm. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 455\u2013472. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_17"},{"key":"12_CR2","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/978-3-662-53018-4_19","volume-title":"CRYPTO 2016, Part I","author":"E Boyle","year":"2016","unstructured":"Boyle, E., Gilboa, N., Ishai, Y.: Breaking the circuit size barrier for secure computation under DDH. In: Robshaw, M., Katz, J. (eds.) CRYPTO 2016, Part I. LNCS, vol. 9814, pp. 509\u2013539. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53018-4_19"},{"key":"12_CR3","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-030-64375-1_3","volume-title":"TCC 2020, Part I","author":"Z Brakerski","year":"2020","unstructured":"Brakerski, Z., Branco, P., D\u00f6ttling, N., Garg, S., Malavolta, G.: Constant ciphertext-rate non-committing encryption from standard assumptions. In: Pass, R., Pietrzak, K. (eds.) TCC 2020, Part I. LNCS, vol. 12550, pp. 58\u201387. Springer, Heidelberg (Nov (2020). https:\/\/doi.org\/10.1007\/978-3-030-64375-1_3"},{"key":"12_CR4","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: Hatami, H., McKenzie, P., King, V. (eds.) 49th ACM STOC, pp. 474\u2013482. ACM Press (2017)","DOI":"10.1145\/3055399.3055497"},{"key":"12_CR5","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-63715-0_2","volume-title":"CRYPTO 2017, Part II","author":"C Cho","year":"2017","unstructured":"Cho, C., D\u00f6ttling, N., Garg, S., Gupta, D., Miao, P., Polychroniadou, A.: Laconic oblivious transfer and its applications. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part II. LNCS, vol. 10402, pp. 33\u201365. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63715-0_2"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-031-38551-3_20","volume-title":"Advances in Cryptology","author":"AR Choudhuri","year":"2023","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: Handschuh, H., Lysyanskaya, A. (eds.) CRYPTO 2023. LNCS, pp. 635\u2013668. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-38551-3_20"},{"key":"12_CR7","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-030-84259-8_14","volume-title":"CRYPTO 2021, Part IV","author":"AR Choudhuri","year":"2021","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part IV. LNCS, vol. 12828, pp. 394\u2013423. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-84259-8_14"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal{P}$$ from LWE. In: 62nd FOCS, pp. 68\u201379. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS52979.2021.00016"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: 63rd FOCS, pp. 1057\u20131068. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"12_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/978-3-319-63688-7_18","volume-title":"CRYPTO 2017, Part I","author":"N D\u00f6ttling","year":"2017","unstructured":"D\u00f6ttling, N., Garg, S.: Identity-based encryption from the Diffie-Hellman assumption. In: Katz, J., Shacham, H. (eds.) CRYPTO 2017, Part I. LNCS, vol. 10401, pp. 537\u2013569. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-319-63688-7_18"},{"key":"12_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-030-26954-8_1","volume-title":"CRYPTO 2019, Part III","author":"N D\u00f6ttling","year":"2019","unstructured":"D\u00f6ttling, N., Garg, S., Ishai, Y., Malavolta, G., Mour, T., Ostrovsky, R.: Trapdoor hash functions and their applications. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part III. LNCS, vol. 11694, pp. 3\u201332. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_1"},{"key":"12_CR12","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/978-3-030-03810-6_16","volume-title":"TCC 2018, Part II","author":"S Garg","year":"2018","unstructured":"Garg, S., Srinivasan, A.: A simple construction of iO for turing machines. In: Beimel, A., Dziembowski, S. (eds.) TCC 2018, Part II. LNCS, vol. 11240, pp. 425\u2013454. Springer, Heidelberg (2018). https:\/\/doi.org\/10.1007\/978-3-030-03810-6_16"},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Hubacek, P., Wichs, D.: On the communication complexity of secure function evaluation with long output. In: Roughgarden, T. (ed.) ITCS 2015, pp. 163\u2013172. ACM (2015)","DOI":"10.1145\/2688073.2688105"},{"key":"12_CR14","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1007\/978-3-031-07085-3_18","volume-title":"EUROCRYPT 2022, Part II","author":"J Hulett","year":"2022","unstructured":"Hulett, J., Jawale, R., Khurana, D., Srinivasan, A.: SNARGs for P from sub-exponential DDH and QR. In: Dunkelman, O., Dziembowski, S. (eds.) EUROCRYPT 2022, Part II. LNCS, vol. 13276, pp. 520\u2013549. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-07085-3_18"},{"key":"12_CR15","doi-asserted-by":"publisher","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and ram delegation. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, STOC 2023, pp. 1545\u20131552. Association for Computing Machinery, New York (2023). https:\/\/doi.org\/10.1145\/3564246.3585200","DOI":"10.1145\/3564246.3585200"},{"key":"12_CR16","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-030-90459-3_12","volume-title":"TCC 2021, Part I","author":"YT Kalai","year":"2021","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: Nissim, K., Waters, B. (eds.) TCC 2021, Part I. LNCS, vol. 13042, pp. 330\u2013368. Springer, Heidelberg (2021). https:\/\/doi.org\/10.1007\/978-3-030-90459-3_12"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Koppula, V., Lewko, A.B., Waters, B.: Indistinguishability obfuscation for turing machines with unbounded memory. In: Servedio, R.A., Rubinfeld, R. (eds.) 47th ACM STOC, pp. 419\u2013428. ACM Press (2015)","DOI":"10.1145\/2746539.2746614"},{"key":"12_CR18","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-662-48797-6_6","volume-title":"ASIACRYPT 2015, Part I","author":"T Okamoto","year":"2015","unstructured":"Okamoto, T., Pietrzak, K., Waters, B., Wichs, D.: New realizations of somewhere statistically binding hashing and positional accumulators. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015, Part I. LNCS, vol. 9452, pp. 121\u2013145. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_6"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: 63rd FOCS, pp. 1045\u20131056. IEEE Computer Society Press (2022)","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. In: Gabow, H.N., Fagin, R. (eds.) 37th ACM STOC, pp. 84\u201393. ACM Press (2005)","DOI":"10.1145\/1060590.1060603"},{"key":"12_CR21","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/978-3-031-15979-4_15","volume-title":"CRYPTO 2022, Part II","author":"B Waters","year":"2022","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: Dodis, Y., Shrimpton, T. (eds.) CRYPTO 2022, Part II. LNCS, vol. 13508, pp. 433\u2013463. Springer, Heidelberg (2022). https:\/\/doi.org\/10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Public-Key Cryptography \u2013 PKC 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-57725-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T01:00:13Z","timestamp":1713056413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-57725-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031577246","9783031577253"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-57725-3_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":"14 April 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PKC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IACR International Conference on Public-Key Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","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":"15 April 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 April 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pkc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}