{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T16:10:59Z","timestamp":1786291859225,"version":"3.56.0"},"publisher-location":"Singapore","reference-count":50,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819551156","type":"print"},{"value":"9789819551163","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,12,8]],"date-time":"2025-12-08T00:00:00Z","timestamp":1765152000000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-5116-3_18","type":"book-chapter","created":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T11:22:28Z","timestamp":1765106548000},"page":"554-577","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Pairing-Based Batch Arguments for\u00a0NP with\u00a0a\u00a0Linear-Size CRS"],"prefix":"10.1007","author":[{"given":"Binyi","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Noel","family":"Elias","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,12,8]]},"reference":[{"key":"18_CR1","unstructured":"Afshar, A., Cheng, J., Goyal, R.: Multi-hop multi-key homomorphic signatures with context hiding from standard assumptions. IACR Cryptol. ePrint Arch. (2024)"},{"key":"18_CR2","unstructured":"Afshar, A., Cheng, J., Goyal, R., Yadav, A., Yadugiri, S.: Encrypted RAM delegation: applications to rate-1 extractable arguments, homomorphic NIZKs, MPC, and more. IACR Cryptol. ePrint Arch. (2024)"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Anthoine, G., Balb\u00e1s, D., Fiore, D.: Fully-succinct multi-key homomorphic signatures from standard assumptions. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68382-4_10"},{"key":"18_CR4","doi-asserted-by":"crossref","unstructured":"Behrend, F.: On sets of integers which contain no three terms in arithmetical progression. Proc. Nat. Acad. Sci. 32(12) (1946)","DOI":"10.1073\/pnas.32.12.331"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., Virza, M.: SNARKs for C: verifying program executions succinctly and in zero knowledge. In: CRYPTO (2013)","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"18_CR6","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von Neumann architecture. In: USENIX Security Symposium (2014)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Chiesa, A., Ishai, Y., Ostrovsky, R., Paneth, O.: Succinct non-interactive arguments via linear interactive proofs. In: TCC (2013)","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Harsha, P., Ishai, Y., Rothblum, R.D., Wu, D.J.: Dot-product proofs and their applications. In: FOCS (2024)","DOI":"10.1109\/FOCS61266.2024.00057"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Bitansky, N., Kamath, C., Paneth, O., Rothblum, R.D., Vasudevan, P.N.: Batch proofs are statistically hiding. In: STOC (2024)","DOI":"10.1145\/3618260.3649775"},{"key":"18_CR10","unstructured":"Bloom, T.F., Sisask, O.: Breaking the logarithmic barrier in Roth\u2019s theorem on arithmetic progressions. arXiv preprint arXiv:2007.03528 (2020)"},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyen, X., Goh, E.: Hierarchical identity based encryption with constant size ciphertext. In: EUROCRYPT (2005)","DOI":"10.1007\/11426639_26"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Boneh, D., Boyle, E., Corrigan-Gibbs, H., Gilboa, N., Ishai, Y.: Zero-knowledge proofs on secret-shared data via fully linear PCPs. In: CRYPTO (2019)","DOI":"10.1007\/978-3-030-26954-8_3"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Boneh, D., Goh, E., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: TCC (2005)","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Bradley, E., Waters, B., Wu, D.J.: Batch arguments to NIZKs from one-way functions. In: TCC (2024)","DOI":"10.1007\/978-3-031-78017-2_15"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Holmgren, J., Kalai, Y.T.: Non-interactive delegation and batch NP verification from standard computational assumptions. In: STOC (2017)","DOI":"10.1145\/3055399.3055497"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Branco, P., D\u00f6ttling, N., Srinivasan, A.: Rate-1 statistical non-interactive zero-knowledge. In: CRYPTO (2025)","DOI":"10.1007\/978-3-032-01907-3_17"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Brodsky, M.F., Choudhuri, A.R., Jain, A., Paneth, O.: Monotone-policy aggregate signatures. In: EUROCRYPT (2024)","DOI":"10.1007\/978-3-031-58737-5_7"},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Canetti, R., et al.: Fiat-Shamir: from practice to theory. In: STOC (2019)","DOI":"10.1145\/3313276.3316380"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Canetti, R., Goldreich, O., Halevi, S.: The random oracle methodology, revisited. J. ACM 51(4) (2004)","DOI":"10.1145\/1008731.1008734"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Champion, J., Wu, D.J.: Non-interactive zero-knowledge from non-interactive batch arguments. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38545-2_2"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Garg, S., Jain, A., Jin, Z., Zhang, J.: Correlation intractability and SNARGs from sub-exponential DDH. In: CRYPTO (2023)","DOI":"10.1007\/978-3-031-38551-3_20"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: Non-interactive batch arguments for NP from standard assumptions. In: CRYPTO (2021)","DOI":"10.1007\/978-3-030-84259-8_14"},{"key":"18_CR23","unstructured":"Choudhuri, A.R., Jain, A., Jin, Z.: SNARGs for $$\\cal P\\it $$ from LWE. In: FOCS (2021)"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Danezis, G., Fournet, C., Groth, J., Kohlweiss, M.: Square span programs with applications to succinct NIZK arguments. In: ASIACRYPT (2014)","DOI":"10.1007\/978-3-662-45611-8_28"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Devadas, L., Goyal, R., Kalai, Y., Vaikuntanathan, V.: Rate-1 non-interactive arguments for batch-NP and applications. In: FOCS (2022)","DOI":"10.1109\/FOCS54457.2022.00103"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Devadas, L., Jain, A., Waters, B., Wu, D.J.: Succinct witness encryption for batch languages and applications (2025)","DOI":"10.1007\/978-981-95-5125-5_5"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Elkin, M.: An improved construction of progression-free sets. In: SODA (2010)","DOI":"10.1137\/1.9781611973075.72"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Erd\u00f6s, P., Tur\u00e1n, P.: On some sequences of integers. J. London Math. Soc. 1(4) (1936)","DOI":"10.1112\/jlms\/s1-11.4.261"},{"key":"18_CR29","doi-asserted-by":"crossref","unstructured":"Garg, R., Lu, G., Waters, B., Wu, D.J.: Reducing the CRS size in registered ABE systems. In: CRYPTO (2024)","DOI":"10.1007\/978-3-031-68382-4_5"},{"key":"18_CR30","unstructured":"Gasarch, W., Kruskal, C.: Finding large sets without arithmetic progressions of length three: an empirical view and survey II (2024). https:\/\/www.cs.umd.edu\/~gasarch\/BLOGPAPERS\/3apsurvey.pdf"},{"key":"18_CR31","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct NIZKs without PCPs. In: EUROCRYPT (2013)","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"18_CR32","doi-asserted-by":"crossref","unstructured":"Ghosal, R., Sahai, A., Waters, B.: Non-interactive publicly-verifiable delegation of committed programs. In: PKC (2023)","DOI":"10.1007\/978-3-031-31371-4_20"},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Groth, J.: Short pairing-based non-interactive zero-knowledge arguments. In: ASIACRYPT (2010)","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: EUROCRYPT (2016)","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"18_CR35","doi-asserted-by":"crossref","unstructured":"Heath-Brown, D.R.: Integer sets containing no arithmetic progressions. J. London Math. Soc. 2(3) (1987)","DOI":"10.1112\/jlms\/s2-35.3.385"},{"key":"18_CR36","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short PCPs. In: CCC (2007)","DOI":"10.1109\/CCC.2007.10"},{"key":"18_CR37","doi-asserted-by":"crossref","unstructured":"Kalai, Y., Lombardi, A., Vaikuntanathan, V., Wichs, D.: Boosting batch arguments and RAM delegation. In: STOC (2023)","DOI":"10.1145\/3564246.3585200"},{"key":"18_CR38","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Paneth, O., Yang, L.: How to delegate computations publicly. In: STOC (2019)","DOI":"10.1145\/3313276.3316411"},{"key":"18_CR39","doi-asserted-by":"crossref","unstructured":"Kalai, Y.T., Vaikuntanathan, V., Zhang, R.Y.: Somewhere statistical soundness, post-quantum security, and SNARGs. In: TCC (2021)","DOI":"10.1007\/978-3-030-90459-3_12"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Kate, A., Zaverucha, G.M., Goldberg, I.: Constant-size commitments to polynomials and their applications. In: ASIACRYPT (2010)","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"18_CR41","unstructured":"Katz, J., Sahai, A., Waters, B.: Predicate encryption supporting disjunctions, polynomial equations, and inner products. In: EUROCRYPT (2008)"},{"key":"18_CR42","doi-asserted-by":"crossref","unstructured":"Kelley, Z., Meka, R.: Strong bounds for 3-progressions. In: FOCS (2023)","DOI":"10.1109\/FOCS57990.2023.00059"},{"key":"18_CR43","doi-asserted-by":"crossref","unstructured":"Lipmaa, H.: Progression-free sets and sublinear pairing-based non-interactive zero-knowledge arguments. In: TCC (2012)","DOI":"10.1007\/978-3-642-28914-9_10"},{"key":"18_CR44","doi-asserted-by":"crossref","unstructured":"Nassar, S., Waters, B., Wu, D.J.: Monotone policy BARGs from BARGs and additively homomorphic encryption. In: TCC (2024)","DOI":"10.1007\/978-3-031-78017-2_14"},{"key":"18_CR45","doi-asserted-by":"crossref","unstructured":"Nassar, S., Waters, B., Wu, D.J.: Monotone-policy BARGs and more from BARGs and quadratic residuosity. In: PKC (2025)","DOI":"10.1007\/978-3-031-91829-2_9"},{"key":"18_CR46","doi-asserted-by":"crossref","unstructured":"Paneth, O., Pass, R.: Incrementally verifiable computation via rate-1 batch arguments. In: FOCS (2022)","DOI":"10.1109\/FOCS54457.2022.00102"},{"key":"18_CR47","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: IEEE S &P (2013)","DOI":"10.1109\/SP.2013.47"},{"key":"18_CR48","doi-asserted-by":"crossref","unstructured":"Roth, K.F.: On certain sets of integers. J. London Math. Soc. 1(1) (1953)","DOI":"10.1112\/jlms\/s1-28.1.104"},{"key":"18_CR49","doi-asserted-by":"crossref","unstructured":"Szemer\u00e9di, E.: Integer sets containing no arithmetic progressions. Acta Math. Hung. 56(1) (1990)","DOI":"10.1007\/BF01903717"},{"key":"18_CR50","doi-asserted-by":"crossref","unstructured":"Waters, B., Wu, D.J.: Batch arguments for NP and more from standard bilinear group assumptions. In: CRYPTO (2022)","DOI":"10.1007\/978-3-031-15979-4_15"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2025"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-5116-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T09:33:19Z","timestamp":1768383199000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-5116-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,12,8]]},"ISBN":["9789819551156","9789819551163"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-5116-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,12,8]]},"assertion":[{"value":"8 December 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ASIACRYPT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Theory and Application of Cryptology and Information Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 December 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}