{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T16:29:48Z","timestamp":1775060988552,"version":"3.50.1"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032224682","type":"print"},{"value":"9783032224699","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-22469-9_1","type":"book-chapter","created":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:16Z","timestamp":1775055436000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Structural Testing with\u00a0Homomorphic Encryption"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4717-4206","authenticated-orcid":false,"given":"Andrei","family":"Aleksandrov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,4,2]]},"reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3214303","volume":"51","author":"A Acar","year":"2018","unstructured":"Acar, A., Aksu, H., Uluagac, A.S., Conti, M.: A survey on homomorphic encryption schemes: theory and implementation. ACM Comput. Surv. (Csur) 51(4), 1\u201335 (2018)","journal-title":"ACM Comput. Surv. (Csur)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Al\u00a0Badawi, A., et\u00a0al.: Openfhe: open-source fully homomorphic encryption library. In: Proceedings of the 10th Workshop on Encrypted Computing and Applied Homomorphic Cryptography, pp. 53\u201363 (2022)","DOI":"10.1145\/3560827.3563379"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Andoni, A., Panigrahy, R., Valiant, G., Zhang, L.: Learning sparse polynomial functions. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, pp. 500\u2013510. SIAM (2014)","DOI":"10.1137\/1.9781611973402.37"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Arora, V., Kelman, E., Meir, U.: On optimal testing of linearity. In: 2025 Symposium on Simplicity in Algorithms (SOSA), pp. 65\u201376. SIAM (2025)","DOI":"10.1137\/1.9781611978315.5"},{"key":"1_CR5","unstructured":"Bhat, A., Quadri, S.: Equivalence class partitioning and boundary value analysis-a review. In: 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), pp. 1557\u20131562. IEEE (2015)"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-540-30576-7_18","volume-title":"Theory of Cryptography","author":"D Boneh","year":"2005","unstructured":"Boneh, D., Goh, E.J., Nissim, K.: Evaluating 2-DNF formulas on ciphertexts. In: Kilian, J. (ed.) Theory of Cryptography, pp. 325\u2013341. Springer, Berlin Heidelberg, Berlin, Heidelberg (2005)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Boneh, D., Segev, G., Waters, B.: Targeted malleability: homomorphic encryption for restricted computations. In: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference. pp. 350\u2013366 (2012)","DOI":"10.1145\/2090236.2090264"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/978-3-030-52200-1_11","volume-title":"Mathematical Software - ICMS 2020","author":"A Borovik","year":"2020","unstructured":"Borovik, A., Yal\u00e7\u0131nkaya, \u015e: Homomorphic encryption and some black box attacks. In: Bigatti, A.M., Carette, J., Davenport, J.H., Joswig, M., de Wolff, T. (eds.) Mathematical Software - ICMS 2020, pp. 115\u2013124. Springer International Publishing, Cham (2020)"},{"issue":"3","key":"1_CR9","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. Theor. (TOCT) 6(3), 1\u201336 (2014)","journal-title":"ACM Trans. Comput. Theor. (TOCT)"},{"key":"1_CR10","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. Springer (2017)","DOI":"10.1007\/978-3-319-70694-8_15"},{"issue":"1","key":"1_CR11","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00145-019-09319-x","volume":"33","author":"I Chillotti","year":"2020","unstructured":"Chillotti, I., Gama, N., Georgieva, M., Izabach\u00e8ne, M.: TFHE: fast fully homomorphic encryption over the torus. J. Cryptol. 33(1), 34\u201391 (2020)","journal-title":"J. Cryptol."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Coglio, A., McCarthy, E., Smith, E.W.: Formal verification of zero-knowledge circuits. EPTCS 393 p.\u00a094","DOI":"10.4204\/EPTCS.393.9"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Danaila, I., Joly, P., Kaber, S.M., Postel, M.: Polynomial approximation, pp. 75\u2013104. Springer International Publishing, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-35032-0_4","DOI":"10.1007\/978-3-031-35032-0_4"},{"key":"1_CR14","doi-asserted-by":"publisher","unstructured":"Demillo, R.A., Lipton, R.J.: A probabilistic remark on algebraic program testing. Inf. Process. Lett. 7(4), 193\u2013195 (1978). https:\/\/doi.org\/10.1016\/0020-0190(78)90067-4, https:\/\/www.sciencedirect.com\/science\/article\/pii\/0020019078900674","DOI":"10.1016\/0020-0190(78)90067-4"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Dobslaw, F., de\u00a0Oliveira\u00a0Neto, F.G., Feldt, R.: Boundary value exploration for software analysis. In: 2020 IEEE International Conference on Software Testing, Verification and Validation Workshops (ICSTW), pp. 346\u2013353. IEEE (2020)","DOI":"10.1109\/ICSTW50294.2020.00062"},{"issue":"4","key":"1_CR16","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1109\/TIT.1985.1057074","volume":"31","author":"T Elgamal","year":"1985","unstructured":"Elgamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985). https:\/\/doi.org\/10.1109\/TIT.1985.1057074","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/263244.263267","volume":"22","author":"G Fink","year":"1997","unstructured":"Fink, G., Bishop, M.: Property-based testing: a new approach to testing for assurance. ACM SIGSOFT Softw. Eng. Notes 22(4), 74\u201380 (1997)","journal-title":"ACM SIGSOFT Softw. Eng. Notes"},{"key":"1_CR18","doi-asserted-by":"publisher","unstructured":"Gasca, M.: Multivariate polynomial interpolation, pp. 215\u2013236. Springer Netherlands, Dordrecht (1990). https:\/\/doi.org\/10.1007\/978-94-009-2017-0_7","DOI":"10.1007\/978-94-009-2017-0_7"},{"key":"1_CR19","unstructured":"Gentry, C.: A fully homomorphic encryption scheme. Stanford university (2009)"},{"issue":"4","key":"1_CR20","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S0895480198344540","volume":"13","author":"O Goldreich","year":"2000","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: the highly noisy case. SIAM J. Discret. Math. 13(4), 535\u2013570 (2000)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"1_CR21","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1137\/120879257","volume":"42","author":"E Haramaty","year":"2013","unstructured":"Haramaty, E., Shpilka, A., Sudan, M.: Optimal testing of multivariate polynomials over small prime fields. SIAM J. Comput. 42(2), 536\u2013562 (2013)","journal-title":"SIAM J. Comput."},{"key":"1_CR22","unstructured":"Kalemaj, I., Raskhodnikova, S., Varma, N.: Sublinear-time computation in the presence of online erasures. In: 13th Innovations in Theoretical Computer Science Conference (ITCS 2022), pp. 90\u20131. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/3-540-45537-X_10","volume-title":"Selected Areas in Cryptography","author":"A Kiayias","year":"2001","unstructured":"Kiayias, A., Yung, M.: Polynomial reconstruction based cryptography. In: Vaudenay, S., Youssef, A.M. (eds.) Selected Areas in Cryptography, pp. 129\u2013133. Springer, Berlin Heidelberg, Berlin, Heidelberg (2001)"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Kopparty, S., Saraf, S., Shpilka, A.: Equivalence of polynomial identity testing and polynomial factorization. Comput. Complexity 24(2), 295\u2013331 (2015)","DOI":"10.1007\/s00037-015-0102-y"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Kumar, M., Ramanathan, V., Saptharishi, R.: Deterministic algorithms for low degree factors of constant depth circuits. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 3901\u20133918. SIAM (2024)","DOI":"10.1137\/1.9781611977912.137"},{"issue":"3","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1109\/TR.2018.2834476","volume":"67","author":"H Liang","year":"2018","unstructured":"Liang, H., Pei, X., Jia, X., Shen, W., Zhang, J.: Fuzzing: state of the art. IEEE Trans. Reliab. 67(3), 1199\u20131218 (2018)","journal-title":"IEEE Trans. Reliab."},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Lin, W.K., Mook, E., Wichs, D.: Doubly efficient private information retrieval and fully homomorphic ram computation from ring lwe. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing, pp. 595\u2013608 (2023)","DOI":"10.1145\/3564246.3585175"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Minzer, D., Zheng, K.Z.: Adversarial low degree testing. In: Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 4395\u20134409. SIAM (2024)","DOI":"10.1137\/1.9781611977912.154"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Okada, H., Player, R., Pohmann, S., Weinert, C.: On algebraic homomorphic encryption and its applications to doubly-efficient pir. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 34\u201364. Springer (2025)","DOI":"10.1007\/978-3-031-91095-1_2"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/3-540-48910-X_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT \u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) Advances in Cryptology \u2013 EUROCRYPT \u201999, pp. 223\u2013238. Springer, Berlin Heidelberg, Berlin, Heidelberg (1999)"},{"key":"1_CR31","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1007\/s00145-016-9231-y","volume":"30","author":"M Prabhakaran","year":"2017","unstructured":"Prabhakaran, M., Rosulek, M.: Reconciling non-malleability with homomorphic encryption. J. Cryptol. 30, 601\u2013671 (2017)","journal-title":"J. Cryptol."},{"key":"1_CR32","doi-asserted-by":"publisher","DOI":"10.1016\/j.mex.2020.100956","volume":"7","author":"R Ravikumar","year":"2020","unstructured":"Ravikumar, R.: Split difference method to determine the polynomial function that models the first few given terms of a sequence. MethodsX 7, 100956 (2020)","journal-title":"MethodsX"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Saxena, N.: Progress on Polynomial Identity Testing-II, pp. 131\u2013146. Springer International Publishing, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-05446-9_7","DOI":"10.1007\/978-3-319-05446-9_7"},{"issue":"4","key":"1_CR34","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/322217.322225","volume":"27","author":"JT Schwartz","year":"1980","unstructured":"Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomial identities. J. ACM (JACM) 27(4), 701\u2013717 (1980)","journal-title":"J. ACM (JACM)"},{"key":"1_CR35","unstructured":"Microsoft SEAL (release 4.1). https:\/\/github.com\/Microsoft\/SEAL (Jan 2023),microsoft Research, Redmond, WA"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"Shpilka, A., Volkovich, I.: On the relation between polynomial identity testing and finding variable disjoint factors. In: Abramsky, S., Gavoille, C., Kirchner, C., Meyer auf\u00a0der Heide, F., Spirakis, P.G. (eds.) Automata, Languages and Programming, pp. 408\u2013419. Springer Berlin Heidelberg, Berlin, Heidelberg (2010)","DOI":"10.1007\/978-3-642-14165-2_35"},{"key":"1_CR37","unstructured":"Zama: Concrete: TFHE Compiler that converts python programs into FHE equivalent (2022). https:\/\/github.com\/zama-ai\/concrete"},{"key":"1_CR38","doi-asserted-by":"crossref","unstructured":"Zippel, R.: Probabilistic algorithms for sparse polynomials. In: International symposium on symbolic and algebraic manipulation, pp. 216\u2013226. Springer (1979)","DOI":"10.1007\/3-540-09519-5_73"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-22469-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:57:18Z","timestamp":1775055438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-22469-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032224682","9783032224699"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-22469-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"2 April 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The author has no competing interests to declare that\u00a0are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"RAMICS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"B\u0119dlewo","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 April 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 April 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics-conf.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}