{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,19]],"date-time":"2025-11-19T07:06:31Z","timestamp":1763535991997,"version":"3.37.3"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T00:00:00Z","timestamp":1658188800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004410","name":"Scientific and Technological Research Council of Turkey","doi-asserted-by":"crossref","award":["119E088"],"award-info":[{"award-number":["119E088"]}],"id":[{"id":"10.13039\/501100004410","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2023,4]]},"DOI":"10.1007\/s10586-022-03611-5","type":"journal-article","created":{"date-parts":[[2022,7,19]],"date-time":"2022-07-19T16:09:51Z","timestamp":1658246991000},"page":"1063-1075","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An ECC processor for IoT using Edwards curves and DFT modular multiplication"],"prefix":"10.1007","volume":"26","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0585-2619","authenticated-orcid":false,"given":"Osama","family":"Al-Khaleel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Selcuk","family":"Baktir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alptekin","family":"K\u00fcp\u00e7\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,19]]},"reference":[{"key":"3611_CR1","doi-asserted-by":"publisher","first-page":"8860413","DOI":"10.1155\/2021\/8860413","volume":"2021","author":"M Morales-Sandoval","year":"2021","unstructured":"Morales-Sandoval, M., Flores, L.A.R., Cumplido, R., Garcia-Hernandez, J.J., Feregrino, C., Algredo, I.: A compact fpga-based accelerator for curve-based cryptography in wireless sensor networks. J. Sens. 2021, 8860413 (2021). https:\/\/doi.org\/10.1155\/2021\/8860413","journal-title":"J. Sens."},{"issue":"4","key":"3611_CR2","doi-asserted-by":"publisher","first-page":"586","DOI":"10.1109\/TETC.2016.2606384","volume":"5","author":"A Mosenia","year":"2017","unstructured":"Mosenia, A., Jha, N.K.: A comprehensive study of security of internet-of-things. IEEE Trans. Emerg. Topics Comput. 5(4), 586\u2013602 (2017). https:\/\/doi.org\/10.1109\/TETC.2016.2606384","journal-title":"IEEE Trans. Emerg. Topics Comput."},{"key":"3611_CR3","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-030-34515-0_28","volume-title":"Sustainable Communication Networks and Application","author":"J Joglekar","year":"2020","unstructured":"Joglekar, J., Bhutani, S., Patel, N., Soman, P.: Lightweight elliptical curve cryptography (ecc) for data integrity and user authentication in smart transportation iot system. In: Karrupusamy, P. (ed.) Sustainable Communication Networks and Application, pp. 270\u2013278. Springer, Berlin (2020)"},{"issue":"3","key":"3611_CR4","doi-asserted-by":"publisher","first-page":"3440","DOI":"10.1109\/JSYST.2020.2970167","volume":"14","author":"B Hammi","year":"2020","unstructured":"Hammi, B., Fayad, A., Khatoun, R., Zeadally, S., Begriche, Y.: A lightweight ecc-based authentication scheme for internet of things (iot). IEEE Syst. J. 14(3), 3440\u20133450 (2020). https:\/\/doi.org\/10.1109\/JSYST.2020.2970167","journal-title":"IEEE Syst. J."},{"key":"3611_CR5","doi-asserted-by":"publisher","DOI":"10.3390\/en14154676","author":"S Di Matteo","year":"2021","unstructured":"Di Matteo, S., Baldanzi, L., Crocetti, L., Nannipieri, P., Fanucci, L., Saponara, S.: Secure elliptic curve crypto-processor for real-time iot applications. Energies (2021). https:\/\/doi.org\/10.3390\/en14154676","journal-title":"Energies"},{"key":"3611_CR6","doi-asserted-by":"publisher","unstructured":"Dhillon, P.K., Kalra, S.: Elliptic curve cryptography for real time embedded systems in iot networks. In: 2016 5th International conference on wireless networks and embedded systems (WECON), pp. 1\u20136 (2016). https:\/\/doi.org\/10.1109\/WECON.2016.7993462","DOI":"10.1109\/WECON.2016.7993462"},{"issue":"3","key":"3611_CR7","doi-asserted-by":"publisher","first-page":"720","DOI":"10.1109\/TIFS.2018.2856123","volume":"14","author":"Z Liu","year":"2019","unstructured":"Liu, Z., Seo, H.: Iot-nums: evaluating nums elliptic curve cryptography for iot platforms. IEEE Trans. Inf. Forensics Sec. 14(3), 720\u2013729 (2019). https:\/\/doi.org\/10.1109\/TIFS.2018.2856123","journal-title":"IEEE Trans. Inf. Forensics Sec."},{"key":"3611_CR8","doi-asserted-by":"crossref","unstructured":"Manifavas, C., Hatzivasilis, G., Fysarakis, K., Rantos, K.: Lightweight cryptography for embedded systems\u2014a comparative analysis. In: Data Privacy Management and Autonomous Spontaneous Security, pp. 333\u2013349 (2014)","DOI":"10.1007\/978-3-642-54568-9_21"},{"key":"3611_CR9","unstructured":"Meiklejohn, S., Erway, C.C., K\u00fcp\u00e7\u00fc, A., Hinkle, T., Lysyanskaya, A.: $$\\{$$ZKPDL$$\\}$$: A $$\\{$$Language-Based$$\\}$$ system for efficient $$\\{$$Zero-Knowledge$$\\}$$ proofs and electronic cash. In: USENIX Security Symposium (2010)"},{"issue":"9","key":"3611_CR10","doi-asserted-by":"publisher","first-page":"1614","DOI":"10.1109\/TCSII.2020.3012448","volume":"67","author":"L-Y Yeh","year":"2020","unstructured":"Yeh, L.-Y., Chen, P.-J., Pai, C.-C., Liu, T.-T.: An energy-efficient dual-field elliptic curve cryptography processor for internet of things applications. IEEE Trans. Circuits Syst. II 67(9), 1614\u20131618 (2020). https:\/\/doi.org\/10.1109\/TCSII.2020.3012448","journal-title":"IEEE Trans. Circuits Syst. II"},{"key":"3611_CR11","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-39799-X_31","volume-title":"Advances in Cryptology\u2014CRYPTO \u201985 Proceedings","author":"VS Miller","year":"1986","unstructured":"Miller, V.S.: Use of elliptic curves in cryptography. In: Williams, H.C. (ed.) Advances in Cryptology\u2014CRYPTO \u201985 Proceedings, pp. 417\u2013426. Springer, Berlin, Heidelberg (1986)"},{"issue":"177","key":"3611_CR12","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1090\/S0025-5718-1987-0866109-5","volume":"48","author":"N Koblitz","year":"1987","unstructured":"Koblitz, N.: Elliptic curve cryptosystems. Math. Comput. 48(177), 203\u2013209 (1987)","journal-title":"Math. Comput."},{"issue":"4","key":"3611_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s13389-015-0097-y","volume":"6","author":"JW Bos","year":"2016","unstructured":"Bos, J.W., Costello, C., Longa, P., Naehrig, M.: Selecting elliptic curves for cryptography: an efficiency and security analysis. J. Cryptograph. Eng. 6(4), 259\u2013286 (2016). https:\/\/doi.org\/10.1007\/s13389-015-0097-y","journal-title":"J. Cryptograph. Eng."},{"issue":"4","key":"3611_CR14","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11036-007-0022-4","volume":"12","author":"S Baktir","year":"2007","unstructured":"Baktir, S., Kumar, S.S., Paar, C., Sunar, B.: A state-of-the-art elliptic curve cryptographic processor operating in the frequency domain. MONET 12(4), 259\u2013270 (2007). https:\/\/doi.org\/10.1007\/s11036-007-0022-4","journal-title":"MONET"},{"key":"3611_CR15","unstructured":"Bos, J., Kaihara, M., Kleinjung, T., Lenstra, A.K., Montgomery, P.L.: On the security of 1024-bit rsa and 160-bit elliptic curve cryptography. Cryptology ePrint Archive, Report 2009\/389 (2009)"},{"key":"3611_CR16","unstructured":"Kocaogullar, C., Y\u0131ld\u0131r\u0131m, K., Sakaogullar\u0131, M.A., K\u00fcp\u00e7\u00fc, A.: Basgit: A secure digital epassport alternative. In: ISCTURKEY (2021)"},{"key":"3611_CR17","doi-asserted-by":"crossref","unstructured":"Taheri-Boshrooyeh, S., K\u00fcp\u00e7\u00fc, A., \u00d6zkasap, \u00d6.: Security and privacy of distributed online social networks. In: 2015 IEEE 35th international conference on distributed computing systems workshops, pp. 112\u2013119 (2015). IEEE","DOI":"10.1109\/ICDCSW.2015.30"},{"key":"3611_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2016.08.011","volume":"68","author":"B Y\u00fcksel","year":"2017","unstructured":"Y\u00fcksel, B., K\u00fcp\u00e7\u00fc, A., \u00d6zkasap, \u00d6.: Research issues for privacy and security of electronic health services. Future Gener. Comput. Syst. 68, 1\u201313 (2017)","journal-title":"Future Gener. Comput. Syst."},{"key":"3611_CR19","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1090\/S0273-0979-07-01153-6","volume":"44","author":"H Edwards","year":"2007","unstructured":"Edwards, H.: A normal form for elliptic curves. Bull. Am. Math. Soc. 44, 393\u2013423 (2007). https:\/\/doi.org\/10.1090\/S0273-0979-07-01153-6","journal-title":"Bull. Am. Math. Soc."},{"issue":"1","key":"3611_CR20","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s13389-019-00206-6","volume":"10","author":"R Abarz\u00faa","year":"2020","unstructured":"Abarz\u00faa, R., Mart\u00ednez, S., Mendoza, V., Th\u00e9riault, N.: Same value analysis on Edwards curves. J. Cryptograph. Eng. 10(1), 27\u201348 (2020). https:\/\/doi.org\/10.1007\/s13389-019-00206-6","journal-title":"J. Cryptograph. Eng."},{"key":"3611_CR21","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J.: Curve25519: New diffie-hellman speed records. In: PKC, pp. 207\u2013228 (2006)","DOI":"10.1007\/11745853_14"},{"key":"3611_CR22","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: Elliptic-curve points indistinguishable from uniform random strings. In: ACM CCS, pp. 967\u2013980 (2013)","DOI":"10.1145\/2508859.2516734"},{"key":"3611_CR23","first-page":"625","volume":"2015","author":"M Hamburg","year":"2015","unstructured":"Hamburg, M.: Ed448-goldilocks, a new elliptic curve. IACR Cryptol. ePrint Arch. 2015, 625 (2015)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"3611_CR24","doi-asserted-by":"crossref","unstructured":"Renes, J., Costello, C., Batina, L.: Complete addition formulas for prime order elliptic curves. In: EUROCRYPT, pp. 403\u2013428 (2016)","DOI":"10.1007\/978-3-662-49890-3_16"},{"issue":"6","key":"3611_CR25","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s00200-013-0211-2","volume":"24","author":"S Mart\u00ednez","year":"2013","unstructured":"Mart\u00ednez, S., Sadornil, D., Tena, J., Tom\u00e0s, R., Valls, M.: On edwards curves and zvp-attacks. Appl. Algebra Eng. Commun. Comput. 24(6), 507\u2013517 (2013)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"3611_CR26","doi-asserted-by":"crossref","unstructured":"Bos, J.W., Halderman, J.A., Heninger, N., Moore, J., Naehrig, M., Wustrow, E.: Elliptic curve cryptography in practice. In: Financial Cryptography and Data Security, pp. 157\u2013175 (2014)","DOI":"10.1007\/978-3-662-45472-5_11"},{"key":"3611_CR27","doi-asserted-by":"crossref","unstructured":"Faug\u00e8re, J.-C., Perret, L., Petit, C., Renault, G.: Improving the complexity of index calculus algorithms in elliptic curves over binary fields. In: EUROCRYPT, pp. 27\u201344 (2012)","DOI":"10.1007\/978-3-642-29011-4_4"},{"key":"3611_CR28","doi-asserted-by":"crossref","unstructured":"Gandolfi, K., Mourtel, C., Olivier, F.: Electromagnetic analysis: concrete results. In: CHES, pp. 251\u2013261 (2001)","DOI":"10.1007\/3-540-44709-1_21"},{"issue":"90","key":"3611_CR29","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1090\/S0025-5718-1965-0178586-1","volume":"19","author":"JW Cooley","year":"1965","unstructured":"Cooley, J.W., Tukey, J.W.: An algorithm for the machine calculation of complex Fourier series. Math. Comput. 19(90), 297\u2013301 (1965)","journal-title":"Math. Comput."},{"issue":"3","key":"3611_CR30","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/BF02242355","volume":"7","author":"A Sch\u00f6nhage","year":"1971","unstructured":"Sch\u00f6nhage, A., Strassen, V.: Schnelle multiplikation gro\u00dfer zahlen. Computing 7(3), 281\u2013292 (1971)","journal-title":"Computing"},{"issue":"3","key":"3611_CR31","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1137\/070711761","volume":"39","author":"M F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M.: Faster integer multiplication. SIAM J. Comput. 39(3), 979\u20131005 (2009)","journal-title":"SIAM J. Comput."},{"key":"3611_CR32","doi-asserted-by":"crossref","unstructured":"Bakt\u0131r, S., Sunar, B.: Finite field polynomial multiplication in the frequency domain with application to elliptic curve cryptography. In: ISCIS, pp. 991\u20131001 (2006)","DOI":"10.1007\/11902140_103"},{"key":"3611_CR33","doi-asserted-by":"publisher","DOI":"10.1016\/j.engfailanal.2021.105580","volume":"128","author":"J Chen","year":"2021","unstructured":"Chen, J., Liu, P., Zhao, H., Zhang, C., Zhang, J.: Analytical studying the axial performance of fully encapsulated rock bolts. Eng. Failure Anal. 128, 105580 (2021). https:\/\/doi.org\/10.1016\/j.engfailanal.2021.105580","journal-title":"Eng. Failure Anal."},{"issue":"1","key":"3611_CR34","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1051\/m2an\/2016061","volume":"51","author":"S-L Wu","year":"2017","unstructured":"Wu, S.-L., Al-Khaleel, M.D.: Optimized waveform relaxation methods for rc circuits: discrete case. ESAIM M2AN 51(1), 209\u2013223 (2017). https:\/\/doi.org\/10.1051\/m2an\/2016061","journal-title":"ESAIM M2AN"},{"key":"3611_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.tust.2021.104265","volume":"120","author":"J Chen","year":"2022","unstructured":"Chen, J., Li, D.: Numerical simulation of fully encapsulated rock bolts with a tri-linear constitutive relation. Tunn. Undergr. Space Technol. 120, 104265 (2022). https:\/\/doi.org\/10.1016\/j.tust.2021.104265","journal-title":"Tunn. Undergr. Space Technol."},{"issue":"3","key":"3611_CR36","doi-asserted-by":"publisher","first-page":"831","DOI":"10.1007\/s10543-014-0475-3","volume":"54","author":"S-L Wu","year":"2014","unstructured":"Wu, S.-L., Al-Khaleel, M.D.: Semi-discrete Schwarz waveform relaxation algorithms for reaction diffusion equations. BIT Numer. Math. 54(3), 831\u2013866 (2014). https:\/\/doi.org\/10.1007\/s10543-014-0475-3","journal-title":"BIT Numer. Math."},{"key":"3611_CR37","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T.: Faster addition and doubling on elliptic curves. In: Kurosawa, K. (ed.) ASIACRYPT, pp. 29\u201350 (2007)","DOI":"10.1007\/978-3-540-76900-2_3"},{"key":"3611_CR38","doi-asserted-by":"publisher","unstructured":"Mentens, N., Batina, L., Baktir, S.: An elliptic curve cryptographic processor using edwards curves and the number theoretic transform. In: BalkanCryptSec, pp. 94\u2013102 (2014). https:\/\/doi.org\/10.1007\/978-3-319-21356-9_7","DOI":"10.1007\/978-3-319-21356-9_7"},{"issue":"1","key":"3611_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.3390\/jsan10010003","volume":"10","author":"A Verri Lucca","year":"2021","unstructured":"Verri Lucca, A., Mariano Sborz, G.A., Leithardt, V.R.Q., Beko, M., Albenes Zeferino, C., Parreira, W.D.: A review of techniques for implementing elliptic curve point multiplication on hardware. J. Sens. Actuator Netw. 10(1), 3 (2021)","journal-title":"J. Sens. Actuator Netw."},{"issue":"1","key":"3611_CR40","doi-asserted-by":"publisher","first-page":"31","DOI":"10.11648\/j.iotcc.20190701.15","volume":"7","author":"S Absar","year":"2019","unstructured":"Absar, S., Hossain, M., Kong, Y.: Efficient hardware implementation of modular arithmetic and group operation over prime field. Internet Things Cloud Comput. 7(1), 31\u201338 (2019). https:\/\/doi.org\/10.11648\/j.iotcc.20190701.15","journal-title":"Internet Things Cloud Comput."},{"issue":"3","key":"3611_CR41","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/TCSI.2018.2878598","volume":"66","author":"J Ding","year":"2019","unstructured":"Ding, J., Li, S., Gu, Z.: High-speed ecc processor over nist prime fields applied with toom-cook multiplication. IEEE Trans. Circuits Syst. I 66(3), 1003\u20131016 (2019). https:\/\/doi.org\/10.1109\/TCSI.2018.2878598","journal-title":"IEEE Trans. Circuits Syst. I"},{"key":"3611_CR42","doi-asserted-by":"publisher","unstructured":"Hossain, M.R., Hossain, M.S.: Efficient fpga implementation of modular arithmetic for elliptic curve cryptography. In: 2019 International conference on electrical, computer and communication engineering (ECCE), pp. 1\u20136 (2019). https:\/\/doi.org\/10.1109\/ECACE.2019.8679419","DOI":"10.1109\/ECACE.2019.8679419"},{"issue":"2","key":"3611_CR43","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1002\/cta.2295","volume":"45","author":"K Javeed","year":"2017","unstructured":"Javeed, K., Wang, X.: Low latency flexible fpga implementation of point multiplication on elliptic curves over gf(p). I. J. Circuit Theory Appl. 45(2), 214\u2013228 (2017)","journal-title":"I. J. Circuit Theory Appl."},{"issue":"8","key":"3611_CR44","doi-asserted-by":"publisher","first-page":"1256","DOI":"10.1002\/cta.2759","volume":"48","author":"T Kudithi","year":"2020","unstructured":"Kudithi, T., Sakthivel, R.: An efficient hardware implementation of the elliptic curve cryptographic processor over prime field. Int. J. Circuit Theory Appl. 48(8), 1256\u20131273 (2020)","journal-title":"Int. J. Circuit Theory Appl."},{"key":"3611_CR45","doi-asserted-by":"publisher","first-page":"431","DOI":"10.3390\/electronics8040431","volume":"8","author":"X Hu","year":"2019","unstructured":"Hu, X., Zheng, X., Zhang, S., Li, W., Cai, S., Xiong, X.: A high-performance elliptic curve cryptographic processor of sm2 over gf(p). Electronics 8, 431 (2019). https:\/\/doi.org\/10.3390\/electronics8040431","journal-title":"Electronics"},{"key":"3611_CR46","doi-asserted-by":"crossref","unstructured":"Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: CRYPTO, pp. 472\u2013485 (1998)","DOI":"10.1007\/BFb0055748"},{"issue":"3","key":"3611_CR47","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/s001450010012","volume":"14","author":"DV Bailey","year":"2001","unstructured":"Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptol. 14(3), 153\u2013176 (2001)","journal-title":"J. Cryptol."},{"issue":"4","key":"3611_CR48","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.3390\/s21041451","volume":"21","author":"AM Awaludin","year":"2021","unstructured":"Awaludin, A.M., Larasati, H.T., Kim, H.: High-speed and unified ecc processor for generic weierstrass curves over gf(p) on fpga. Sensors 21(4), 1251 (2021)","journal-title":"Sensors"},{"key":"3611_CR49","doi-asserted-by":"publisher","unstructured":"Al-Khaleel, O., Bakt\u0131r, S., K\u00fcp\u00e7\u00fc, A.: Fpga implementation of an ecc processor using edwards curves and dft modular multiplication. In: 2021 12th International conference on information and communication systems (ICICS), pp. 344\u2013351 (2021). https:\/\/doi.org\/10.1109\/ICICS52457.2021.9464611","DOI":"10.1109\/ICICS52457.2021.9464611"},{"key":"3611_CR50","doi-asserted-by":"crossref","unstructured":"Esiner, E., K\u00fcp\u00e7\u00fc, A., \u00d6zkasap, \u00d6.: Analysis and optimization on flexdpdp: A practical solution for dynamic provable data possession. In: International conference on intelligent cloud computing, pp. 65\u201383 (2014). Springer","DOI":"10.1007\/978-3-319-19848-4_5"},{"issue":"4","key":"3611_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2943783","volume":"12","author":"E Esiner","year":"2016","unstructured":"Esiner, E., Kachkeev, A., Braunfeld, S., K\u00fcp\u00e7\u00fc, A., \u00d6zkasap, \u00d6.: Flexdpdp: flexlist-based optimized dynamic provable data possession. ACM Trans. Storage (TOS) 12(4), 1\u201344 (2016)","journal-title":"ACM Trans. Storage (TOS)"},{"issue":"1","key":"3611_CR52","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3365998","volume":"53","author":"M Etemad","year":"2020","unstructured":"Etemad, M., K\u00fcp\u00e7\u00fc, A.: Generic dynamic data outsourcing framework for integrity verification. ACM Comput. Surv. (CSUR) 53(1), 1\u201332 (2020)","journal-title":"ACM Comput. Surv. (CSUR)"}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03611-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-022-03611-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-022-03611-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T01:19:51Z","timestamp":1679879991000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-022-03611-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,19]]},"references-count":52,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,4]]}},"alternative-id":["3611"],"URL":"https:\/\/doi.org\/10.1007\/s10586-022-03611-5","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2022,7,19]]},"assertion":[{"value":"5 October 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 March 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"All authors declare tha they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"The work presented in this paper is a valuable extension to our work presented in 12th International Conference on Information and Communication Systems (ICICS2021). In this journal version, we extend our proposal to cover higher security levels, modify our solution to also work over the finite prime fields  and  in addition to , and perform and report extended. performance and area measurements. The paper is not currently being considered for publication elsewhere. The paper reflects the authors\u2019 own research and analysis in a truthful and complete manner. The results are appropriately placed in the context of prior and existing research. All sources used are properly disclosed (correct citation).","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}}]}}