{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:17:57Z","timestamp":1740133077395,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"US National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0644238","CNS-0831470"],"award-info":[{"award-number":["CNS-0644238","CNS-0831470"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Parallel Distrib. Syst."],"published-print":{"date-parts":[[2017,3,1]]},"DOI":"10.1109\/tpds.2016.2598342","type":"journal-article","created":{"date-parts":[[2016,8,4]],"date-time":"2016-08-04T18:07:41Z","timestamp":1470334061000},"page":"717-730","source":"Crossref","is-referenced-by-count":6,"title":["Delegation of Computation with Verification Outsourcing: Curious Verifiers"],"prefix":"10.1109","volume":"28","author":[{"given":"Gang","family":"Xu","sequence":"first","affiliation":[]},{"given":"George T.","family":"Amariucai","sequence":"additional","affiliation":[]},{"given":"Yong","family":"Guan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"381","volume":"2","author":"goldreich","year":"2004","journal-title":"Foundations of Cryptography Basic Applications"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795284959"},{"key":"ref33","first-page":"781","article-title":"Succinct non-interactive zero knowledge\n for a von Neumann architecture","author":"ben-sasson","year":"0","journal-title":"Proc 23rd USENIX Secur Symp"},{"key":"ref32","first-page":"90","article-title":"SNARKs for C: Verifying program executions succinctly and in zero\n knowledge","author":"ben-sasson","year":"0","journal-title":"Proc 33rd Int Cryptol Conf"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2465351.2465359"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2484253"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/800070.802212"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1236457.1236459"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/278298.278306"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/FSCS.1990.89520"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1755688.1755695"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.556674"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.368958"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958521"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1992.267824"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/103418.103428"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"ref17","article-title":"Two\n 1-round protocols for delegation of computation","author":"canetti","year":"2011","journal-title":"Technical report Cryptology ePrint Archive"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90005-0"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62223"},{"key":"ref4","first-page":"425","article-title":"Uncheatable distributed computations","author":"golle","year":"2001","journal-title":"Topics in Cryptology"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2046707.2046759"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1996.548518"},{"key":"ref6","first-page":"601","article-title":"Query execution assurance for outsourced databases","author":"sion","year":"0","journal-title":"Proc Int Conf On Very Large Data Bases"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258644"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11145-7_15"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935305"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03168-7_11"},{"key":"ref2","first-page":"149","article-title":"Homomorphic signatures for polynomial functions","author":"boneh","year":"2011","journal-title":"Advances in Cryptology"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2011.41"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22792-9_7"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.10"},{"key":"ref22","article-title":"Making argument systems\n for outsourced computation practical (sometimes)","author":"setty","year":"0","journal-title":"Proc Symp Network and Distributed System Security"},{"key":"ref21","first-page":"29","article-title":"Toward practical and unconditional verification of remote computations","author":"setty","year":"0","journal-title":"Proc 13th USENIX Conf Hot Topics Operating Syst"},{"key":"ref24","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"karp","year":"0","journal-title":"Proc Symp Complexity Computer Comput"},{"key":"ref41","first-page":"465","article-title":"Non-interactive verifiable computing: Outsourcing computation to untrusted workers","author":"gennaro","year":"0","journal-title":"Proc 30th Annu Conf Adv Cryptology"},{"key":"ref23","first-page":"12","article-title":"Taking proof-based verified computation a few steps closer to practicality","author":"setty","year":"0","journal-title":"Proc 21st USENIX Conf Security Symp"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536440"}],"container-title":["IEEE Transactions on Parallel and Distributed Systems"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/71\/7851095\/7533495-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/71\/7851095\/07533495.pdf?arnumber=7533495","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:42Z","timestamp":1649443722000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7533495\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,1]]},"references-count":41,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpds.2016.2598342","relation":{},"ISSN":["1045-9219"],"issn-type":[{"type":"print","value":"1045-9219"}],"subject":[],"published":{"date-parts":[[2017,3,1]]}}}