{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T00:20:06Z","timestamp":1747182006349,"version":"3.40.5"},"reference-count":40,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"am","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"},{"start":{"date-parts":[[2021,3,1]],"date-time":"2021-03-01T00:00:00Z","timestamp":1614556800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.ieee.org\/publications_standards\/publications\/rights\/ieeecopyrightform.pdf"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Areas Inf. Theory"],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1109\/jsait.2021.3054865","type":"journal-article","created":{"date-parts":[[2021,1,29]],"date-time":"2021-01-29T21:06:03Z","timestamp":1611954363000},"page":"317-325","source":"Crossref","is-referenced-by-count":2,"title":["Interactive Verifiable Polynomial Evaluation"],"prefix":"10.1109","volume":"2","author":[{"given":"Saeid","family":"Sahraei","sequence":"first","affiliation":[]},{"given":"Mohammad Ali","family":"Maddah-Ali","sequence":"additional","affiliation":[]},{"given":"A. Salman","family":"Avestimehr","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.38"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/16M1096773"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897652"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258641"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195132"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89519"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849371"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488709"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/050646445"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.11.063"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2013.180"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897910"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2382196.2382250"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14623-7_25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365746"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/22145.22192"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89518"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref6","first-page":"14:1","article-title":"Fast Reed-Solomon interactive oracle proofs of proximity","author":"ben-sasson","year":"2018","journal-title":"Proc 45th Int Colloquium Automata Lang Program (ICALP)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516681"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref7","first-page":"46","article-title":"Short interactive oracle proofs with constant query complexity, via composition and sumcheck","volume":"23","author":"ben-sasson","year":"2016","journal-title":"Electronic Colloq on Computational Complexity"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/273865.273901"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53644-5_2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref20","first-page":"305","article-title":"On the size of pairing-based non-interactive arguments","author":"groth","year":"2016","journal-title":"Proc Annu Int Conf Theory Appl Cryptogr Techn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1561\/9781680837056"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62215"},{"journal-title":"PolyShard Coded Sharding Achieves Linearly Scaling Efficiency and Security Simultaneously","year":"2018","author":"li","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3293611.3331573"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-42033-7_3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-008-9036-8"}],"container-title":["IEEE Journal on Selected Areas in Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8700143\/9380089\/9340357-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8700143\/9380089\/09340357.pdf?arnumber=9340357","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,5]],"date-time":"2021-07-05T19:59:13Z","timestamp":1625515153000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9340357\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3]]},"references-count":40,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jsait.2021.3054865","relation":{},"ISSN":["2641-8770"],"issn-type":[{"type":"electronic","value":"2641-8770"}],"subject":[],"published":{"date-parts":[[2021,3]]}}}