{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:42:27Z","timestamp":1740148947184,"version":"3.37.3"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:00:00Z","timestamp":1715299200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T00:00:00Z","timestamp":1715299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["PQ-TLS, ANR-22-PETQ-0008","PQ-TLS, ANR-22-PETQ-0008","PQ-TLS, ANR-22-PETQ-0008"],"award-info":[{"award-number":["PQ-TLS, ANR-22-PETQ-0008","PQ-TLS, ANR-22-PETQ-0008","PQ-TLS, ANR-22-PETQ-0008"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cryptogr. Commun."],"published-print":{"date-parts":[[2024,9]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Code-based cryptography received attention after the NIST started the post-quantum cryptography standardization process in 2016. A central NP-hard problem is the binary syndrome decoding problem, on which the security of many code-based cryptosystems lies. The best known methods to solve this problem all stem from the information-set decoding strategy, first introduced by Prange in 1962. A recent line of work considers augmented versions of this strategy, with hints typically provided by side-channel information. In this work, we consider the integer syndrome decoding problem, where the integer syndrome is available but might be noisy. We study how the performance of the decoder is affected by the noise. First we identify the noise model as being close to a centered in zero binomial distribution. Second we model the probability of success of the ISD-score decoder in presence of a binomial noise. Third, we demonstrate that with high probability our algorithm finds the solution as long as the noise parameter<jats:italic>d<\/jats:italic>is linear in<jats:italic>t<\/jats:italic>(the Hamming weight of the solution) and<jats:italic>t<\/jats:italic>is sub-linear in the code-length. We provide experimental results on cryptographic parameters for the BIKE and<jats:italic>Classic McEliece<\/jats:italic>cryptosystems, which are both candidates for the fourth round of the NIST standardization process.<\/jats:p>","DOI":"10.1007\/s12095-024-00712-3","type":"journal-article","created":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T04:01:32Z","timestamp":1715313692000},"page":"1103-1134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Integer syndrome decoding in the presence of noise"],"prefix":"10.1007","volume":"16","author":[{"given":"Vlad-Florin","family":"Dr\u0103goi","sequence":"first","affiliation":[]},{"given":"Brice","family":"Colombier","sequence":"additional","affiliation":[]},{"given":"Pierre-Louis","family":"Cayrel","sequence":"additional","affiliation":[]},{"given":"Vincent","family":"Grosso","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,10]]},"reference":[{"issue":"4","key":"712_CR1","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1145\/76894.76895","volume":"21","author":"NR Adam","year":"1989","unstructured":"Adam, N.R., Worthmann, J.C.: Security-control methods for statistical databases: A comparative study. ACM Comput. Surv. 21(4), 515\u2013556 (1989)","journal-title":"ACM Comput. Surv."},{"key":"712_CR2","unstructured":"Albrecht, M.R., Bernstein, D.J., Chou, T., Cid, C., Gilcher, J., Lange, T., Maram, V., von Maurich, I., Misoczki, R., Niederhagen, R., Paterson, K.G., Persichetti, E., Peters, C., Schwabe, P., Sendrier, N., Szefer, J., Tjhai, C.J., Tomlinson, M., Wang, W.: Classic McEliece. Technical report, National Institute of Standards and Technology, available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions. (2020)"},{"key":"712_CR3","unstructured":"Aragon, N., Barreto, P., Bettaieb, S., Bidoux, L., Blazy, O., Deneuville, J.-C., Gaborit, P., Gueron, S., Guneysu, T., Melchor, C.A., Misoczki, R., Persichetti, E., Sendrier, N., Tillich, J.-P., Z\u00e9mor, G., Vasseur, V., Ghosh, S.: BIKE. Technical report, National Institute of Standards and Technology, available at https:\/\/csrc.nist.gov\/projects\/post-quantum-cryptography\/round-3-submissions. (2020)"},{"key":"712_CR4","first-page":"230","volume":"2003","author":"D Augot","year":"2003","unstructured":"Augot, D., Finiasz, M., Sendrier, N.: A fast provably secure cryptographic hash function. IACR Cryptol. ePrint Arch. 2003, 230 (2003)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"712_CR5","doi-asserted-by":"crossref","unstructured":"Becker, A., Joux, A., May, A., Meurer, A.: Decoding random binary linear codes in $$2^{n\/20}$$: How $$1+1=0$$ improves information set decoding. In: Advances in Cryptology - EUROCRYPT\u00a02012, Lecture Notes in Comput. Sci. Springer (2012)","DOI":"10.1007\/978-3-642-29011-4_31"},{"issue":"3","key":"712_CR6","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","volume":"24","author":"E Berlekamp","year":"1978","unstructured":"Berlekamp, E., McEliece, R., van Tilborg, H.: On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory 24(3), 384\u2013386 (1978)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"712_CR7","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Jeffery, S., Lange, T., Meurer, A.: Quantum algorithms for the subset-sum problem. In: Post-quantum cryptography\u00a02011, vol. 7932 of Lecture Notes in Comput. Sci. Limoges, France, pp. 16\u201333, (2013)","DOI":"10.1007\/978-3-642-38616-9_2"},{"key":"712_CR8","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters, C.: Attacking and defending the McEliece cryptosystem. In: Post-Quantum Cryptography\u00a02008, vol. 5299 of Lecture Notes in Comput. Sci. pp. 31\u201346 (2008)","DOI":"10.1007\/978-3-540-88403-3_3"},{"key":"712_CR9","doi-asserted-by":"crossref","unstructured":"Bernstein, D.J., Lange, T., Peters C.: Smaller decoding exponents: ball-collision decoding. In: Advances in cryptology - CRYPTO\u00a02011, volume 6841 of Lecture Notes in Comput. Sci. pp. 743\u2013760 (2011)","DOI":"10.1007\/978-3-642-22792-9_42"},{"key":"712_CR10","doi-asserted-by":"crossref","unstructured":"Bootle, J., Delaplace, C., Espitau, T., Fouque, P-A., Tibouchi, M.: LWE without modular reduction and improved side-channel attacks against BLISS. In: Peyrin, T., Galbraith, S. (eds.) Advances in cryptology \u2013 ASIACRYPT 2018, Cham, pp. 494\u2013524 (2018). Springer International Publishing","DOI":"10.1007\/978-3-030-03326-2_17"},{"key":"712_CR11","doi-asserted-by":"crossref","unstructured":"Both, L., May, A.: Decoding linear codes with high error rate and its impact for LPN security. In: Lange, T., Steinwandt, R. (eds.) Post-Quantum Cryptography - 9th International Conference, PQCrypto 2018, Fort Lauderdale, FL, USA, Proceedings, vol. 10786 of Lecture Notes in Computer Science, Springer, pp. 25\u201346 (2018). Accessed 9\u201311 Apr 2018","DOI":"10.1007\/978-3-319-79063-3_2"},{"issue":"1","key":"712_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1109\/18.651067","volume":"44","author":"A Canteaut","year":"1998","unstructured":"Canteaut, A., Chabaud, F.: A new algorithm for finding minimum-weight words in a linear code: Application to McEliece\u2019s cryptosystem and to narrow-sense BCH codes of length 511. IEEE Trans. Inform. Theory 44(1), 367\u2013378 (1998)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"195","key":"712_CR13","first-page":"1","volume":"15","author":"C-C Cao","year":"2014","unstructured":"Cao, C.-C., Li, C., Sun, X.: Quantitative group testing-based overlapping pool sequencing to identify rare variant carriers. BMC Bioinformatics 15(195), 1\u201314 (2014)","journal-title":"BMC Bioinformatics"},{"key":"712_CR14","doi-asserted-by":"crossref","unstructured":"Carrier, K., Debris-Alazard, T., Meyer-Hilfiger, C., Tillich, J-P.: Statistical decoding 2.0: Reducing decoding to LPN (2022)","DOI":"10.1007\/978-3-031-22972-5_17"},{"key":"712_CR15","doi-asserted-by":"crossref","unstructured":"Cayrel, P.-L., Colombier, B., Dr\u0103goi, V.-F., Menu, A., Bossuet, L.: Message-recovery laser fault injection attack on the classic McEliece cryptosystem. In: Canteaut, A., Standaert, F.-X. (eds.) Advances in cryptology - EUROCRYPT 2021 - 40th annual international conference on the theory and applications of cryptographic techniques, Zagreb, Croatia, Proceedings, Part II, vol. 12697 of Lecture Notes in Computer Science, Springer, pp. 438\u2013467 (2021). Accessed 17\u201321 Oct 2021","DOI":"10.1007\/978-3-030-77886-6_15"},{"key":"712_CR16","unstructured":"Colombier, B., Dr\u0103goi, V.-F., Cayrel, P.-L., Grosso, V.: Message-recovery profiled side-channel attack on the classic McEliece cryptosystem. Cryptology ePrint Archive, Report 2022\/125 (2022)"},{"key":"712_CR17","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/BF02124750","volume":"5","author":"RM Corless","year":"1996","unstructured":"Corless, R.M., Gonnet, G.H., Hare, D.E.G., Jeffrey, D.J., Knuth, D.E.: On the LambertW function. Adv. Comput. Math. 5, 329\u2013359 (1996)","journal-title":"Adv. Comput. Math."},{"key":"712_CR18","doi-asserted-by":"crossref","unstructured":"Debris-Alazard, T., Tillich, J.-P.: Statistical decoding. In: 2017 IEEE International symposium on information theory (ISIT), pp 1798\u20131802, (2017)","DOI":"10.1109\/ISIT.2017.8006839"},{"key":"712_CR19","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: Proceedings of the Twenty-Second ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, PODS \u201903, New York, pp. 202\u2013210 (2003). Association for Computing Machinery","DOI":"10.1145\/773153.773173"},{"key":"712_CR20","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V-F., Cayrel, P.-L., Colombier, B., Bucerzan, D., Hoara, S.: Solving a modified syndrome decoding problem using integer programming. Int. J. Comput. Commun. Control 15(5), (2020)","DOI":"10.15837\/ijccc.2020.5.3920"},{"key":"712_CR21","doi-asserted-by":"crossref","unstructured":"Dr\u0103goi, V.,-F., Colombier, B., Cayrel, P.-L., Grosso, V.: Integer syndrome decoding in the presence of noise. In: 2022 IEEE Information theory workshop (ITW), pp. 482\u2013487 (2022)","DOI":"10.1109\/ITW54588.2022.9965806"},{"issue":"1","key":"712_CR22","first-page":"17","volume":"25","author":"I Dumer","year":"1989","unstructured":"Dumer, I.: Two decoding algorithms for linear codes. Probl. Inf. Transm. 25(1), 17\u201323 (1989)","journal-title":"Probl. Inf. Transm."},{"key":"712_CR23","unstructured":"Dumer, I.: On minimum distance decoding of linear codes. In: Proc. 5th Joint Soviet-Swedish Int. Workshop Inform. Theory, Moscow, pp. 50\u201352, (1991)"},{"key":"712_CR24","doi-asserted-by":"crossref","unstructured":"Esser, A., Bellini, E.: Syndrome decoding estimator. In: Hanaoka, G., Shikata, J., Watanabe, Y. (eds.) IACR International conference on practice and theory of public-key cryptography, vol 13177 of Lecture Notes in Computer Science, pp 112\u2013141, virtual event, March 2022. Springer","DOI":"10.1007\/978-3-030-97121-2_5"},{"key":"712_CR25","unstructured":"Feige, U., Lellouche, A.: Quantitative group testing and the rank of random matrices. CoRR, abs\/2006.09074, (2020)"},{"key":"712_CR26","doi-asserted-by":"crossref","unstructured":"Finiasz, M., Sendrier, N.: Security bounds for the design of code-based cryptosystems. In: Matsui, M. (ed.) Advances in Cryptology - ASIACRYPT\u00a02009, vol. 5912 of Lecture Notes in Comput. Sci., Springer, pp. 88\u2013105 (2009)","DOI":"10.1007\/978-3-642-10366-7_6"},{"issue":"1","key":"712_CR27","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1109\/TIT.2006.887515","volume":"53","author":"M Fossorier","year":"2007","unstructured":"Fossorier, M., Kobara, K., Imai, H.: Modeling bit flipping decoding based on nonorthogonal check sums with application to iterative decoding attack of McEliece cryptosystem. IEEE Trans. Inf. Theor. 53(1), 402\u2013411 (2007)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"712_CR28","doi-asserted-by":"crossref","unstructured":"Gaborit, P., Lauradoux, C., Sendrier, N.: SYND: a fast code-based stream cipher with a security reduction. In: 2007 IEEE International symposium on information theory, pp. 186\u2013190 (2007)","DOI":"10.1109\/ISIT.2007.4557224"},{"key":"712_CR29","doi-asserted-by":"crossref","unstructured":"Grosso, V., Cayrel, P.-L., Colombier, B., Dr\u0103goi, V.-F.: Punctured syndrome decoding problem. In: Kavun, E.B., Pehl, M. (eds.) Constructive side-channel analysis and secure design, Cham, pp. 170\u2013192 (2023). Springer Nature Switzerland","DOI":"10.1007\/978-3-031-29497-6_9"},{"issue":"4","key":"712_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.3934\/amc.2019035","volume":"13","author":"Q Guo","year":"2019","unstructured":"Guo, Q., Johansson, T., M\u00e5rtensson, E., Wagner, P.S.: Some cryptanalytic and coding-theoretic applications of a soft stern algorithm. Adv. Math. Commun. 13(4), 559\u2013578 (2019)","journal-title":"Adv. Math. Commun."},{"issue":"7825","key":"712_CR31","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1038\/s41586-020-2649-2","volume":"585","author":"CR Harris","year":"2020","unstructured":"Harris, C.R., Millman, K.J., Van Der Walt, S.J., Gommers, R., Virtanen, P., Cournapeau, D., Wieser, E., Taylor, J., Berg, S., Smith, N.J., et al.: Array programming with numpy. Nature 585(7825), 357\u2013362 (2020)","journal-title":"Nature"},{"key":"712_CR32","unstructured":"Johann Heinrich.: Observationes variae in mathesin puram. Acta Helvetica Physico-Mathematico-Anatomico-Bota-nico-Medica 3, 128\u2013168 (1758)"},{"key":"712_CR33","doi-asserted-by":"crossref","unstructured":"Horlemann, A.-L., Puchinger, S., Renner, J., Schamberger, T., Wachter-Zeh, A.: Information-set decoding with hints. In: Wachter-Zeh, A., Bartz, H., Liva, G. (eds.) International workshop on code-based cryptography, vol. 13150 of Lecture Notes in Computer Science, Munich, Germany, Springer, pp. 60\u201383 (2021)","DOI":"10.1007\/978-3-030-98365-9_4"},{"key":"712_CR34","doi-asserted-by":"crossref","unstructured":"Jabri, A.A.: A statistical decoding algorithm for general linear block codes. In: Honary, B. (ed) Cryptography and Coding, Berlin, Heidelberg, pp. 1\u20138 (2001). Springer Berlin Heidelberg","DOI":"10.1007\/3-540-45325-3_1"},{"key":"712_CR35","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1017\/S0269964800142032","volume":"14","author":"B Klar","year":"2000","unstructured":"Klar, B.: Bounds on tail probabilities of discrete distributions. Probab. Eng. Inform. Sci. 14, 161\u2013171 (2000)","journal-title":"Probab. Eng. Inform. Sci."},{"key":"712_CR36","doi-asserted-by":"crossref","unstructured":"Lee, P.J., Brickell, E.F.: An observation on the security of McEliece\u2019s public-key cryptosystem. In: Advances in cryptology - EUROCRYPT\u201988 vol. 330 of Lecture Notes in Comput. Sci. Springer, pp. 275\u2013280 (1988)","DOI":"10.1007\/3-540-45961-8_25"},{"issue":"5","key":"712_CR37","doi-asserted-by":"publisher","first-page":"1354","DOI":"10.1109\/18.21270","volume":"34","author":"J Leon","year":"1988","unstructured":"Leon, J.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory 34(5), 1354\u20131359 (1988)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"712_CR38","doi-asserted-by":"crossref","unstructured":"Martins, J.P., Santos, R., Sousa, R.: Testing the Maximum by the Mean in Quantitative Group Tests, Publishing, Cham, pp. 55\u201363 (2014). Springer International","DOI":"10.1007\/978-3-319-05323-3_5"},{"key":"712_CR39","doi-asserted-by":"crossref","unstructured":"May, A., Meurer, A., Thomae, E.: Decoding random linear codes in $$O(2^{0.054n})$$. In: Lee, D.H., Wang, X. (eds.) Advances in Cryptology - ASIACRYPT\u00a02011, vol. 7073 of Lecture Notes in Comput. Sci., Springer, pp. 107\u2013124 (2011)","DOI":"10.1007\/978-3-642-25385-0_6"},{"key":"712_CR40","doi-asserted-by":"crossref","unstructured":"May, A., Ozerov, I.: On computing nearest neighbors with applications to decoding of binary linear codes. In: Oswald, E., Fischlin, M., (eds.) Advances in Cryptology - EUROCRYPT\u00a02015, vol. 9056 of Lecture Notes in Comput. Sci., Springer, pp. 203\u2013228 (2015)","DOI":"10.1007\/978-3-662-46800-5_9"},{"key":"712_CR41","doi-asserted-by":"crossref","unstructured":"Niebuhr, R.: Statistical decoding of codes over $${\\textbf{F}}_q$$. In: Post-Quantum Cryptography\u00a02011, vol. 7071 of Lecture Notes in Comput. Sci. Springer, pp. 217\u2013227 (2011)","DOI":"10.1007\/978-3-642-25405-5_14"},{"issue":"2","key":"712_CR42","first-page":"159","volume":"15","author":"H Niederreiter","year":"1986","unstructured":"Niederreiter, H.: Knapsack-type cryptosystems and algebraic coding theory. Problems of Control and Information Theory 15(2), 159\u2013166 (1986)","journal-title":"Problems of Control and Information Theory"},{"key":"712_CR43","doi-asserted-by":"crossref","unstructured":"Overbeck, R.: A new structural attack for GPT and variants. In: Mycrypt, vol. 3715 of Lecture Notes in Comput. Sci. pp. 50\u201363 (2005)","DOI":"10.1007\/11554868_5"},{"key":"712_CR44","series-title":"Lecture Notes in Comput","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/11780656_24","volume-title":"Information security and privacy : 11$$^{th}$$ Australasian conference, ACISP 2006","author":"R Overbeck","year":"2006","unstructured":"Overbeck, R.: Statistical decoding revisited. In: Batten, L., Safavi-Naini, R. (eds.) Information security and privacy\u202f: 11$$^{th}$$ Australasian conference, ACISP 2006. Lecture Notes in Comput, vol. 4058, pp. 283\u2013294. Springer, Sci. (2006)"},{"key":"712_CR45","unstructured":"Prange, E.: Cyclic error-correcting codes in two symbols. Electronics Research Directorate, Air Force Cambridge Research Center, (1957). No. AFCRC-TN-57-103. ASTIA Document No. AD133749"},{"issue":"5","key":"712_CR46","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1962.1057777","volume":"8","author":"E Prange","year":"1962","unstructured":"Prange, E.: The use of information sets in decoding cyclic codes. IRE Transactions on Information Theory 8(5), 5\u20139 (1962)","journal-title":"IRE Transactions on Information Theory"},{"key":"712_CR47","doi-asserted-by":"crossref","unstructured":"Shor, P.W.: Algorithms for quantum computation: Discrete logarithms and factoring. In: Goldwasser, S. (ed.) FOCS, pp. 124\u2013134 (1994)","DOI":"10.1109\/SFCS.1994.365700"},{"key":"712_CR48","doi-asserted-by":"crossref","unstructured":"Shrestha, S.R., Kim, Y.S.: New McEliece cryptosystem based on polar codes as a candidate for post-quantum cryptography. In: 2014 14th International symposium on communications and information technologies (ISCIT), IEEE, pp. 368\u2013372 (2014)","DOI":"10.1109\/ISCIT.2014.7011934"},{"issue":"3","key":"712_CR49","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1515\/dma.1994.4.3.191","volume":"4","author":"VM Sidelnikov","year":"1994","unstructured":"Sidelnikov, V.M.: A public-key cryptosytem based on Reed-Muller codes. Discrete Math. Appl. 4(3), 191\u2013207 (1994)","journal-title":"Discrete Math. Appl."},{"key":"712_CR50","doi-asserted-by":"crossref","unstructured":"Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds) Coding Theory and Applications, vol. 388 of Lecture Notes in Comput. Sci. Springer, pp. 106\u2013113 (1988)","DOI":"10.1007\/BFb0019850"},{"key":"712_CR51","doi-asserted-by":"crossref","unstructured":"Stern, J.: A new identification scheme based on syndrome decoding. In: Stinson, D.R. (ed) Advances in cryptology - CRYPTO \u201993, 13th annual international cryptology conference, Santa Barbara, California, USA, August 22-26, 1993, Proceedings, vol. 773 of Lecture Notes in Comput. Sci. Springer, pp. 13\u201321 (1993)","DOI":"10.1007\/3-540-48329-2_2"},{"key":"712_CR52","doi-asserted-by":"crossref","unstructured":"Tiplea, F.L., Dragoi, V.F.: Generalized inverse based decoding. In: IEEE International Symposium on Information Theory, ISIT 2022, Espoo, Finland, June 26 - July 1, 2022, IEEE, pp. 2791\u20132796 (2022)","DOI":"10.1109\/ISIT50566.2022.9834696"},{"key":"712_CR53","doi-asserted-by":"crossref","unstructured":"Virtanen, P., Gommers, R., Oliphant, T.E., Haberland, M., Reddy, T., Cournapeau, D., Burovski, E., Peterson, P., Weckesser, W., Bright, J. et\u00a0al.: Scipy 1.0: fundamental algorithms for scientific computing in python. Nature methods, 17(3), 261\u2013272 (2020)","DOI":"10.1038\/s41592-020-0772-5"},{"key":"712_CR54","doi-asserted-by":"crossref","unstructured":"Wang, C., Zhao, Q., Chuah, C.N.: Group testing under sum observations for heavy hitter detection. In: 2015 Information theory and applications workshop (ITA), pp. 149\u2013153 (2015)","DOI":"10.1109\/ITA.2015.7308980"},{"key":"712_CR55","doi-asserted-by":"crossref","unstructured":"Wang, I.J., Huang, S.L., Lee, K.Y., Chen, K.C.: Data extraction via histogram and arithmetic mean queries: Fundamental limits and algorithms. In: 2016 IEEE International symposium on information theory (ISIT), pp. 1386\u20131390 (2016)","DOI":"10.1109\/ISIT.2016.7541526"},{"key":"712_CR56","volume-title":"Practical Predictive Analytics","author":"R Winters","year":"2017","unstructured":"Winters, R.: Practical Predictive Analytics. Packt Publishing, Birmingham, England (2017)"}],"container-title":["Cryptography and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00712-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12095-024-00712-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12095-024-00712-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T14:18:55Z","timestamp":1731939535000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12095-024-00712-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,10]]},"references-count":56,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["712"],"URL":"https:\/\/doi.org\/10.1007\/s12095-024-00712-3","relation":{},"ISSN":["1936-2447","1936-2455"],"issn-type":[{"type":"print","value":"1936-2447"},{"type":"electronic","value":"1936-2455"}],"subject":[],"published":{"date-parts":[[2024,5,10]]},"assertion":[{"value":"30 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no conflicts of interest to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}