{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T11:24:12Z","timestamp":1762341852214,"version":"3.37.3"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T00:00:00Z","timestamp":1650499200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T00:00:00Z","timestamp":1650499200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["20210007270012002","20210007270012002"],"award-info":[{"award-number":["20210007270012002","20210007270012002"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int. J. Inf. Secur."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10207-022-00590-x","type":"journal-article","created":{"date-parts":[[2022,4,21]],"date-time":"2022-04-21T17:05:19Z","timestamp":1650560719000},"page":"953-971","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient verifiable computation over quotient polynomial rings"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5401-8949","authenticated-orcid":false,"given":"Jai Hyun","family":"Park","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7085-2220","authenticated-orcid":false,"given":"Jung Hee","family":"Cheon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5780-7110","authenticated-orcid":false,"given":"Dongwoo","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,4,21]]},"reference":[{"key":"590_CR1","doi-asserted-by":"crossref","unstructured":"Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the forty-first annual ACM symposium on theory of computing, pp. 169\u2013178 (2009)","DOI":"10.1145\/1536414.1536440"},{"issue":"3","key":"590_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2633600","volume":"6","author":"Z Brakerski","year":"2014","unstructured":"Brakerski, Z., Gentry, C., Vaikuntanathan, V.: (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theory (TOCT)"},{"key":"590_CR3","first-page":"144","volume":"2012","author":"J Fan","year":"2012","unstructured":"Fan, J., Vercauteren, F.: Somewhat practical fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2012, 144 (2012)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"590_CR4","doi-asserted-by":"crossref","unstructured":"Cheon, J.H., Kim, A., Kim, M., Song, Y.: Homomorphic encryption for arithmetic of approximate numbers. In: International Conference on the Theory and Application of Cryptology and Information Security, pp. 409\u2013437 (2017). Springer","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"590_CR5","doi-asserted-by":"crossref","unstructured":"Ducas, L., Micciancio, D.: Fhew: bootstrapping homomorphic encryption in less than a second. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 617\u2013640 (2015). Springer","DOI":"10.1007\/978-3-662-46800-5_24"},{"key":"590_CR6","doi-asserted-by":"crossref","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: Tfhe: fast fully homomorphic encryption over the torus. Journal of Cryptology, 1\u201358 (2019)","DOI":"10.1007\/s00145-019-09319-x"},{"issue":"4","key":"590_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1186\/s12920-018-0401-7","volume":"11","author":"A Kim","year":"2018","unstructured":"Kim, A., Song, Y., Kim, M., Lee, K., Cheon, J.H.: Logistic regression model training based on the approximate homomorphic encryption. BMC Med. Genom. 11(4), 83 (2018)","journal-title":"BMC Med. Genom."},{"key":"590_CR8","doi-asserted-by":"crossref","unstructured":"Han, K., Hong, S., Cheon, J.H., Park, D.: Logistic regression on homomorphic encrypted data at scale. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 9466\u20139471 (2019)","DOI":"10.1609\/aaai.v33i01.33019466"},{"key":"590_CR9","unstructured":"Hesamifard, E., Takabi, H., Ghasemi, M.: Cryptodl: Towards deep learning over encrypted data. In: Annual Computer Security Applications Conference (ACSAC 2016), Los Angeles, California, USA, vol. 11 (2016)"},{"key":"590_CR10","doi-asserted-by":"crossref","unstructured":"Bourse, F., Minelli, M., Minihold, M., Paillier, P.: Fast homomorphic evaluation of deep discretized neural networks. In: Annual International Cryptology Conference, pp. 483\u2013512 (2018). Springer","DOI":"10.1007\/978-3-319-96878-0_17"},{"key":"590_CR11","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B.: Non-interactive verifiable computing: Outsourcing computation to untrusted workers. In: Annual Cryptology Conference, pp. 465\u2013482 (2010). Springer","DOI":"10.1007\/978-3-642-14623-7_25"},{"issue":"1","key":"590_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"590_CR13","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. J. ACM (JACM) 45(1), 70\u2013122 (1998)","journal-title":"J. ACM (JACM)"},{"key":"590_CR14","doi-asserted-by":"crossref","unstructured":"Kilian, J.: A note on efficient zero-knowledge proofs and arguments. In: Proceedings of the Twenty-fourth Annual ACM Symposium on Theory of Computing, pp. 723\u2013732 (1992)","DOI":"10.1145\/129712.129782"},{"issue":"4","key":"590_CR15","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 J. Comput. 30(4), 1253\u20131298 (2000)","journal-title":"SIAM J. Comput."},{"key":"590_CR16","doi-asserted-by":"crossref","unstructured":"Ishai, Y., Kushilevitz, E., Ostrovsky, R.: Efficient arguments without short pcps. In: Twenty-Second Annual IEEE Conference on Computational Complexity (CCC\u201907), pp. 278\u2013291 (2007). IEEE","DOI":"10.1109\/CCC.2007.10"},{"issue":"4","key":"590_CR17","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. J. ACM (JACM) 62(4), 27 (2015)","journal-title":"J. ACM (JACM)"},{"key":"590_CR18","doi-asserted-by":"crossref","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, pp. 90\u2013112 (2012)","DOI":"10.1145\/2090236.2090245"},{"key":"590_CR19","doi-asserted-by":"crossref","unstructured":"Thaler, J.: Time-optimal interactive proofs for circuit evaluation. In: Annual Cryptology Conference, pp. 71\u201389 (2013). Springer","DOI":"10.1007\/978-3-642-40084-1_5"},{"key":"590_CR20","doi-asserted-by":"crossref","unstructured":"Gennaro, R., Gentry, C., Parno, B., Raykova, M.: Quadratic span programs and succinct nizks without pcps. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 626\u2013645 (2013). Springer","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"590_CR21","doi-asserted-by":"crossref","unstructured":"Setty, S., Braun, B., Vu, V., Blumberg, A.J., 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, pp. 71\u201384 (2013)","DOI":"10.1145\/2465351.2465359"},{"key":"590_CR22","doi-asserted-by":"crossref","unstructured":"Parno, B., Howell, J., Gentry, C., Raykova, M.: Pinocchio: Nearly practical verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 238\u2013252 (2013). IEEE","DOI":"10.1109\/SP.2013.47"},{"key":"590_CR23","unstructured":"Ben-Sasson, E., Chiesa, A., Tromer, E., Virza, M.: Succinct non-interactive zero knowledge for a von neumann architecture. In: 23rd $$\\{$$USENIX$$\\}$$ Security Symposium ($$\\{$$USENIX$$\\}$$ Security 14), pp. 781\u2013796 (2014)"},{"key":"590_CR24","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Setty, S.T., Ren, Z., Blumberg, A.J., Walfish, M.: Efficient ram and control flow in verifiable outsourced computation. In: NDSS (2015)","DOI":"10.14722\/ndss.2015.23097"},{"key":"590_CR25","doi-asserted-by":"crossref","unstructured":"Groth, J.: On the size of pairing-based non-interactive arguments. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 305\u2013326 (2016). Springer","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"590_CR26","doi-asserted-by":"crossref","unstructured":"Zhang, Y., Genkin, D., Katz, J., Papadopoulos, D., Papamanthou, C.: vsql: Verifying arbitrary sql queries over dynamic outsourced databases. In: 2017 IEEE Symposium on Security and Privacy (SP), pp. 863\u2013880 (2017). IEEE","DOI":"10.1109\/SP.2017.43"},{"key":"590_CR27","doi-asserted-by":"crossref","unstructured":"Ames, S., Hazay, C., Ishai, Y., Venkitasubramaniam, M.: Ligero: Lightweight sublinear arguments without a trusted setup. In: Proceedings of the 2017 Acm Sigsac Conference on Computer and Communications Security, pp. 2087\u20132104 (2017)","DOI":"10.1145\/3133956.3134104"},{"key":"590_CR28","first-page":"46","volume":"2018","author":"E Ben-Sasson","year":"2018","unstructured":"Ben-Sasson, E., Bentov, I., Horesh, Y., Riabzev, M.: Scalable, transparent, and post-quantum secure computational integrity. IACR Cryptol. ePrint Arch. 2018, 46 (2018)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"590_CR29","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Tzialla, I., Shelat, A., Thaler, J., Walfish, M.: Doubly-efficient zksnarks without trusted setup. In: 2018 IEEE Symposium on Security and Privacy (SP), pp. 926\u2013943 (2018). IEEE","DOI":"10.1109\/SP.2018.00060"},{"key":"590_CR30","doi-asserted-by":"crossref","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: Succinct zero-knowledge proofs with optimal prover computation. In: Annual International Cryptology Conference, pp. 733\u2013764 (2019). Springer","DOI":"10.1007\/978-3-030-26954-8_24"},{"key":"590_CR31","doi-asserted-by":"crossref","unstructured":"Maller, M., Bowe, S., Kohlweiss, M., Meiklejohn, S.: Sonic: Zero-knowledge snarks from linear-size universal and updatable structured reference strings. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2111\u20132128 (2019)","DOI":"10.1145\/3319535.3339817"},{"key":"590_CR32","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Kalai, Y.T., Popa, R.A., Vaikuntanathan, V., Zeldovich, N.: How to run turing machines on encrypted data. In: Annual Cryptology Conference, pp. 536\u2013553 (2013). Springer","DOI":"10.1007\/978-3-642-40084-1_30"},{"key":"590_CR33","doi-asserted-by":"crossref","unstructured":"Fiore, D., Gennaro, R., Pastro, V.: Efficiently verifiable computation on encrypted data. In: Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, pp. 844\u2013855 (2014)","DOI":"10.1145\/2660267.2660366"},{"key":"590_CR34","doi-asserted-by":"crossref","unstructured":"Fiore, D., Nitulescu, A., Pointcheval, D.: Boosting verifiable computation on encrypted data. In: PKC 2020-23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, pp. 124\u2013154 (2020). Springer","DOI":"10.1007\/978-3-030-45388-6_5"},{"key":"590_CR35","doi-asserted-by":"crossref","unstructured":"Bois, A., Cascudo, I., Fiore, D., Kim, D.: Flexible and efficient verifiable computation on encrypted data. In: IACR International Conference on Public-Key Cryptography, pp. 528\u2013558 (2021). Springer","DOI":"10.1007\/978-3-030-75248-4_19"},{"key":"590_CR36","doi-asserted-by":"crossref","unstructured":"Campanelli, M., Fiore, D., Querol, A.: Legosnark: modular design and composition of succinct zero-knowledge proofs. In: Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, pp. 2075\u20132092 (2019)","DOI":"10.1145\/3319535.3339820"},{"issue":"4","key":"590_CR37","doi-asserted-by":"publisher","first-page":"859","DOI":"10.1145\/146585.146605","volume":"39","author":"C Lund","year":"1992","unstructured":"Lund, C., Fortnow, L., Karloff, H., Nisan, N.: Algebraic methods for interactive proof systems. J. ACM (JACM) 39(4), 859\u2013868 (1992)","journal-title":"J. ACM (JACM)"},{"key":"590_CR38","doi-asserted-by":"crossref","unstructured":"Vu, V., Setty, S., Blumberg, A.J., Walfish, M.: A hybrid architecture for interactive verifiable computation. In: 2013 IEEE Symposium on Security and Privacy, pp. 223\u2013237 (2013). IEEE","DOI":"10.1109\/SP.2013.48"},{"key":"590_CR39","doi-asserted-by":"crossref","unstructured":"Wahby, R.S., Ji, Y., Blumberg, A.J., Shelat, A., Thaler, J., Walfish, M., Wies, T.: Full accounting for verifiable outsourcing. In: Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, pp. 2071\u20132086 (2017). ACM","DOI":"10.1145\/3133956.3133984"},{"key":"590_CR40","first-page":"317","volume":"2019","author":"T Xie","year":"2019","unstructured":"Xie, T., Zhang, J., Zhang, Y., Papamanthou, C., Song, D.: Libra: succinct zero-knowledge proofs with optimal prover computation. IACR Cryptol. ePrint Arch. 2019, 317 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"590_CR41","unstructured":"Thaler, J.: A note on the GKR protocol. Citeseer (2015)"},{"key":"590_CR42","unstructured":"Libert, B., Ramanna, S., Yung, M.: Functional commitment schemes: From polynomial commitments to pairing-based accumulators from simple assumptions. (2016)"},{"key":"590_CR43","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Fully homomorphic encryption from ring-lwe and security for key dependent messages. In: Annual Cryptology Conference, pp. 505\u2013524 (2011). Springer","DOI":"10.1007\/978-3-642-22792-9_29"}],"container-title":["International Journal of Information Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00590-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10207-022-00590-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10207-022-00590-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,23]],"date-time":"2022-09-23T15:47:38Z","timestamp":1663948058000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10207-022-00590-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,21]]},"references-count":43,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["590"],"URL":"https:\/\/doi.org\/10.1007\/s10207-022-00590-x","relation":{},"ISSN":["1615-5262","1615-5270"],"issn-type":[{"type":"print","value":"1615-5262"},{"type":"electronic","value":"1615-5270"}],"subject":[],"published":{"date-parts":[[2022,4,21]]},"assertion":[{"value":"21 April 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declaartions"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}