{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T16:50:31Z","timestamp":1755795031419,"version":"3.44.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032019066"},{"type":"electronic","value":"9783032019073"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-01907-3_19","type":"book-chapter","created":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:47Z","timestamp":1755383267000},"page":"580-610","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Weak NIZKs, One-Way Functions and\u00a0Amplification"],"prefix":"10.1007","author":[{"given":"Suvradip","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"James","family":"Hulett","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dakshita","family":"Khurana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,17]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Geier, N.: Amplification of non-interactive zero knowledge, revisited. In: Reyzin, L., Stebila, D. (eds.) Proceedings of the 44th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO 2024, Part IX, Santa Barbara, CA, USA, 18\u201322 August 2024. LNCS, vol. 14928, pp. 361\u2013390. Springer, Heidelberg (2024). https:\/\/doi.org\/10.1007\/978-3-031-68400-5_11","DOI":"10.1007\/978-3-031-68400-5_11"},{"key":"19_CR2","doi-asserted-by":"publisher","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, 24\u201328 June 2024, pp. 435\u2013443. ACM (2024). https:\/\/doi.org\/10.1145\/3618260.3649775","DOI":"10.1145\/3618260.3649775"},{"key":"19_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1007\/978-3-030-26951-7_21","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"V Goyal","year":"2019","unstructured":"Goyal, V., Jain, A., Sahai, A.: Simultaneous amplification: the case of non-interactive zero-knowledge. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019, Part II. LNCS, vol. 11693, pp. 608\u2013637. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26951-7_21"},{"key":"19_CR4","doi-asserted-by":"publisher","unstructured":"Hirahara, S., Nanashima, M.: One-way functions and zero knowledge. In: Mohar, B., Shinkar, I., O\u2019Donnell, R. (eds.) Proceedings of the 56th Annual ACM Symposium on Theory of Computing, STOC 2024, Vancouver, BC, Canada, 24\u201328 June 2024, pp. 1731\u20131738. ACM (2024). https:\/\/doi.org\/10.1145\/3618260.3649701","DOI":"10.1145\/3618260.3649701"},{"issue":"4","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/S0097539793244708","volume":"28","author":"J H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from any one-way function. SIAM J. Comput. 28(4), 1364\u20131396 (1999). https:\/\/doi.org\/10.1137\/S0097539793244708","journal-title":"SIAM J. Comput."},{"key":"19_CR6","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Levin, L.: No better ways to generate hard np instances than picking uniformly at random. In: 1990 Proceedings of the 31st Annual Symposium on Foundations of Computer Science, vol. 2, pp. 812\u2013821 (1990). https:\/\/doi.org\/10.1109\/FSCS.1990.89604","DOI":"10.1109\/FSCS.1990.89604"},{"key":"19_CR7","doi-asserted-by":"publisher","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography. In: 30th Annual Symposium on Foundations of Computer Science, pp. 230\u2013235 (1989). https:\/\/doi.org\/10.1109\/SFCS.1989.63483","DOI":"10.1109\/SFCS.1989.63483"},{"key":"19_CR8","unstructured":"Impagliazzo, R.: Pseudo-random generators for cryptography and for randomized algorithms. Ph.D. thesis. University of California, Berkeley (1992)"},{"key":"19_CR9","unstructured":"Liu, Y., Mazor, N., Pass, R.: A note on zero-knowledge for NP and one-way functions. Cryptology ePrint Archive, Paper 2024\/800 (2024). https:\/\/eprint.iacr.org\/2024\/800"},{"key":"19_CR10","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R.: One-way functions, hard on average problems, and statistical zero-knowledge proofs. In: Proceedings of the Sixth Annual Structure in Complexity Theory Conference, Chicago, Illinois, USA, 30 June\u20133 July 1991, pp. 133\u2013138. IEEE Computer Society (1991). https:\/\/doi.org\/10.1109\/SCT.1991.160253","DOI":"10.1109\/SCT.1991.160253"},{"key":"19_CR11","doi-asserted-by":"publisher","unstructured":"Ostrovsky, R., Wigderson, A.: One-way functions are essential for non-trivial zero-knowledge. In: Proceedings of the Second Israel Symposium on Theory of Computing Systems, ISTCS 1993, Natanya, Israel, 7\u20139 June 1993, pp. 3\u201317. IEEE Computer Society (1993). https:\/\/doi.org\/10.1109\/ISTCS.1993.253489","DOI":"10.1109\/ISTCS.1993.253489"},{"key":"19_CR12","doi-asserted-by":"publisher","unstructured":"Yao, A.C.: Theory and application of trapdoor functions. In: 23rd Annual Symposium on Foundations of Computer Science, SFCS 1982, pp. 80\u201391 (1982). https:\/\/doi.org\/10.1109\/SFCS.1982.45","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 CRYPTO 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-01907-3_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,16]],"date-time":"2025-08-16T22:27:48Z","timestamp":1755383268000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-01907-3_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032019066","9783032019073"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-01907-3_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 August 2025","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"crypto2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/crypto.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}