{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T20:27:18Z","timestamp":1757622438036,"version":"3.44.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783032006417"},{"type":"electronic","value":"9783032006424"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-032-00642-4_10","type":"book-chapter","created":{"date-parts":[[2025,8,9]],"date-time":"2025-08-09T06:59:09Z","timestamp":1754722749000},"page":"165-182","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Novel Approximations of\u00a0Elementary Functions in\u00a0Zero-Knowledge Proofs"],"prefix":"10.1007","author":[{"given":"Kaarel August","family":"Kurik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peeter","family":"Laud","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,10]]},"reference":[{"key":"10_CR1","unstructured":"Angel, S., Blumberg, A.J., Ioannidis, E., Woods, J.: Efficient representation of numerical optimization problems for snarks. In: Butler, K., Thomas, K. (eds.) 31st USENIX Security Symposium. USENIX Security 2022, Boston, MA, USA, 10\u201312 August, pp. 4273\u20134290 (2022)"},{"key":"10_CR2","unstructured":"Baron, J.: I was told there would be blockchain: 5 Years of Real World Crypto at DARPA. Talk given at Real World Crypto Symposium (2023)"},{"issue":"27","key":"10_CR3","doi-asserted-by":"publisher","first-page":"3023","DOI":"10.1080\/14786435.2015.1081425","volume":"95","author":"V Barsan","year":"2015","unstructured":"Barsan, V.: Algebraic approximations for transcendental equations with applications in nanophysics. Phil. Mag. 95(27), 3023\u20133038 (2015)","journal-title":"Phil. Mag."},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Baum, C., Malozemoff, A.J., Rosen, M.B., Scholl, P.: Mac\u2019n\u2019Cheese: zero-knowledge proofs for boolean and arithmetic circuits with nested disjunctions. In: Malkin, T., Peikert, C. (eds.) Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, 16\u201320 August 2021, Proceedings, Part IV. LNCS, vol. 12828, pp. 92\u2013122. Springer (2021)","DOI":"10.1007\/978-3-030-84259-8_4"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Bellare, M., Goldwasser, S.: New paradigms for digital signatures and message authentication based on non-interative zero knowledge proofs. In: Brassard, G. (ed.) Advances in Cryptology - CRYPTO 1989, 9th Annual International Cryptology Conference, Santa Barbara, California, USA, 20\u201324 August 1989, Proceedings. LNCS, vol.\u00a0435, pp. 194\u2013211. Springer (1989)","DOI":"10.1007\/0-387-34805-0_19"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Sasson, E., et al.: Zerocash: decentralized anonymous payments from bitcoin. In: 2014 IEEE Symposium on Security and Privacy, SP 2014, Berkeley, CA, USA, 18\u201321 May 2014, pp. 459\u2013474. IEEE Computer Society (2014)","DOI":"10.1109\/SP.2014.36"},{"key":"10_CR7","unstructured":"Ben-Tal, A., Nemirovski, A.: Lecture notes: Optimization III (2023). https:\/\/www2.isye.gatech.edu\/~nemirovs\/OPTIIILN2023Spring.pdf"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Bogdanov, D., et al.: ZK-SecreC: a domain-specific language for zero-knowledge proofs. In: 37th IEEE Computer Security Foundations Symposium, CSF 2024, Enschede, Netherlands, 8\u201312 July 2024, pp. 372\u2013387. IEEE (2024)","DOI":"10.1109\/CSF61375.2024.00010"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Bootle, J., Cerulli, A., Groth, J., Jakobsen, S.K., Maller, M.: Arya: nearly linear- time zero-knowledge proofs for correct program execution. In: Peyrin, T., Galbraith, S.D. (eds.) Advances in Cryptology - ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, 2\u20136 December 2018, Proceedings, Part I. LNCS, vol. 11272, pp. 595\u2013626. Springer (2018)","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"10_CR10","unstructured":"Bunn, P., et al.: SIEVE Intermediate Representation (2022). https:\/\/github.com\/sieve-zk\/ir"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Catrina, O.: Complexity and performance of secure floating-point polynomial evaluation protocols. In: Bertino, E., Schulmann, H., Waidner, M. (eds.) Computer Security - ESORICS 2021 - 26th European Symposium on Research in Computer Security, Darmstadt, Germany, 4\u20138 October 2021, Proceedings, Part II. LNCS, vol. 12973, pp. 352\u2013369. Springer (2021)","DOI":"10.1007\/978-3-030-88428-4_18"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Catrina, O., Dragulin, C.: Multiparty computation of fixed-point multiplication and reciprocal. In: Tjoa, A.M., Wagner, R.R. (eds.) Database and Expert Systems Applications, DEXA, International Workshops, Linz, Austria, August 31\u2013September 4 2009, Proceedings, pp. 107\u2013111. IEEE Computer Society (2009)","DOI":"10.1109\/DEXA.2009.84"},{"key":"10_CR13","unstructured":"Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Sion, R. (ed.) Financial Cryptography and Data Security, 14th International Conference, FC 2010, Tenerife, Canary Islands, Spain, 25\u201328 January 2010, Revised Selected Papers. LNCS, vol. 6052, pp. 35\u201350. Springer (2010)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Chevillard, S., Jolde\u015f, M., Lauter, C.: Sollya: an environment for the development of numerical codes. In: Fukuda, K., van der Hoeven, J., Joswig, M., Takayama, N. (eds.) Mathematical Software - ICMS 2010. LNCS, vol. 6327, pp. 28\u201331. Springer, Heidelberg (2010)","DOI":"10.1007\/978-3-642-15582-6_5"},{"key":"10_CR15","doi-asserted-by":"crossref","unstructured":"Dimitrov, V.S., Kerik, L., Krips, T., Randmets, J., Willemson, J.: Alternative implementations of secure real numbers. In: Weippl, E.R., Katzenbeisser, S., Kruegel, C., Myers, A.C., Halevi, S. (eds.) Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, Vienna, Austria, 24\u201328 October 2016, pp. 553\u2013564. ACM (2016)","DOI":"10.1145\/2976749.2978348"},{"key":"10_CR16","unstructured":"Feng, B., Qin, L., Zhang, Z., Ding, Y., Chu, S.: ZEN: an optimizing compiler for verifiable, zero-knowledge neural network inferences. Cryptology ePrint Archive, Paper 2021\/087 (2021)"},{"issue":"2","key":"10_CR17","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1090\/qam\/12910","volume":"3","author":"TC Fry","year":"1945","unstructured":"Fry, T.C.: Some numerical methods for locating roots of polynomials. Q. Appl. Math. 3(2), 89\u2013105 (1945)","journal-title":"Q. Appl. Math."},{"key":"10_CR18","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) Proceedings of the 19th Annual ACM Symposium on Theory of Computing, New York, New York, USA, pp. 218\u2013229. ACM (1987)","DOI":"10.1145\/28395.28420"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems (extended abstract). In: Sedgewick, R. (ed.) Proceedings of the 17th Annual ACM Symposium on Theory of Computing, Providence, Rhode Island, USA, 6\u20138 May 1985, pp. 291\u2013304. ACM (1985)","DOI":"10.1145\/22145.22178"},{"key":"10_CR20","unstructured":"Hayashi, T.: Bhaskara I. Encyclopedia Britannica (2019). https:\/\/www.britannica.com\/biography\/Bhaskara-I"},{"issue":"6","key":"10_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10207-014-0271-8","volume":"14","author":"L Kamm","year":"2015","unstructured":"Kamm, L., Willemson, J.: Secure floating point arithmetic and private satellite collision analysis. Int. J. Inf. Sec. 14(6), 531\u2013548 (2015)","journal-title":"Int. J. Inf. Sec."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Krips, T., Willemson, J.: Hybrid model of fixed and floating point numbers in secure multiparty computations. In: Chow, S.S.M., Camenisch, J., Hui, L.C.K., Yiu, S. (eds.) Information Security - 17th International Conference, ISC 2014, Hong Kong, China, 12\u201314 October 2014. Proceedings. LNCS, vol. 8783, pp. 179\u2013197. Springer (2014)","DOI":"10.1007\/978-3-319-13257-0_11"},{"key":"10_CR23","unstructured":"Krips, T., Willemson, J.: Point-counting method for embarrassingly parallel evaluation in secure computation. In: Garc\u00eda-Alfaro, J., Kranakis, E., Bonfante, G. (eds.) Foundations and Practice of Security - 8th International Symposium, FPS 2015, Clermont-Ferrand, France, 26\u201328 October 2015, Revised Selected Papers. LNCS, vol.\u00a09482, pp. 66\u201382. Springer (2015)"},{"key":"10_CR24","unstructured":"Kurik, K. A., Laud, P.: Novel approximations of elementary functions in zero-knowledge proofs. Cryptology ePrint Archive, Paper 2024\/859 (2024)"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Liu, T., Xie, X., Zhang, Y.: zkcnn: Zero knowledge proofs for convolutional neural network predictions and accuracy. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) CCS 2021: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, 15\u201319 November 2021, pp. 2968\u20132985. ACM (2021)","DOI":"10.1145\/3460120.3485379"},{"key":"10_CR26","unstructured":"Mehlhorn, K., N\u00e4her, S.: LEDA: A Platform for Combinatorial and Geometric Computing. Cambridge University Press (1999)"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Scheffler, S., Tromer, E., Varia, M.: Formalizing human ingenuity: a quantitative framework for copyright law\u2019s substantial similarity. In: Weitzner, D.J., Feigenbaum, J., Yoo, C.S. (eds.) Proceedings of the 2022 Symposium on Computer Science and Law, CSLAW 2022, Washington DC, USA, 1\u20132 November 2022, pp. 37\u201349. ACM (2022)","DOI":"10.1145\/3511265.3550444"},{"key":"10_CR28","unstructured":"Setty, S.T.V., Vu, V., Panpalia, N., Braun, B., Blumberg, A.J., Walfish, M.: Taking Proof-Based Verified Computation a Few Steps Closer to Practicality. In: Kohno, T. (ed.) Proceedings of the 21th USENIX Security Symposium, Bellevue, WA, USA, 8\u201310 August 2012, pp. 253\u2013268. USENIX Association (2012)"},{"key":"10_CR29","unstructured":"Trefethen, L.: Approximation Theory and Approximation Practice. Other Titles in Applied Mathematics. SIAM (2013)"},{"key":"10_CR30","unstructured":"Weng, C., Yang, K., Xie, X., Katz, J., Wang, X.: Mystique: efficient conversions for zero-knowledge proofs with applications to machine learning. In: Bailey, M.D., Greenstadt, R. (eds.) 30th USENIX Security Symposium, USENIX Security 2021, 11\u201313 August 2021, pp. 501\u2013518. USENIX Association (2021)"},{"key":"10_CR31","doi-asserted-by":"publisher","DOI":"10.1088\/2399-6528\/aac0e8","volume":"2","author":"B Wu","year":"2018","unstructured":"Wu, B., Liu, W., Wang, Z., Chen, X.: Approximate expressions for solutions to two kinds of transcendental equations with applications. J. Phys. Commun. 2, 055009 (2018)","journal-title":"J. Phys. Commun."},{"key":"10_CR32","unstructured":"Xu, R., Baracaldo, N., Joshi, J.: Privacy-preserving machine learning: methods, challenges and directions. CoRR abs\/2108.04417 (2021)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Yang, K., Sarkar, P., Weng, C., Wang, X.: Quicksilver: efficient and affordable zero-knowledge proofs for circuits and polynomials over any field. In: Kim, Y., Kim, J., Vigna, G., Shi, E. (eds.) CCS 2021: 2021 ACM SIGSAC Conference on Computer and Communications Security, Virtual Event, Republic of Korea, 15-19 November 2021, pp. 2986\u20133001. ACM (2021)","DOI":"10.1145\/3460120.3484556"}],"container-title":["Lecture Notes in Computer Science","Availability, Reliability and Security"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-00642-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T20:01:42Z","timestamp":1757361702000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-00642-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783032006417","9783032006424"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-00642-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"10 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ARES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Availability, Reliability and Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ghent","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ares-12025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.ares-conference.eu","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}