{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,2]],"date-time":"2025-09-02T10:50:23Z","timestamp":1756810223797},"reference-count":117,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2018,5,11]],"date-time":"2018-05-11T00:00:00Z","timestamp":1525996800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11704-016-6148-4","type":"journal-article","created":{"date-parts":[[2017,4,20]],"date-time":"2017-04-20T11:42:20Z","timestamp":1492688540000},"page":"451-478","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Primitives towards verifiable computation: a survey"],"prefix":"10.1007","volume":"12","author":[{"given":"Haseeb","family":"Ahmad","sequence":"first","affiliation":[]},{"given":"Licheng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Haibo","family":"Hong","sequence":"additional","affiliation":[]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[]},{"given":"Hassan","family":"Dawood","sequence":"additional","affiliation":[]},{"given":"Manzoor","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"Yixian","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,11]]},"reference":[{"key":"6148_CR1","first-page":"465","volume-title":"Proceedings of Annual Cryptology Conference.","author":"R Gennaro","year":"2010","unstructured":"Gennaro R, Gentry C, Parno B. Non-interactive verifiable computing: outsourcing computation to untrusted workers. In: Proceedings of Annual Cryptology Conference. 2010, 465\u2013482"},{"key":"6148_CR2","first-page":"113","volume-title":"Proceedings of the 40th Annual ACM Symposium on Theory of Computing.","author":"S Goldwasser","year":"2008","unstructured":"Goldwasser S, Kalai Y T, Rothblum G N. Delegating computation: interactive proofs for muggles. In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing. 2008, 113\u2013122"},{"key":"6148_CR3","first-page":"17","volume-title":"Proceedings of Conference on Shared Knowledge and the Web.","author":"D P Anderson","year":"2003","unstructured":"Anderson D P. Public computing: reconnecting people to science. In: Proceedings of Conference on Shared Knowledge and the Web. 2003, 17\u201319"},{"key":"6148_CR4","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/GRID.2004.14","volume-title":"Proceedings of the 5th IEEE\/ACM International Workshop on Grid Computing.","author":"D P Anderson","year":"2004","unstructured":"Anderson D P. BOINC: a system for public-resource computing and storage. In: Proceedings of the 5th IEEE\/ACM International Workshop on Grid Computing. 2004, 4\u201310"},{"issue":"11","key":"6148_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/581571.581573","volume":"45","author":"D P Anderson","year":"2002","unstructured":"Anderson D P, Cobb J, Korpela E, Lebofsky M, Werthimer D. SETI@home: an experiment in public-resource computing. Communications of the ACM, 2002, 45(11): 56\u201361","journal-title":"Communications of the ACM"},{"issue":"6","key":"6148_CR6","first-page":"50","volume":"53","author":"P Mell","year":"2009","unstructured":"Mell P, Grance T. The NIST definition of cloud computing. National Institute of Standards and Technology, 2009, 53(6): 50","journal-title":"National Institute of Standards and Technology"},{"issue":"1","key":"6148_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser S, Micali S, Racko C. The knowledge complexity of interactive proof systems. SIAM Journal on computing, 1989, 18(1): 186\u2013208","journal-title":"SIAM Journal on computing"},{"key":"6148_CR8","first-page":"421","volume-title":"Proceedings of the 17th Annual ACM Symposium on Theory of Computing.","author":"L Babai","year":"1985","unstructured":"Babai L. Trading group theory for randomness. In: Proceedings of the 17th Annual ACM Symposium on Theory of Computing. 1985, 421\u2013429"},{"key":"6148_CR9","first-page":"21","volume-title":"Proceedings of the 23rd Annual ACM Symposium on Theory of Computing.","author":"L Babai","year":"1991","unstructured":"Babai L, Fortnow L, Levin L A, Szegedy M. Checking computations in polylogarithmic time. In: Proceedings of the 23rd Annual ACM Symposium on Theory of Computing. 1991, 21\u201332"},{"issue":"1","key":"6148_CR10","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1145\/273865.273901","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Safra S. Probabilistic checking of proofs: a new characterization of NP. Journal of the ACM, 1998, 45(1): 70\u2013122","journal-title":"Journal of the ACM"},{"issue":"3","key":"6148_CR11","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S, Lund C, Motwani R, Sudan M, Szegedy M. Proof verification and the hardness of approximation problems. Journal of the ACM, 1998, 45(3): 501\u2013555","journal-title":"Journal of the ACM"},{"key":"6148_CR12","first-page":"723","volume-title":"Proceedings of the 24th Annual ACM Symposium on Theory of Computing.","author":"J Kilian","year":"1992","unstructured":"Kilian J. A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the 24th Annual ACM Symposium on Theory of Computing. 1992, 723\u2013732"},{"key":"6148_CR13","first-page":"311","volume-title":"Proceedings of Annual International Cryptology Conference.","author":"J Kilian","year":"1995","unstructured":"Kilian J. Improved efficient arguments. In: Proceedings of Annual International Cryptology Conference. 1995, 311\u2013324"},{"issue":"4","key":"6148_CR14","doi-asserted-by":"publisher","first-page":"1253","DOI":"10.1137\/S0097539795284959","volume":"30","author":"S Micali","year":"2000","unstructured":"Micali S. Computationally sound proofs. SIAM Journal on Computing, 2000, 30(4): 1253\u20131298","journal-title":"SIAM Journal on Computing"},{"issue":"4","key":"6148_CR15","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A Shamir","year":"1992","unstructured":"Shamir A. IP=PSPACE. Journal of the ACM, 1992, 39(4): 869\u2013877","journal-title":"Journal of the ACM"},{"issue":"4","key":"6148_CR16","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund C, Fortnow L, Karlo H, Nisan N. Algebraic methods for interactive proof systems. Journal of the ACM, 1992, 39(4): 859\u2013868","journal-title":"Journal of the ACM"},{"key":"6148_CR17","first-page":"483","volume-title":"Proceedings of Annual Cryptology Conference.","author":"K M Chung","year":"2010","unstructured":"Chung K M, Kalai Y, Vadhan S. Improved delegation of computation using fully homomorphic encryption. In: Proceedings of Annual Cryptology Conference. 2010, 483\u2013501"},{"key":"6148_CR18","first-page":"59","volume-title":"Proceedings of the 18th Annual ACM Symposium on Theory of Computing.","author":"S Goldwasser","year":"1986","unstructured":"Goldwasser S, Sipser M. Private coins versus public coins in interactive proof systems. In: Proceedings of the 18th Annual ACM Symposium on Theory of Computing. 1986, 59\u201368"},{"key":"6148_CR19","first-page":"113","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing.","author":"M Ben-Or","year":"1988","unstructured":"Ben-Or M, Goldwasser S, Kilian J, Wigderson A. Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, 113\u2013131"},{"issue":"1","key":"6148_CR20","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. Computational Complexity, 1991, 1(1): 3\u201340","journal-title":"Computational Complexity"},{"issue":"3","key":"6148_CR21","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1145\/116825.116852","volume":"38","author":"O Goldreich","year":"1991","unstructured":"Goldreich O, Micali S, Wigderson A. Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM, 1991, 38(3): 690\u2013728","journal-title":"Journal of the ACM"},{"key":"6148_CR22","first-page":"37","volume-title":"Proceedings of Conference on the Theory and Application of Cryptography.","author":"M Ben-Or","year":"1988","unstructured":"Ben-Or M, Goldreich O, Goldwasser S, H\u00e5stad J, Kilian J, Micali S, Rogaway P. Everything provable is provable in zero-knowledge. In: Proceedings of Conference on the Theory and Application of Cryptography. 1988, 37\u201356"},{"key":"6148_CR23","first-page":"204","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing.","author":"L Fortnow","year":"1987","unstructured":"Fortnow L. The complexity of perfect zero-knowledge. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing. 1987, 204\u2013209"},{"key":"6148_CR24","first-page":"439","volume-title":"Proceedings of the 28th Annual Symposium on Foundations of Computer Science.","author":"W Aiello","year":"1987","unstructured":"Aiello W, Hastad J. Perfect zero-knowledge languages can be recognized in two rounds. In: Proceedings of the 28th Annual Symposium on Foundations of Computer Science. 1987, 439\u2013448"},{"issue":"2","key":"6148_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF02351717","volume":"1","author":"U Feige","year":"1988","unstructured":"Feige U, Fiat A, Shamir A. Zero-knowledge proofs of identity. Journal of Cryptology, 1988, 1(2): 77\u201394","journal-title":"Journal of Cryptology"},{"key":"6148_CR26","first-page":"186","volume-title":"Proceedings of Conference on the Theory and Application of Cryptographic Techniques.","author":"A Fiat","year":"1986","unstructured":"Fiat A, Shamir A. How to prove yourself: Practical solutions to identification and signature problems. In: Proceedings of Conference on the Theory and Application of Cryptographic Techniques. 1986, 186\u2013194"},{"issue":"1","key":"6148_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF00195207","volume":"7","author":"O Goldreich","year":"1994","unstructured":"Goldreich O, Oren Y. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 1994, 7(1): 1\u201332","journal-title":"Journal of Cryptology"},{"key":"6148_CR28","first-page":"526","volume-title":"Proceedings of Conference on the Theory and Application of Cryptology.","author":"U Feige","year":"1989","unstructured":"Feige U, Shamir A. Zero knowledge proofs of knowledge in two rounds. In: Proceedings of Conference on the Theory and Application of Cryptology. 1989, 526\u2013544"},{"issue":"3","key":"6148_CR29","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s001459900010","volume":"9","author":"O Goldreich","year":"1996","unstructured":"Goldreich O, Kahan A. A How to construct constant-round zero knowledge proof systems for NP. Journal of Cryptology, 1996, 9(3): 167\u2013189","journal-title":"Journal of Cryptology"},{"key":"6148_CR30","first-page":"339","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.","author":"J Groth","year":"2006","unstructured":"Groth J, Ostrovsky R, Sahai A. Perfect non-interactive zero knowledge for NP. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2006, 339\u2013358"},{"key":"6148_CR31","first-page":"80","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science.","author":"S Micali","year":"2003","unstructured":"Micali S, Rabin M, Kilian J. Zero-knowledge sets. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science. 2003, 80\u201391"},{"key":"6148_CR32","first-page":"2","volume-title":"Proceedings of the 32nd Annual Symposium on Foundations of Computer Science.","author":"U Feige","year":"1991","unstructured":"Feige U, Goldwasser S, Lov\u00e1sz L, Safra S, Szegedy M. Approximating clique is almost NP-complete. In: Proceedings of the 32nd Annual Symposium on Foundations of Computer Science. 1991, 2\u201312"},{"key":"6148_CR33","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1007\/978-3-540-70583-3_44","volume-title":"Proceedings of International Colloquium on Automata, Languages, and Programming.","author":"Y T Kalai","year":"2008","unstructured":"Kalai Y T, Raz R. Interactive PCP. In: Proceedings of International Colloquium on Automata, Languages, and Programming. 2008, 536\u2013547"},{"key":"6148_CR34","first-page":"143","volume-title":"Advances in Cryptology-CRYPTO. Lecture Notes in Computer Science, vol 5677. Berlin: Springer","author":"Y T Kalai","year":"2009","unstructured":"Kalai Y T, Raz R. Probabilistically checkable arguments. In: Halevi S, eds. Advances in Cryptology-CRYPTO. Lecture Notes in Computer Science, vol 5677. Berlin: Springer, 2009, 143\u2013159"},{"key":"6148_CR35","first-page":"402","volume-title":"Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques.","author":"C Cachin","year":"1999","unstructured":"Cachin C, Micali S, Stadler M. Computationally private information retrieval with polylogarithmic communication. In: Proceedings of International Conference on the Theory and Applications of Cryptographic Techniques. 1999, 402\u2013414"},{"key":"6148_CR36","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/2090236.2090263","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference.","author":"N Bitansky","year":"2012","unstructured":"Bitansky N, Canetti R, Chiesa A, Tromer E. From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 2012, 326\u2013349"},{"key":"6148_CR37","first-page":"151","volume-title":"Proceedings of Annual Cryptology Conference.","author":"K M Chung","year":"2011","unstructured":"Chung K M, Kalai Y T, Liu F H, Raz R. Memory delegation. In: Proceedings of Annual Cryptology Conference. 2011, 151\u2013168"},{"key":"6148_CR38","volume-title":"A fully homomorphic encryption scheme. Dissertation for the Doctoral Degree","author":"C Gentry","year":"2009","unstructured":"Gentry C. A fully homomorphic encryption scheme. Dissertation for the Doctoral Degree. Stanford: Stanford University, 2009"},{"issue":"5","key":"6148_CR39","doi-asserted-by":"publisher","first-page":"1661","DOI":"10.1137\/070709244","volume":"38","author":"B Barak","year":"2008","unstructured":"Barak B, Goldreich O. Universal arguments and their applications. SIAM Journal on Computing, 2008, 38(5): 1661\u20131694","journal-title":"SIAM Journal on Computing"},{"key":"6148_CR40","first-page":"456","volume":"2011","author":"S Goldwasser","year":"2011","unstructured":"Goldwasser S, Lin H, Rubinstein A. Delegation of Computation without Rejection Problem from Designated Verifier CS-Proofs. IACR Cryptology ePrint Archive, 2011, 2011: 456","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6148_CR41","first-page":"98","volume-title":"Proceedings of International Conference on Current Trends in Theory and Practice of Computer Science.","author":"A R Sadeghi","year":"2008","unstructured":"Sadeghi A R. Trusted computing\u2014special aspects and challenges. In: Proceedings of International Conference on Current Trends in Theory and Practice of Computer Science. 2008, 98\u2013117"},{"key":"6148_CR42","volume-title":"Proceedings of the ACM International Conference on Computing Frontiers","author":"Y Wen","year":"2013","unstructured":"Wen Y, Lee J, Liu Z, Zheng Q, Shi W, Xu S, Suh T. Multi-processor architectural support for protecting virtual machine privacy in untrusted cloud environment. In: Proceedings of the ACM International Conference on Computing Frontiers. 2013"},{"issue":"5","key":"6148_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1095809.1095812","volume":"39","author":"A Seshadri","year":"2005","unstructured":"Seshadri A, Luk M, Shi E, Perrig A, van Doorn L, Khosla P. Pioneer: verifying code integrity and enforcing untampered code execution on legacy systems. ACM SIGOPS Operating Systems Review, 2005, 39(5): 1\u201316","journal-title":"ACM SIGOPS Operating Systems Review"},{"key":"6148_CR44","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-1460-5","volume-title":"Bootstrapping Trust in Modern Computers","author":"B M Parno","year":"2011","unstructured":"Parno B, Mc Cune J M, Perrig A. Bootstrapping Trust in Modern Computers. Springer Science & Business Media, 2011"},{"issue":"4","key":"6148_CR45","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s004460050050","volume":"11","author":"D Malkhi","year":"1998","unstructured":"Malkhi D, Reiter M. Byzantine quorum systems. Distributed Computing, 1998, 11(4): 203\u2013213","journal-title":"Distributed Computing"},{"key":"6148_CR46","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1145\/2046707.2046759","volume-title":"Proceedings of the 18th ACM Conference on Computer and Communications Security.","author":"R Canetti","year":"2011","unstructured":"Canetti R, Riva B, Rothblum G N. Practical delegation of computation using multiple servers. In: Proceedings of the 18th ACM Conference on Computer and Communications Security. 2011, 445\u2013454"},{"key":"6148_CR47","first-page":"3","volume":"99","author":"F Monrose","year":"1999","unstructured":"Monrose F, Wycko P, Rubin A D. Distributed Execution with Remote Audit. InNDSS, 1999, 99: 3\u20135","journal-title":"InNDSS"},{"key":"6148_CR48","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1145\/1403027.1403046","volume-title":"Proceedings of the 3rd International Workshop on Economics of Networked Systems.","author":"M Belenkiy","year":"2008","unstructured":"Belenkiy M, Chase M, Erway C C, Jannotti J, K\u00fcp\u00e7\u00fc A, Lysyanskaya A. Incentivizing outsourced computation. In: Proceedings of the 3rd International Workshop on Economics of Networked Systems. 2008, 85\u201390"},{"key":"6148_CR49","first-page":"162","volume-title":"Proceedings of the 27th Annual Symposium on Foundations of Computer Science.","author":"A C Yao","year":"1986","unstructured":"Yao A C. How to generate and exchange secrets. In: Proceedings of the 27th Annual Symposium on Foundations of Computer Science. 1986, 162\u2013167"},{"key":"6148_CR50","first-page":"111","volume-title":"Proceedings of Annual Cryptology Conference.","author":"S Benabbas","year":"2011","unstructured":"Benabbas S, Gennaro R, Vahlis Y. Verifiable delegation of computation over large datasets. In: Proceedings of Annual Cryptology Conference. 2011, 111\u2013131"},{"key":"6148_CR51","first-page":"149","volume-title":"Proceedings of International Workshop on Public Key Cryptography.","author":"P Ananth","year":"2014","unstructured":"Ananth P, Chandran N, Goyal V, Kanukurthi B, Ostrovsky R. Achieving privacy in verifiable computation with multiple servers\u2014without FHE and without pre-processing. In: Proceedings of International Workshop on Public Key Cryptography. 2014, 149\u2013166"},{"key":"6148_CR52","first-page":"844","volume-title":"Proceedings of the 2014 ACMSIGSAC Conference on Computer and Communications Security.","author":"D Fiore","year":"2014","unstructured":"Fiore D, Gennaro R, Pastro V. Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACMSIGSAC Conference on Computer and Communications Security. 2014, 844\u2013855"},{"key":"6148_CR53","first-page":"113","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing.","author":"M Ben-Or","year":"1988","unstructured":"Ben-Or M, Goldwasser S, Kilian J, Wigderson A. Multi-prover interactive proofs: how to remove intractability assumptions. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, 113\u2013131"},{"key":"6148_CR54","first-page":"253","volume-title":"Proceedings of USENIX Security Symposium.","author":"S T Setty","year":"2012","unstructured":"Setty S T, Vu V, Panpalia N, Braun B, Blumberg A J, Walfish M. Taking proof-based verified computation a few steps closer to practicality. In: Proceedings of USENIX Security Symposium. 2012, 253\u2013268"},{"key":"6148_CR55","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1145\/2090236.2090245","volume-title":"Proceedings of the 3rd Innovations in Theoretical Computer Science Conference.","author":"G Cormode","year":"2012","unstructured":"Cormode G, Mitzenmacher M, Thaler J. Practical verified computation with streaming interactive proofs. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. 2012, 90\u2013112"},{"key":"6148_CR56","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1145\/2465351.2465359","volume-title":"Proceedings of the 8th ACM European Conference on Computer Systems.","author":"S Setty","year":"2013","unstructured":"Setty S, Braun B, Vu V, Blumberg AJ, Parno B, Walfish M. Resolving the conflict between generality and plausibility in verified computation. In: Proceedings of the 8th ACM European Conference on Computer Systems. 2013, 71\u201384"},{"key":"6148_CR57","first-page":"238","volume-title":"Proceedings of IEEE Symposium on Security and Privacy.","author":"B Parno","year":"2013","unstructured":"Parno B, Howell J, Gentry C, Raykova M. Pinocchio: nearly practical verifiable computation. In: Proceedings of IEEE Symposium on Security and Privacy. 2013, 238\u2013252"},{"key":"6148_CR58","first-page":"253","volume-title":"Proceedings of IEEE Symposium on Security and Privacy.","author":"C Costello","year":"2015","unstructured":"Costello C, Fournet C, Howell J, Kohlweiss M, Kreuter B, Naehrig M, Parno B, Zahur S. Geppetto: versatile verifiable computation. In: Proceedings of IEEE Symposium on Security and Privacy. 2015, 253\u2013270"},{"key":"6148_CR59","volume-title":"Succinct non-interactive zero knowledge for a von Neumann architecture","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson E, Chiesa A, Tromer E, Virza M. Succinct non-interactive zero knowledge for a von Neumann architecture. In: Proceedings of the 23rd USENIX Security Symposium. 2014"},{"key":"6148_CR60","first-page":"341","volume-title":"Proceedings of the 24th ACM Symposium on Operating Systems Principles.","author":"B Braun","year":"2013","unstructured":"Braun B, Feldman A J, Ren Z, Setty S, Blumberg A J, Walfish M. Verifying computations with state. In: Proceedings of the 24th ACM Symposium on Operating Systems Principles. 2013, 341\u2013357"},{"key":"6148_CR61","first-page":"674","volume":"2014","author":"R S Wahby","year":"2014","unstructured":"Wahby R S, Setty S T V, Ren Z, Blumberg A J, Walfish M. Efficient RAM and control flow in verifiable outsourced computation. IACR Cryptology ePrint Archive, 2014, 2014: 674","journal-title":"IACR Cryptology ePrint Archive"},{"issue":"2","key":"6148_CR62","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/2641562","volume":"58","author":"M Walfish","year":"2015","unstructured":"Walfish M, Blumberg A J. Verifying computations without reexecuting them. Communications of the ACM, 2015, 58(2): 74\u201384","journal-title":"Communications of the ACM"},{"key":"6148_CR63","volume-title":"Using secure coprocessors. Dissertation for the Doctoral Degree","author":"S Y Bennet","year":"1994","unstructured":"Bennet S Y. Using secure coprocessors. Dissertation for the Doctoral Degree. Pittsburgh: Carnegie Mellon University, 1994"},{"issue":"8","key":"6148_CR64","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1016\/S1389-1286(98)00019-X","volume":"31","author":"S W Smith","year":"1999","unstructured":"Smith S W, Weingart S. Building a high-performance, programmable secure coprocessor. Computer Networks, 1999, 31(8): 831\u2013860","journal-title":"Computer Networks"},{"key":"6148_CR65","first-page":"223","volume-title":"Proceedings of IEEE Symposium on Security and Privacy.","author":"V Vu","year":"2013","unstructured":"Vu V, Setty S, Blumberg AJ, Walfish M. A hybrid architecture for interactive verifiable computation. In: Proceedings of IEEE Symposium on Security and Privacy. 2013, 223\u2013237"},{"key":"6148_CR66","first-page":"793","volume-title":"Proceedings of the 45th Annual ACM Symposium on Theory of Computing.","author":"G N Rothblum","year":"2013","unstructured":"Rothblum G N, Vadhan S, Wigderson A. Interactive proofs of proximity: delegating computation in sublinear time. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing. 2013, 793\u2013802"},{"issue":"4","key":"6148_CR67","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/2699436","volume":"62","author":"S Goldwasser","year":"2015","unstructured":"Goldwasser S, Kalai Y T, Rothblum G N. Delegating computation: interactive proofs for muggles. Journal of the ACM, 2015, 62(4): 27","journal-title":"Journal of the ACM"},{"key":"6148_CR68","first-page":"846","volume":"2014","author":"A J Blumberg","year":"2014","unstructured":"Blumberg A J, Thaler J, Vu V, Walfish M. Verifiable computation using multiple provers. IACR Cryptology ePrint Archive, 2014, 2014: 846","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6148_CR69","volume-title":"Modern Cryptography, Probabilistic Proofs and Pseudorandomness","author":"O Goldreich","year":"1998","unstructured":"Goldreich O. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Springer Science & Business Media, 1998"},{"key":"6148_CR70","first-page":"186","volume":"2002","author":"O Goldreich","year":"2002","unstructured":"Goldreich O. Zero-Knowledge twenty years after its invention. IACR Cryptology ePrint Archive, 2002, 2002: 186","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6148_CR71","first-page":"103","volume-title":"Proceedings of the 20th Annual ACM Symposium on Theory of Computing.","author":"M Blum","year":"1988","unstructured":"Blum M, Feldman P, Micali S. Non-interactive zero-knowledge and its applications. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing. 1988, 103\u2013112"},{"key":"6148_CR72","first-page":"353","volume-title":"Proceedings of Conference on the Theory and Application of Cryptography.","author":"D Lapidot","year":"1990","unstructured":"Lapidot D, Shamir A. Publicly verifiable non-interactive zero knowledge proofs. In: Proceedings of Conference on the Theory and Application of Cryptography. 1990, 353\u2013365"},{"key":"6148_CR73","first-page":"321","volume-title":"Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.","author":"J Groth","year":"2010","unstructured":"Groth J. Short pairing-based non-interactive zero-knowledge arguments. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2010, 321\u2013340"},{"key":"6148_CR74","first-page":"111","volume-title":"Proceedings of the 45th Annual ACM Symposium on Theory of Computing.","author":"N Bitansky","year":"2013","unstructured":"Bitansky N, Canetti R, Chiesa A, Tromer E. Recursive composition and bootstrapping for SNARKs and proof-carrying data. In: Proceedings of the 45th Annual ACM Symposium on Theory of Computing. 2013, 111\u2013120"},{"key":"6148_CR75","first-page":"276","volume-title":"Proceedings of International Cryptology Conference.","author":"E Ben-Sasson","year":"2014","unstructured":"Ben-Sasson E, Chiesa A, Tromer E, Virza M. Scalable zero knowledge via cycles of elliptic curves. In: Proceedings of International Cryptology Conference. 2014, 276\u2013294"},{"key":"6148_CR76","first-page":"371","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.","author":"A Chiesa","year":"2015","unstructured":"Chiesa A, Tromer E, Virza M. Cluster computing in zero knowledge. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2015, 371\u2013403"},{"key":"6148_CR77","first-page":"626","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.","author":"R Gennaro","year":"2013","unstructured":"Gennaro R, Gentry C, Parno B, Raykova M. Quadratic span programs and succinct NIZKs without PCPs. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2013, 626\u2013645"},{"key":"6148_CR78","first-page":"41","volume-title":"Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.","author":"H Lipmaa","year":"2013","unstructured":"Lipmaa H. Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2013, 41\u201360"},{"key":"6148_CR79","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-319-02937-5_6","volume-title":"Proceedings of International Conference on Cryptology and Network Security.","author":"P Fauzi","year":"2013","unstructured":"Fauzi P, Lipmaa H, Zhang B. Efficient modular NIZK arguments from shift and product. In: Proceedings of International Conference on Cryptology and Network Security. 2013, 92\u2013121"},{"key":"6148_CR80","first-page":"396","volume":"2014","author":"H Lipmaa","year":"2014","unstructured":"Lipmaa H. Almost optimal short adaptive non-interactive zero knowledge. IACR Cryptology ePrint Archive, 2014, 2014: 396","journal-title":"IACR Cryptology ePrint Archive"},{"key":"6148_CR81","first-page":"278","volume-title":"Proceedings of the 22nd Annual IEEE Conference on Computational Complexity.","author":"Y Ishai","year":"2007","unstructured":"Ishai Y, Kushilevitz E, Ostrovsky R. Efficient arguments without short PCPs. In: Proceedings of the 22nd Annual IEEE Conference on Computational Complexity. 2007, 278\u2013291"},{"key":"6148_CR82","first-page":"75","volume-title":"Proceedings of Conference on Computability in Europe.","author":"G Crescenzo Di","year":"2008","unstructured":"Di Crescenzo G, Lipmaa H. Succinct NP proofs from an extractability assumption. In: Proceedings of Conference on Computability in Europe. 2008, 75\u2013185"},{"key":"6148_CR83","volume-title":"Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing","author":"G Xu","year":"2013","unstructured":"Xu G, Amariucai G, Guan Y. Delegation of computation with verification outsourcing: curious verifiers. In: Proceedings of the 2013 ACM Symposium on Principles of Distributed Computing. 2013"},{"key":"6148_CR84","volume-title":"Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems","author":"S Setty","year":"2011","unstructured":"Setty S, Blumberg A J, Walfish M. Toward practical and unconditional verification of remote computations. In: Proceedings of the 13th USENIX Conference on Hot Topics in Operating Systems. 2011"},{"key":"6148_CR85","first-page":"483","volume-title":"Proceedings of Annual Cryptology Conference.","author":"K M Chung","year":"2010","unstructured":"Chung K M, Kalai Y, Vadhan S. Improved delegation of computation using fully homomorphic encryption. In: Proceedings of Annual Cryptology Conference. 2010, 483\u2013501"},{"key":"6148_CR86","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","volume-title":"Proceedings of Theory of Cryptography Conference.","author":"B Parno","year":"2012","unstructured":"Parno B, Raykova M, Vaikuntanathan V. How to delegate and verify in public: verifiable computation from attribute-based encryption. In: Proceedings of Theory of Cryptography Conference. 2012, 422\u2013439."},{"key":"6148_CR87","first-page":"222","volume-title":"Theory of Cryptography. Lecture Notes in Computer Science","author":"C Papamanthou","year":"2013","unstructured":"Papamanthou C, Shi E, Tamassia R. Signatures of correct computation. In: Sahai A, eds. Theory of Cryptography. Lecture Notes in Computer Science, Vol 7785. Berlin: Springer, 2013, 222\u2013242"},{"key":"6148_CR88","first-page":"499","volume-title":"Theory of Cryptography. Lecture Notes in Computer Science","author":"S G Choi","year":"2013","unstructured":"Choi S G, Katz J, Kumaresan R, Cid C. Multi-client non-interactive verifiable computation. In: Sahai A, eds. Theory of Cryptography. Lecture Notes in Computer Science, Vol 7785. Berlin: Springer, 2013, 499\u2013518"},{"key":"6148_CR89","first-page":"131","volume-title":"Proceedings of International Workshop on Public Key Cryptography.","author":"D Apon","year":"2014","unstructured":"Apon D, Katz J, Shi E, Thiruvengadam A. Verifiable oblivious storage. In: Proceedings of International Workshop on Public Key Cryptography. 2014, 131\u2013148"},{"key":"6148_CR90","first-page":"146","volume-title":"Proceedings of International Conference on Provable Security.","author":"P Laud","year":"2014","unstructured":"Laud P, Pankova A. Verifiable computation in multiparty protocols with honest majority. In: Proceedings of International Conference on Provable Security. 2014, 146\u2013161"},{"key":"6148_CR91","first-page":"457","volume-title":"Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques.","author":"A Sahai","year":"2005","unstructured":"Sahai A, Waters B. Fuzzy identity-based encryption. In: Proceedings of Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2005, 457\u2013473"},{"key":"6148_CR92","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/1180405.1180418","volume-title":"Proceedings of the 13th ACM Conference on Computer and Communications Security.","author":"V Goyal","year":"2006","unstructured":"Goyal V, Pandey O, Sahai A, Waters B. Attribute-based encryption for fine-grained access control of encrypted data. In: Proceedings of the 13th ACM Conference on Computer and Communications Security. 2006, 89\u201398"},{"key":"6148_CR93","first-page":"51","volume-title":"Proceedings of International Workshop on Public Key Cryptography.","author":"J Alderman","year":"2014","unstructured":"Alderman J, Janson C, Cid C, Crampton J. Revocation in publicly verifiable outsourced computation. In: Proceedings of International Workshop on Public Key Cryptography. 2014, 51\u201371"},{"key":"6148_CR94","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/2714576.2714636","volume-title":"Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security.","author":"J Alderman","year":"2015","unstructured":"Alderman J, Janson C, Cid C, Crampton J. Access control in publicly verifiable outsourced computation. In: Proceedings of the 10th ACM Symposium on Information, Computer and Communications Security. 2015, 657\u2013662"},{"key":"6148_CR95","first-page":"147","volume-title":"Proceedings of Cryptographers\u2019 Track at the RSA Conference.","author":"J Alderman","year":"2016","unstructured":"Alderman J, Janson C, Cid C, Crampton J. Hybrid publicly verifiable computation. In: Proceedings of Cryptographers\u2019 Track at the RSA Conference. 2016, 147\u2013163"},{"key":"6148_CR96","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-662-46497-7_6","volume-title":"Proceedings of Theory of Cryptography Conference.","author":"S D Gordon","year":"2015","unstructured":"Gordon S D, Katz J, Liu F H, Shi E, Zhou H S. Multi-client verifiable computation with stronger security guarantees. In: Proceedings of Theory of Cryptography Conference. 2015, 144\u2013168"},{"key":"6148_CR97","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1145\/2508859.2516681","volume-title":"Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security.","author":"M Backes","year":"2013","unstructured":"Backes M, Fiore D, Reischuk R M. Verifiable delegation of computation on outsourced data. In: Proceedings of the 2013 ACM SIGSAC Conference on Computer & Communications Security. 2013, 863\u2013874"},{"key":"6148_CR98","first-page":"301","volume-title":"Proceedings of International Conference on the Theory and Application of Cryptology and Information Security.","author":"R Gennaro","year":"2013","unstructured":"Gennaro R, Wichs D. Fully homomorphic message authenticators. In: Proceedings of International Conference on the Theory and Application of Cryptology and Information Security. 2013, 301\u2013320"},{"key":"6148_CR99","doi-asserted-by":"crossref","first-page":"584","DOI":"10.1145\/1315245.1315317","volume-title":"Proceedings of the 14th ACM Conference on Computer and Communications Security.","author":"A K Juels","year":"2007","unstructured":"Juels A, Kaliski Jr B S. PORs: proofs of retrievability for large files. In: Proceedings of the 14th ACM Conference on Computer and Communications Security. 2007, 584\u2013597"},{"key":"6148_CR100","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/2382196.2382250","volume-title":"Proceedings of the 2012 ACM Conference on Computer and Communications Security.","author":"D Fiore","year":"2012","unstructured":"Fiore D, Gennaro R. Publicly verifiable delegation of large polynomials and matrix computations, with applications. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security. 2012, 501\u2013512"},{"key":"6148_CR101","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1145\/2382196.2382297","volume-title":"Proceedings of the 2012 ACM Conference on Computer and Communications Security.","author":"D Schr\u00f6der","year":"2012","unstructured":"Schr\u00f6der D, Schr\u00f6der H. Verifiable data streaming. In: Proceedings of the 2012 ACM Conference on Computer and Communications Security. 2012, 953\u2013964"},{"key":"6148_CR102","volume-title":"Public-Key Cryptography\u2013PKC 2016","author":"J Krupp","year":"2016","unstructured":"Krupp J, Schr\u00f6der D, Simkin M, Fiore D, Ateniese G, Nuernberger S. Nearly optimal verifiable data streaming. In: Cheng C M, Chung K M, Persiano G, et al., eds. Public-Key Cryptography\u2013PKC 2016. Lecture Notes in Computer Science, Vol 9614. Berlin: Springer, 2016"},{"issue":"3","key":"6148_CR103","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/2535523","volume":"16","author":"M Blanton","year":"2013","unstructured":"Blanton M, Zhang Y, Frikken K B. Secure and verifiable outsourcing of large-scale biometric computations. ACM Transactions on Information and System Security, 2013, 16(3): 11","journal-title":"ACM Transactions on Information and System Security"},{"key":"6148_CR104","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-642-34129-8_17","volume-title":"Proceedings of International Conference on Information and Communications Security.","author":"J Li","year":"2012","unstructured":"Li J, Jia C, Li J, Chen X. Outsourcing encryption of attribute-based encryption with MapReduce. In: Proceedings of International Conference on Information and Communications Security. 2012, 191\u2013201"},{"key":"6148_CR105","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-642-32009-5_13","volume-title":"Advances in Cryptology\u2013CRYPTO 2012","author":"A Sahai","year":"2012","unstructured":"Sahai A, Seyalioglu H, Waters B. Dynamic credentials and cipher text delegation for attribute-based encryption. In: Safavi-Naini R, Canetti R, eds. Advances in Cryptology\u2013CRYPTO 2012. Lecture Notes in Computer Science, Vol 7417. Berlin: Springer, 2012, 199\u2013217"},{"issue":"8","key":"6148_CR106","doi-asserted-by":"publisher","first-page":"2201","DOI":"10.1109\/TPDS.2013.271","volume":"25","author":"J Li","year":"2014","unstructured":"Li J, Huang X, Li J, Chen X, Xiang Y. Securely outsourcing attribute based encryption with checkability. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(8): 2201\u20132210","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"6148_CR107","first-page":"1","volume-title":"Soft Computing.","author":"J Li","year":"2017","unstructured":"Li J, Li X, Wang L, He D, Ahmad H, Niu X. Fuzzy encryption in cloud computation: efficient verifiable outsourced attribute-based encryption. Soft Computing. 2017, 1\u20138"},{"issue":"2","key":"6148_CR108","doi-asserted-by":"publisher","first-page":"137","DOI":"10.3233\/JCS-150540","volume":"24","author":"H Carter","year":"2016","unstructured":"Carter H, Mood B, Traynor P, Butler K. Secure outsourced garbled circuit evaluation for mobile devices. Journal of Computer Security, 2016, 24(2): 137\u2013180","journal-title":"Journal of Computer Security"},{"key":"6148_CR109","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1145\/2664243.2664255","volume-title":"Proceedings of the 30th Annual Computer Security Applications Conference","author":"H Carter","year":"2014","unstructured":"Carter H, Lever C, Traynor P. Whitewash: outsourcing garbled circuit generation for mobile devices. In: Proceedings of the 30th Annual Computer Security Applications Conference. 2014, 266\u2013275"},{"issue":"9","key":"6148_CR110","doi-asserted-by":"publisher","first-page":"2386","DOI":"10.1109\/TPDS.2013.180","volume":"25","author":"X Chen","year":"2014","unstructured":"Chen X, Li J, Ma J, Tang Q, Lou W. New algorithms for secure outsourcing of modular exponentiations. IEEE Transactions on Parallel and Distributed Systems, 2014, 25(9): 2386\u20132396","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"5","key":"6148_CR111","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s10207-015-0308-7","volume":"15","author":"M S Kiraz","year":"2016","unstructured":"Kiraz M S, Uzunkol O. Efficient and verifiable algorithms for secure outsourcing of cryptographic computations. International Journal of Information Security, 2016, 15(5): 519\u2013537","journal-title":"International Journal of Information Security"},{"key":"6148_CR112","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-40084-1_6","volume-title":"Advances in Cryptology\u2013CRYPTO 2013","author":"E Ben-Sasson","year":"2013","unstructured":"Ben-Sasson E, Chiesa A, Genkin D, Tromer E, Virza M. SNARKs for C: verifying program executions succinctly and in zero knowledge. In: Canetti R, Garay J A, eds. Advances in Cryptology\u2013CRYPTO 2013. Lecture Notes in Computer Science, Vol 8043. Berlin: Springer, 2013, 90\u2013108"},{"issue":"84","key":"6148_CR113","first-page":"153","volume":"81","author":"A E Kosba","year":"2014","unstructured":"Kosba A E, Papadopoulos D, Papamanthou C, Sayed M F, Shi E, Triandopoulos N. TRUESET: faster verifiable set computations. USENIX Security, 2014, 81(84): 153","journal-title":"USENIX Security"},{"key":"6148_CR114","volume-title":"Verifiable computation with massively parallel interactive proofs","author":"J Thaler","year":"2012","unstructured":"Thaler J, Roberts M, Mitzenmacher M, Pfister H. Verifiable computation with massively parallel interactive proofs. In: Proceedings of HotCloud. 2012"},{"key":"6148_CR115","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-40084-1_5","volume-title":"Advances in Cryptology\u2013CRYPTO 2013","author":"J Thaler","year":"2013","unstructured":"Thaler J. Time-optimal interactive proofs for circuit evaluation. In: Canetti R, Garay J A, eds. Advances in Cryptology\u2013CRYPTO 2013. Lecture Notes in Computer Science, Vol 8043. Berlin: Springer, 2013, 71\u201389"},{"issue":"8","key":"6148_CR116","doi-asserted-by":"publisher","first-page":"1982","DOI":"10.1587\/transinf.2015INI0003","volume":"99","author":"L C L J Wang","year":"2016","unstructured":"Wang L C, LI J, Ahmad H. Challenges of fully homomorphic encryptions for the Internet of things. IEICE Transactions on Information and Systems, 2016, 99(8): 1982\u20131990","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"5","key":"6148_CR117","doi-asserted-by":"publisher","first-page":"05210","DOI":"10.1007\/s11432-015-5479-3","volume":"60","author":"H Hong","year":"2017","unstructured":"Hong H, Wang L, Ahmad H, Yang Y, Qu Z. Minimum length key in MST cryptosystems. Science China Information Sciences, 2017, 60(5): 05210","journal-title":"Science China Information Sciences"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11704-016-6148-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6148-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-016-6148-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T06:18:48Z","timestamp":1692771528000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11704-016-6148-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,11]]},"references-count":117,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["6148"],"URL":"https:\/\/doi.org\/10.1007\/s11704-016-6148-4","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"value":"2095-2228","type":"print"},{"value":"2095-2236","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,11]]},"assertion":[{"value":"14 March 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}