{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T01:13:42Z","timestamp":1779326022646,"version":"3.51.4"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031223174","type":"print"},{"value":"9783031223181","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22318-1_18","type":"book-chapter","created":{"date-parts":[[2022,12,21]],"date-time":"2022-12-21T03:04:30Z","timestamp":1671591870000},"page":"497-525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Doubly Efficient Interactive Proofs over\u00a0Infinite and\u00a0Non-commutative Rings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4882-0230","authenticated-orcid":false,"given":"Eduardo","family":"Soria-Vazquez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,21]]},"reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/978-3-030-36030-6_19","volume-title":"Theory of Cryptography","author":"M Abspoel","year":"2019","unstructured":"Abspoel, M., Cramer, R., Damg\u00e5rd, I., Escudero, D., Yuan, C.: Efficient information-theoretic secure multiparty computation over $$\\mathbb{Z}\/p^k\\mathbb{Z}$$ via\u00a0galois rings. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019, Part I. LNCS, vol. 11891, pp. 471\u2013501. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_19"},{"key":"18_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-14165-2_14","volume-title":"Automata, Languages and Programming","author":"B Applebaum","year":"2010","unstructured":"Applebaum, B., Ishai, Y., Kushilevitz, E.: From secrecy to soundness: efficient verification via secure computation. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf der Heide, F., Spirakis, P.G. (eds.) ICALP 2010, Part I. LNCS, vol. 6198, pp. 152\u2013163. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14165-2_14"},{"key":"18_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-030-75248-4_19","volume-title":"Public-Key Cryptography \u2013 PKC 2021","author":"A Bois","year":"2021","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: Garay, J.A. (ed.) PKC 2021, Part II. LNCS, vol. 12711, pp. 528\u2013558. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-75248-4_19"},{"key":"18_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1007\/978-3-030-84242-0_26","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"J Bootle","year":"2021","unstructured":"Bootle, J., Chiesa, A., Sotiraki, K.: Sumcheck arguments and their applications. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part I. LNCS, vol. 12825, pp. 742\u2013773. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84242-0_26"},{"issue":"1","key":"18_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF01200056","volume":"1","author":"L Babai","year":"1991","unstructured":"Babai, L., Fortnow, L., Lund, C.: Non-deterministic exponential time has two-prover interactive protocols. Comput. Complex. 1(1), 3\u201340 (1991)","journal-title":"Comput. Complex."},{"key":"18_CR6","unstructured":"Chen, S., Cheon, J.H., Kim, D., Park, D.: Verifiable computing for approximate computation. Cryptology ePrint Archive, Report 2019\/762 (2019). http:\/\/eprint.iacr.org\/2019\/762"},{"key":"18_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/978-3-642-40084-1_11","volume-title":"Advances in Cryptology \u2013 CRYPTO 2013","author":"G Cohen","year":"2013","unstructured":"Cohen, G., et al.: Efficient multiparty protocols via log-depth threshold formulae (extended abstract). In: Canetti, R., Garay, J.A. (eds.) CRYPTO 2013, Part II. LNCS, vol. 8043, pp. 185\u2013202. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40084-1_11"},{"key":"18_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/3-540-39200-9_37","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2003","author":"R Cramer","year":"2003","unstructured":"Cramer, R., Fehr, S., Ishai, Y., Kushilevitz, E.: Efficient multi-party computation over rings. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 596\u2013613. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-39200-9_37"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Cormode, G., Mitzenmacher, M., Thaler, J.: Practical verified computation with streaming interactive proofs. In: Goldwasser, S. (eds.) ITCS 2012, pp. 90\u2013112. ACM, January 2012","DOI":"10.1145\/2090236.2090245"},{"key":"18_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-64840-4_8","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2020","author":"A Dalskov","year":"2020","unstructured":"Dalskov, A., Lee, E., Soria-Vazquez, E.: Circuit amortization friendly encodingsand their application to statistically secure multiparty computation. In: Moriai, S., Wang, H. (eds.) ASIACRYPT 2020, Part III. LNCS, vol. 12493, pp. 213\u2013243. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64840-4_8"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-030-84245-1_12","volume-title":"Advances in Cryptology \u2013 CRYPTO 2021","author":"D Escudero","year":"2021","unstructured":"Escudero, D., Soria-Vazquez, E.: Efficient information-theoretic multi-party computation over non-commutative rings. In: Malkin, T., Peikert, C. (eds.) CRYPTO 2021, Part II. LNCS, vol. 12826, pp. 335\u2013364. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-84245-1_12"},{"key":"18_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Be\u010dv\u00e1\u0159, J. (ed.) MFCS 1979. LNCS, vol. 74, pp. 57\u201369. Springer, Heidelberg (1979). https:\/\/doi.org\/10.1007\/3-540-09526-8_5"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Rothblum, G.N.: Delegating computation: interactive proofs for muggles. J. ACM (JACM) 62(4), 1\u201364 (2015)","DOI":"10.1145\/2699436"},{"issue":"1","key":"18_CR14","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":"18_CR15","unstructured":"Ganesh, C., Nitulescu, A., Soria-Vazquez, E.: Rinocchio: snarks for ring arithmetic. Cryptology ePrint Archive, Report 2021\/322 (2021). http:\/\/eprint.iacr.org\/2021\/322"},{"key":"18_CR16","unstructured":"Howell, T.D., Lafon, J.-C.: The complexity of the quaternion product. Technical report, Cornell University (1975)"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Holmgren, J., Rothblum, R.: Delegating computations with (almost) minimal time and space overhead. In: Thorup, M. (eds.) 59th FOCS, pp. 124\u2013135. IEEE Computer Society Press, October 2018","DOI":"10.1109\/FOCS.2018.00021"},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.4086\/toc.2011.v007a008","volume":"7","author":"P Hrube\u0161","year":"2011","unstructured":"Hrube\u0161, P., Yehudayoff, A.: Arithmetic complexity in ring extensions. Theory Comput. 7(1), 119\u2013129 (2011)","journal-title":"Theory Comput."},{"key":"18_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1007\/978-3-540-24676-3_26","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Ishai","year":"2004","unstructured":"Ishai, Y., Kushilevitz, E.: On the hardness of information-theoretic multiparty computation. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 439\u2013455. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_26"},{"issue":"4","key":"18_CR20","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., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","journal-title":"J. ACM (JACM)"},{"key":"18_CR21","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, X., Zhang, Y.: zkCNN: zero knowledge proofs for convolutional neural network predictions and accuracy. In: Vigna, G., Shi, E. (eds.) ACM CCS 2021, pp. 2968\u20132985. ACM Press, November 2021","DOI":"10.1145\/3460120.3485379"},{"issue":"1","key":"18_CR22","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1137\/110829660","volume":"42","author":"O Meir","year":"2013","unstructured":"Meir, O.: IP = PSPACE using error-correcting codes. SIAM J. Comput. 42(1), 380\u2013403 (2013)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"18_CR23","doi-asserted-by":"publisher","first-page":"5882","DOI":"10.1109\/TIT.2013.2264797","volume":"59","author":"G Quintin","year":"2013","unstructured":"Quintin, G., Barbier, M., Chabot, C.: On generalized Reed-Solomon codes over commutative and noncommutative rings. IEEE Trans. Inf. Theory 59(9), 5882\u20135897 (2013)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"18_CR24","unstructured":"Soria-Vazquez, E.: Doubly efficient interactive proofs over infinite and non-commutative rings. Cryptology ePrint Archive, Paper 2022\/587 (2022). http:\/\/eprint.iacr.org\/2022\/587"},{"key":"18_CR25","doi-asserted-by":"crossref","unstructured":"Schott, R., Stacey Staples, G.: Reductions in computational complexity using Clifford algebras. Adv. Appl. Clifford Algebras 20(1), 121\u2013140 (2010)","DOI":"10.1007\/s00006-008-0143-2"},{"key":"18_CR26","unstructured":"Thaler, J.R.: Practical verified computation with streaming interactive proofs. Ph.D. thesis (2013)"},{"key":"18_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1007\/978-3-030-26954-8_24","volume-title":"Advances in Cryptology \u2013 CRYPTO 2019","author":"T Xie","year":"2019","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, Part III. LNCS, vol. 11694, pp. 733\u2013764. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26954-8_24"},{"key":"18_CR28","doi-asserted-by":"crossref","unstructured":"Zhang, J., et al.: Doubly efficient interactive proofs for general arithmetic circuits with linear prover time. In: Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pp. 159\u2013177 (2021)","DOI":"10.1145\/3460120.3484767"}],"container-title":["Lecture Notes in Computer Science","Theory of Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-22318-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T01:02:02Z","timestamp":1766278922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22318-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031223174","9783031223181"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22318-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 December 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TCC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Theory of Cryptography Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","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":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tcc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tcc.iacr.org\/2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"HotCRP","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"139","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"60","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9.9","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}