{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:21:24Z","timestamp":1762341684318,"version":"3.37.3"},"reference-count":38,"publisher":"Oxford University Press (OUP)","issue":"4","license":[{"start":{"date-parts":[[2021,5,22]],"date-time":"2021-05-22T00:00:00Z","timestamp":1621641600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61772514"],"award-info":[{"award-number":["61772514"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R & D Program of China","doi-asserted-by":"crossref","award":["2017YFB1400700"],"award-info":[{"award-number":["2017YFB1400700"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100009592","name":"Beijing Municipal Science & Technology Commission","doi-asserted-by":"publisher","award":["Z191100007119006"],"award-info":[{"award-number":["Z191100007119006"]}],"id":[{"id":"10.13039\/501100009592","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,19]]},"abstract":"<jats:title>Abstract<\/jats:title>\n               <jats:p>Homomorphic message authentication codes (MACs) allow a user to outsource data to an untrusted server and verify the correctness of returned computation results over the outsourced data. Many cloud applications need delegation computations over outsourced data with dual capabilities. On one hand, they need to keep the outsourced data secret such that the server cannot trace and infer any sensitive information from the computation results. On the other hand, the user should be able to efficiently verify the computation results. Unfortunately, the state-of-the-art homomorphic MAC schemes are not so desirable due to either poor privacy or low verification efficiency. In this paper, we first put forward a new cryptographic primitive called privacy-preserving homomorphic MACs (PHMAC) that simultaneously provides data privacy and efficient verification. Then, we present a PHMAC construction capable for the evaluation of polynomials of fixed degree $d\\geq 1$, in which the tag does not reveal any information of underlying authenticated data while being verifiable in constant time (in an amortized sense). As an application, we give a generic construction of homomorphic authenticated encryption (HAE) from proposed PHMAC and homomorphic encryption. Benefited from the functionalities of underlying PHMAC scheme, the derived HAE enjoys stronger authenticity and supports larger classes of functions than that of Lai et al. (Verifiable Computation on Outsourced Encrypted Data. In Computer Security\u2014ESORICS 2014\u201419th European Symposium on Research in Computer Security, Wroclaw, Poland, September 7\u201311, Part I, pp. 273\u2013291. Springer, Berlin). Such HAE enables verifiable delegation computations over growing outsourced encrypted data in an efficient way.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab042","type":"journal-article","created":{"date-parts":[[2021,5,17]],"date-time":"2021-05-17T11:07:15Z","timestamp":1621249635000},"page":"1020-1028","source":"Crossref","is-referenced-by-count":6,"title":["Toward Both Privacy and Efficiency of Homomorphic MACs for Polynomial Functions and Its Applications"],"prefix":"10.1093","volume":"65","author":[{"given":"Shimin","family":"Li","sequence":"first","affiliation":[{"name":"Westone Cryptologic Research Center, Westone Information Industry Inc., 188 Nansihuan Xi Lu, Fengtai District, Beijing 100070, China"},{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, 65 Xingshikou Road, Haidian District, Beijing 100093, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[{"name":"Information Science Academy of China Electronics Technology Group Corporation, 36 Sidaokou North Street, Haidian District, Beijing 100086, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Information Security, Institute of Information Engineering, Chinese Academy of Sciences, 65 Xingshikou Road, Haidian District, Beijing 100093, China"},{"name":"School of Cyber Security, University of Chinese Academy of Sciences, 1 Yanqihu East Road, Huairou District, Beijing 100049, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,5,22]]},"reference":[{"key":"2022041811431944700_ref1","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1007\/978-3-642-14623-7_25","article-title":"Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers","volume-title":"Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conf.","author":"Gennaro","year":"2010"},{"key":"2022041811431944700_ref2","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/978-3-642-14623-7_26","article-title":"Improved Delegation of Computation Using Fully Homomorphic Encryption","volume-title":"Advances in Cryptology\u2014CRYPTO 2010, 30th Annual Cryptology Conf.","author":"Chung","year":"2010"},{"key":"2022041811431944700_ref3","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/978-3-642-22792-9_7","article-title":"Verifiable Delegation of Computation over Large Datasets","volume-title":"Advances in Cryptology\u2014CRYPTO 2011\u201431st Annual Cryptology Conf.","author":"Benabbas","year":"2011"},{"key":"2022041811431944700_ref4","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/978-3-642-28914-9_24","article-title":"How to Delegate and Verify in Public: Verifiable Computation from Attribute-based Encryption","volume-title":"Theory of Cryptography\u20149th Theory of Cryptography Conf.","author":"Parno","year":"2012"},{"key":"2022041811431944700_ref5","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1007\/978-3-642-36594-2_28","article-title":"Multi-client Non-interactive Verifiable Computation","volume-title":"Theory of Cryptography\u201410th Theory of Cryptography Conf.","author":"Choi","year":"2013"},{"key":"2022041811431944700_ref6","first-page":"863","article-title":"Verifiable Delegation of Computation on Outsourced Data","volume-title":"2013 ACM SIGSAC Conf. Computer and Communications Security, CCS\u201913","author":"Backes","year":"2013"},{"key":"2022041811431944700_ref7","first-page":"173","article-title":"Homomorphic Authenticated Encryption Secure Against Chosen-Ciphertext Attack","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2014\u201420th Int. Conf. Theory and Application of Cryptology and Information Security","author":"Joo","year":"2014"},{"key":"2022041811431944700_ref8","first-page":"244","article-title":"Homomorphic Signature Schemes","volume-title":"Topics in Cryptology\u2014CT-RSA 2002, The Cryptographer\u2019s Track at the RSA Conf., 2002","author":"Johnson","year":"2002"},{"key":"2022041811431944700_ref9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-19379-8_1","article-title":"Linearly Homomorphic Signatures over Binary Fields and New Tools for Lattice-based Signatures","volume-title":"Public Key Cryptography\u2014PKC 2011\u201414th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Boneh","year":"2011"},{"key":"2022041811431944700_ref10","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1007\/978-3-642-30057-8_40","article-title":"Efficient Network Coding Signatures in the Standard Model","volume-title":"Public Key Cryptography\u2014PKC 2012\u201415th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Catalano","year":"2012"},{"key":"2022041811431944700_ref11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-662-44371-2_21","article-title":"Homomorphic Signatures with Efficient Verification for Polynomial Functions","volume-title":"Advances in Cryptology\u2014CRYPTO 2014\u201434th Annual Cryptology Conf.","author":"Catalano","year":"2014"},{"key":"2022041811431944700_ref12","first-page":"469","article-title":"Leveled Fully Homomorphic Signatures from Standard Lattices","volume-title":"Proc. Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015","author":"Gorbunov","year":"2015"},{"key":"2022041811431944700_ref13","first-page":"301","article-title":"Fully Homomorphic Message Authenticators","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2013\u201419th Int. Conf. Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1\u20135, Part II","author":"Gennaro","year":"2013"},{"key":"2022041811431944700_ref14","first-page":"336","article-title":"Practical Homomorphic MACs for Arithmetic Circuits","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2013, 32nd Annual Int. Conf. Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26\u201330","author":"Catalano","year":"2013"},{"key":"2022041811431944700_ref15","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1007\/978-3-642-54631-0_31","article-title":"Generalizing Homomorphic MACs for Arithmetic Circuits","volume-title":"Public-Key Cryptography\u2014PKC 2014\u201417th Int. Conf. Practice and Theory in Public-Key Cryptography","author":"Catalano","year":"2014"},{"key":"2022041811431944700_ref16","first-page":"169","article-title":"Fully Homomorphic Encryption Using Ideal Lattices","volume-title":"Proc. 41st Annual ACM Symposium on Theory of Computing, STOC 2009","author":"Gentry","year":"2009"},{"key":"2022041811431944700_ref17","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/978-3-642-13013-7_25","article-title":"Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes","volume-title":"Public Key Cryptography\u2014PKC 2010, 13th Int. Conf. Practice and Theory in Public Key Cryptography, Paris, France, May 26\u201328","author":"Smart","year":"2010"},{"key":"2022041811431944700_ref18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1007\/978-3-642-17373-8_22","article-title":"Faster Fully Homomorphic Encryption","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2010\u201416th Int. Conf. Theory and Application of Cryptology and Information Security","author":"Stehl\u00e9","year":"2010"},{"key":"2022041811431944700_ref19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-30057-8_1","article-title":"Better Bootstrapping in Fully Homomorphic Encryption","volume-title":"Public Key Cryptography\u2014PKC 2012\u201415th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Gentry","year":"2012"},{"key":"2022041811431944700_ref20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-36362-7_1","article-title":"Packed Ciphertexts in LWE-based Homomorphic Encryption","volume-title":"Public-Key Cryptography\u2014PKC 2013\u201416th Int. Conf. Practice and Theory in Public-Key Cryptography","author":"Brakerski","year":"2013"},{"key":"2022041811431944700_ref21","doi-asserted-by":"crossref","first-page":"13:1","DOI":"10.1145\/2633600","article-title":"(leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski","year":"2014","journal-title":"TOCT"},{"key":"2022041811431944700_ref22","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-319-11203-9_16","article-title":"Verifiable Computation on Outsourced Encrypted Data","volume-title":"Computer Security\u2014ESORICS 2014\u201419th European Symposium on Research in Computer Security","author":"Lai","year":"2014"},{"key":"2022041811431944700_ref23","first-page":"605","article-title":"Efficient Verifiable Computation of Linear and Quadratic Functions over Encrypted Data","volume-title":"Proc. 11th ACM on Asia Conference on Computer and Communications Security, AsiaCCS 2016","author":"Tran","year":"2016"},{"key":"2022041811431944700_ref24","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1007\/978-3-642-13013-7_9","article-title":"Secure Network Coding over the Integers","volume-title":"Public Key Cryptography\u2014PKC 2010, 13th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Gennaro","year":"2010"},{"key":"2022041811431944700_ref25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-19379-8_2","article-title":"Homomorphic Network Coding Signatures in the Standard Model","volume-title":"Public Key Cryptography\u2014PKC 2011\u201414th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Attrapadung","year":"2011"},{"key":"2022041811431944700_ref26","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-642-20465-4_13","article-title":"Adaptive Pseudo-Free Groups and Applications","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2011\u201430th Annual Int. Conf. Theory and Applications of Cryptographic Techniques","author":"Catalano","year":"2011"},{"key":"2022041811431944700_ref27","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1007\/978-3-642-30057-8_41","article-title":"Improved Security for Linearly Homomorphic Signatures: A Generic Framework","volume-title":"Public Key Cryptography\u2014PKC 2012\u201415th Int. Conf. Practice and Theory in Public Key Cryptography","author":"Freeman","year":"2012"},{"key":"2022041811431944700_ref28","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/978-3-642-34961-4_23","article-title":"Computing on Authenticated Data: New Privacy Definitions and Constructions","volume-title":"Advances in Cryptology\u2014ASIACRYPT 2012\u201418th Int. Conf. Theory and Application of Cryptology and Information Security","author":"Attrapadung","year":"2012"},{"key":"2022041811431944700_ref29","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1007\/978-3-642-36362-7_24","article-title":"Efficient Completely Context-Hiding Quotable and Linearly Homomorphic Signatures","volume-title":"Public-Key Cryptography\u2014PKC 2013\u201416th Int. Conf. Practice and Theory in Public-Key Cryptography","author":"Attrapadung","year":"2013"},{"key":"2022041811431944700_ref30","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1007\/978-3-642-00468-1_5","article-title":"Signing a Linear Subspace: Signature Schemes for Network Coding","volume-title":"Public Key Cryptography\u2014PKC 2009, 12th International Conf. Practice and Theory in Public Key Cryptography","author":"Boneh","year":"2009"},{"key":"2022041811431944700_ref31","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-642-20465-4_10","article-title":"Homomorphic Signatures for Polynomial Functions","volume-title":"Advances in Cryptology\u2014EUROCRYPT 2011\u201430th Annual Int. Conf. Theory and Applications of Cryptographic Techniques","author":"Boneh","year":"2011"},{"key":"2022041811431944700_ref32","first-page":"844","article-title":"Efficiently Verifiable Computation on Encrypted Data","volume-title":"Proc. 2014 ACM SIGSAC Conf. Computer and Communications Security, Scottsdale, AZ, USA, November 3\u20137","author":"Fiore","year":"2014"},{"key":"2022041811431944700_ref33","first-page":"296","article-title":"Delegatable Homomorphic Encryption with Applications to Secure Outsourcing of Computation","volume-title":"Topics in Cryptology\u2014CT-RSA 2012\u2014The Cryptographers\u2019 Track at the RSA Conf. 2012","author":"Barbosa","year":"2012"},{"key":"2022041811431944700_ref34","first-page":"202","article-title":"Verifiable computation over encrypted data in the presence of verification queries","volume":"2014","author":"Gennaro","year":"2014","journal-title":"IACR Cryptology ePrint Archive"},{"key":"2022041811431944700_ref35","first-page":"501","article-title":"Publicly Verifiable Delegation of Large Polynomials and Matrix Computations, with Applications","volume-title":"The ACM Conf. Computer and Communications Security, CCS\u201912","author":"Fiore","year":"2012"},{"key":"2022041811431944700_ref36","first-page":"680","article-title":"Algebraic (Trapdoor) One-Way Functions and Their Applications","volume-title":"Theory of Cryptography\u201410th Theory of Cryptography Conf., TCC 2013","author":"Catalano","year":"2013"},{"key":"2022041811431944700_ref37","first-page":"100","article-title":"Privacy-Preserving Homomorphic MACs with Efficient Verification","volume-title":"Web Services\u2014ICWS 2018\u201425th Int. Conf., Held as Part of the Services Conf. Federation, SCF 2018","author":"Li","year":"2018"},{"key":"2022041811431944700_ref38","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1109\/FOCS.2011.12","article-title":"Efficient Fully Homomorphic Encryption from (Standard) LWE","volume-title":"IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011","author":"Brakerski","year":"2011"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/4\/1020\/43377616\/bxab042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/65\/4\/1020\/43377616\/bxab042.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T11:46:03Z","timestamp":1650282363000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/65\/4\/1020\/6281302"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,22]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2021,5,22]]},"published-print":{"date-parts":[[2022,4,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab042","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"type":"print","value":"0010-4620"},{"type":"electronic","value":"1460-2067"}],"subject":[],"published-other":{"date-parts":[[2022,4]]},"published":{"date-parts":[[2021,5,22]]}}}