{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T05:31:30Z","timestamp":1768455090015,"version":"3.49.0"},"publisher-location":"Singapore","reference-count":38,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819609345","type":"print"},{"value":"9789819609352","type":"electronic"}],"license":[{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,9]],"date-time":"2024-12-09T00:00:00Z","timestamp":1733702400000},"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-981-96-0935-2_11","type":"book-chapter","created":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:01:39Z","timestamp":1733680899000},"page":"337-366","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Interactive Line-Point Zero-Knowledge with\u00a0Sublinear Communication and\u00a0Linear Computation"],"prefix":"10.1007","author":[{"given":"Fuchun","family":"Lin","sequence":"first","affiliation":[]},{"given":"Chaoping","family":"Xing","sequence":"additional","affiliation":[]},{"given":"Yizhou","family":"Yao","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,9]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: lightweight sublinear arguments without a trusted setup. In: CCS 2017, pp. 2087\u20132104. ACM (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Baum, C., Braun, L., Munch-Hansen, A., Scholl, P.: Moz$$\\mathbb{Z}_{2^k}$$arella: efficient vector-ole and zero-knowledge proofs over $$\\mathbb{Z}_{2^k}$$. In: CRYPTO 2022. LNCS, vol. 13510, pp. 329\u2013358. Springer (2022)","DOI":"10.1007\/978-3-031-15985-5_12"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Baum, C., et al.: Publicly verifiable zero-knowledge and post-quantum signatures from vole-in-the-head. In: CRYPTO 2023. LNCS, vol. 14085, pp. 581\u2013615. Springer (2023)","DOI":"10.1007\/978-3-031-38554-4_19"},{"issue":"11","key":"11_CR4","doi-asserted-by":"publisher","first-page":"3527","DOI":"10.1007\/s10623-023-01292-8","volume":"91","author":"C Baum","year":"2023","unstructured":"Baum, C., Dittmer, S., Scholl, P., Wang, X.: Sok: vector ole-based zero-knowledge protocols. Des. Codes Cryptogr. 91(11), 3527\u20133561 (2023)","journal-title":"Des. Codes Cryptogr."},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: Mac\u2019n\u2019cheese: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions. In: CRYPTO 2021. LNCS, vol. 12828, pp. 92\u2013122. Springer (2021)","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"11_CR6","doi-asserted-by":"publisher","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Fast reed-solomon interactive oracle proofs of proximity. In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. LIPIcs, vol.\u00a0107, pp. 14:1\u201314:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2018). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2018.14","DOI":"10.4230\/LIPIcs.ICALP.2018.14"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M.L., Kearns, M.J., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: CRYPTO 1993. LNCS, vol.\u00a0773, pp. 278\u2013291. Springer (1993)","DOI":"10.1007\/3-540-48329-2_24"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Ghadafi, E., Groth, J., Hajiabadi, M., Jakobsen, S.K.: Linear-time zero-knowledge proofs for arithmetic circuit satisfiability. In: ASIACRYPT 2017. LNCS, vol. 10626, pp. 336\u2013365. Springer (2017)","DOI":"10.1007\/978-3-319-70700-6_12"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Bootle, J., Chiesa, A., Liu, S.: Zero-knowledge iops with linear-time prover and polylogarithmic-time verifier. In: EUROCRYPT 2022. LNCS, vol. 13276, pp. 275\u2013304. Springer (2022)","DOI":"10.1007\/978-3-031-07085-3_10"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y.: Compressing vector OLE. In: CCS 2018, pp. 896\u2013912. ACM (2018)","DOI":"10.1145\/3243734.3243868"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Boyle, E., et al.: Efficient two-round OT extension and silent non-interactive secure computation. In: CCS 2019, pp. 291\u2013308. ACM (2019)","DOI":"10.1145\/3319535.3354255"},{"key":"11_CR12","doi-asserted-by":"crossref","unstructured":"Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Scholl, P.: Efficient pseudorandom correlation generators: silent OT extension and more. In: CRYPTO 2019. LNCS, vol. 11694, pp. 489\u2013518. Springer (2019)","DOI":"10.1007\/978-3-030-26954-8_16"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Canetti, R.: Universally composable security: a new paradigm for cryptographic protocols. In: FOCS 2001, pp. 136\u2013145. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959888"},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Goldwasser, S. (ed.) ITCS, 2012, pp. 90\u2013112. ACM (2012)","DOI":"10.1145\/2090236.2090245"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Cramer, R., Damg\u00e5rd, I.: Zero-knowledge proofs for finite field arithmetic; or: can zero-knowledge be for free? In: Krawczyk, H. (ed.) CRYPTO \u201998. vol.\u00a01462, pp. 424\u2013441. Springer (1998)","DOI":"10.1007\/BFb0055745"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Dittmer, S., Ishai, Y., Lu, S., Ostrovsky, R.: Improving line-point zero knowledge: two multiplications for the price of one. In: CCS 2022, pp. 829\u2013841. ACM (2022)","DOI":"10.1145\/3548606.3559385"},{"key":"11_CR17","unstructured":"Dittmer, S., Ishai, Y., Ostrovsky, R.: Line-point zero knowledge and its applications. In: ITC 2021. LIPIcs, vol.\u00a0199, pp. 5:1\u20135:24. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Druk, E., Ishai, Y.: Linear-time encodable codes meeting the gilbert-varshamov bound and their cryptographic applications. In: Naor, M. (ed.) Innovations in Theoretical Computer Science, ITCS\u201914, Princeton, NJ, USA, January 12-14, 2014, pp. 169\u2013182. ACM (2014)","DOI":"10.1145\/2554797.2554815"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. In: Dwork, C. (ed.) STOC 2008, pp. 113\u2013122. ACM (2008)","DOI":"10.1145\/1374376.1374396"},{"issue":"1","key":"11_CR20","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"Golovnev, A., Lee, J., Setty, S.T.V., Thaler, J., Wahby, R.S.: Brakedown: linear-time and field-agnostic snarks for R1CS. In: CRYPTO 2023. LNCS, vol. 14082, pp. 193\u2013226. Springer (2023)","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"11_CR22","unstructured":"Lee, J., Setty, S., Thaler, J., Wahby, R.: Linear-time and post-quantum zero-knowledge snarks for r1cs. Cryptology ePrint Archive (2021). https:\/\/eprint.iacr.org\/2021\/030"},{"key":"11_CR23","unstructured":"Lin, F., Xing, C., Yao, Y.: Interactive line-point zero-knowledge with sublinear communication and linear computation. IACR Cryptol. ePrint Arch. 1431 (2024). https:\/\/eprint.iacr.org\/2024\/1431"},{"key":"11_CR24","doi-asserted-by":"crossref","unstructured":"Lin, F., Xing, C., Yao, Y.: More efficient zero-knowledge protocols over $$\\mathbb{Z} _{2^k}$$ via galois rings. In: Reyzin, L., Stebila, D. (eds.) Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part IX. Lecture Notes in Computer Science, vol. 14928, pp. 424\u2013457. Springer (2024)","DOI":"10.1007\/978-3-031-68400-5_13"},{"issue":"4","key":"11_CR25","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H.J., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM 39(4), 859\u2013868 (1992)","journal-title":"J. ACM"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"Pedersen, T.P.: Non-interactive and information-theoretic secure verifiable secret sharing. In: Advances in Cryptology - CRYPTO \u201991, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings. Lecture Notes in Computer Science, vol.\u00a0576, pp. 129\u2013140. Springer (1991)","DOI":"10.1007\/3-540-46766-1_9"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"Roy, L.: Softspokenot: Quieter OT extension from small-field silent VOLE in the minicrypt model. In: CRYPTO 2022. LNCS, vol. 13507, pp. 657\u2013687. Springer (2022)","DOI":"10.1007\/978-3-031-15802-5_23"},{"key":"11_CR28","doi-asserted-by":"crossref","unstructured":"Setty, S.T.V.: Spartan: Efficient and general-purpose zksnarks without trusted setup. In: CRYPTO 2020. LNCS, vol. 12172, pp. 704\u2013737. Springer (2020)","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013. vol.\u00a08043, pp. 71\u201389. Springer (2013)","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S.T.V., Blumberg, A.J., Walfish, M.: A hybrid architecture for interactive verifiable computation. In: SP 2013, pp. 223\u2013237. IEEE Computer Society (2013)","DOI":"10.1109\/SP.2013.48"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zksnarks without trusted setup. In: SP 2018, pp. 926\u2013943. IEEE Computer Society (2018)","DOI":"10.1109\/SP.2018.00060"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Katz, J., Wang, X.: Wolverine: fast, scalable, and communication-efficient zero-knowledge proofs for Boolean and arithmetic circuits. In: IEEE Symposium on Security and Privacy 2021, pp. 1074\u20131091. IEEE (2021)","DOI":"10.1109\/SP40001.2021.00056"},{"key":"11_CR33","doi-asserted-by":"crossref","unstructured":"Weng, C., Yang, K., Yang, Z., Xie, X., Wang, X.: Antman: interactive zero-knowledge proofs with sublinear communication. In: CCS 2022, pp. 2901\u20132914. ACM (2022)","DOI":"10.1145\/3548606.3560667"},{"key":"11_CR34","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. In: Boldyreva, A., Micciancio, D. (eds.) CRYPTO 2019. LNCS, vol. 11694, pp. 733\u2013764. Springer (2019)","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"11_CR35","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, Y., Song, D.: Orion: zero knowledge proof with linear prover time. In: CRYPTO 2022. LNCS, vol. 13510, pp. 299\u2013328. Springer (2022)","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"11_CR36","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: Quicksilver: Efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: CCS 2021, pp. 2986\u20133001. ACM (2021)","DOI":"10.1145\/3460120.3484556"},{"key":"11_CR37","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) CCS \u201921, pp. 159\u2013177. ACM (2021)","DOI":"10.1145\/3460120.3484767"},{"key":"11_CR38","doi-asserted-by":"crossref","unstructured":"Zhang, J., Xie, T., Zhang, Y., Song, D.: Transparent polynomial delegation and its applications to zero knowledge proof. In: SP 2020, pp. 859\u2013876. IEEE (2020)","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology \u2013 ASIACRYPT 2024"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-96-0935-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,8]],"date-time":"2024-12-08T18:02:48Z","timestamp":1733680968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-96-0935-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,9]]},"ISBN":["9789819609345","9789819609352"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-981-96-0935-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,12,9]]},"assertion":[{"value":"9 December 2024","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":"Kolkata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","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":"10 December 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 December 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"asiacrypt2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/asiacrypt.iacr.org\/2024\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}