{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T08:29:08Z","timestamp":1761294548508,"version":"3.37.3"},"reference-count":73,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (NRF) funded by the Korean Government Ministry of Science and ICT","doi-asserted-by":"publisher","award":["NRF-2022R1A5A6000840"],"award-info":[{"award-number":["NRF-2022R1A5A6000840"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/access.2022.3223136","type":"journal-article","created":{"date-parts":[[2022,11,17]],"date-time":"2022-11-17T20:33:54Z","timestamp":1668717234000},"page":"122706-122725","source":"Crossref","is-referenced-by-count":3,"title":["Interactive Proofs for Rounding Arithmetic"],"prefix":"10.1109","volume":"10","author":[{"given":"Shuo","family":"Chen","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7085-2220","authenticated-orcid":false,"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[{"name":"Department of Mathematical Sciences, Seoul National University, Seoul, South Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5780-7110","authenticated-orcid":false,"given":"Dongwoo","family":"Kim","sequence":"additional","affiliation":[{"name":"Western Digital Research, Milpitas, CA, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1551-2597","authenticated-orcid":false,"given":"Daejun","family":"Park","sequence":"additional","affiliation":[{"name":"Andreessen Horowitz, Menlo Park, CA, USA"}]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1080\/00029890.2005.11920264"},{"journal-title":"Abstract Algebra","year":"2007","author":"garret","key":"ref72"},{"key":"ref71","first-page":"138","article-title":"Fields and Galois theory (V4. 60)","volume":"3","author":"milne","year":"2018","journal-title":"Order"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"ref39","first-page":"781","article-title":"Succinct non-interactive zero knowledge for a von Neumann architecture","author":"ben-sasson","year":"2014","journal-title":"Proc Usenix Secur Symp"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488681"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"ref34","first-page":"253","article-title":"Taking proof-based verified computation a few steps closer to practicality","author":"setty","year":"2012","journal-title":"Proc Usenix Secur Symp"},{"key":"ref60","volume":"28","author":"mcdonald","year":"1974","journal-title":"Finite Rings with Identity"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.2307\/2007970"},{"journal-title":"Why GEMM is at the heart of deep learning","year":"2015","author":"warden","key":"ref61"},{"key":"ref63","article-title":"Empirical measurements of disk failure rates and error rates","author":"gray","year":"2007","journal-title":"arXiv cs\/0701166"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1965-0178586-1"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484767"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2009.934155"},{"journal-title":"Vector commitments over rings and compressed ?-protocols","year":"2022","author":"thomas","key":"ref66"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/129712.129782"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3460120.3484812"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"journal-title":"Verifiable computing for approximate arithmetic","year":"2020","author":"kim","key":"ref1"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_41"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_20"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133984"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.51"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/2047485.2047488"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref25","article-title":"Verifiable computation with massively parallel interactive proofs","author":"thaler","year":"2012","journal-title":"arXiv 1202 1350"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422481"},{"journal-title":"A note on the GKR protocol","year":"2015","author":"thaler","key":"ref59"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/146585.146605"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/322217.322225"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5906-5_417"},{"key":"ref55","article-title":"CryptoDL: Deep neural networks over encrypted data","author":"hesamifard","year":"2017","journal-title":"arXiv 1711 05189"},{"journal-title":"Exp-Normalize Trick","year":"2014","author":"vieira","key":"ref54"},{"key":"ref53","article-title":"Targeted backdoor attacks on deep learning systems using data poisoning","author":"chen","year":"2017","journal-title":"arXiv 1712 05526"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23097"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref11","first-page":"17","article-title":"Making argument systems for outsourced computation practical (sometimes)","volume":"1","author":"setty","year":"2012","journal-title":"Proc NDSS"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2017.43"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2517349.2522733"},{"key":"ref14","first-page":"71","article-title":"Time-optimal interactive proofs for circuit evaluation","author":"thaler","year":"2013","journal-title":"Proc Adv Cryptol (CRYPTO)"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-78381-9_12"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1137\/0202007"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548317000566"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.48"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"ref8","first-page":"339","article-title":"Proving the correct execution of concurrent services in zero-knowledge","author":"setty","year":"2018","journal-title":"Proc 5th USENIX Conf Operating Syst Design Implementation"},{"key":"ref49","first-page":"2129","article-title":"MIRAGE: Succinct arguments for randomized algorithms with applications to universal zk-SNARKs","author":"kosba","year":"2020","journal-title":"Proc 29th USENIX Secur Symp (USENIX Security)"},{"key":"ref7","first-page":"765","article-title":"TRUESET: Faster verifiable set computations","author":"kosba","year":"2014","journal-title":"Proc 23rd Usenix Conf Secur Symp"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"journal-title":"Spartan Efficient and general-purpose zkSNARKs without trusted setup","year":"2019","author":"setty","key":"ref46"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3134104"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3372297.3417893"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_26"},{"journal-title":"Scalable transparent and post-quantum secure computational integrity","year":"2018","author":"ben-sasson","key":"ref42"},{"key":"ref41","first-page":"1069","article-title":"ZKBoo: Faster zero-knowledge for Boolean circuits","author":"giacomelli","year":"2016","journal-title":"Proc 25th USENIX Secur Symp (USENIX Security)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"journal-title":"Aurora Transparent Succinct Arguments for R1CS","year":"2018","author":"ben-sasson","key":"ref43"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9668973\/09954370.pdf?arnumber=9954370","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,19]],"date-time":"2022-12-19T19:56:49Z","timestamp":1671479809000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9954370\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":73,"URL":"https:\/\/doi.org\/10.1109\/access.2022.3223136","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2022]]}}}