{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,25]],"date-time":"2026-07-25T10:50:23Z","timestamp":1784976623139,"version":"3.55.0"},"reference-count":54,"publisher":"Springer Science and Business Media LLC","issue":"1","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":["J Cryptol"],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1007\/s00145-024-09536-z","type":"journal-article","created":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T19:19:00Z","timestamp":1737487140000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Improved Universal Thresholdizer from Iterative Shamir Secret Sharing"],"prefix":"10.1007","volume":"38","author":[{"given":"Jung Hee","family":"Cheon","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wonhee","family":"Cho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jiseung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,1,13]]},"reference":[{"key":"9536_CR1","doi-asserted-by":"crossref","unstructured":"S. Agrawal, X. Boyen, V. Vaikuntanathan, P. Voulgaris, H. Wee, Functional encryption for threshold functions (or fuzzy ibe) from lattices, in Public Key Cryptography\u2014PKC 2012. ed. by M. Fischlin, J. Buchmann, M. Manulis (Springer, Berlin, 2012), pp. 280\u2013297","DOI":"10.1007\/978-3-642-30057-8_17"},{"key":"9536_CR2","doi-asserted-by":"crossref","unstructured":"S. Agrawal, D. Stehl\u00e9, A. Yadav, Round-optimal lattice-based threshold signatures, revisited, in 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022) (Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2022)","DOI":"10.1145\/3548606.3560650"},{"key":"9536_CR3","doi-asserted-by":"crossref","unstructured":"B. Applebaum, O. Nir, B. Pinkas, How to recover a secret with o(n) additions, in Advances in Cryptology\u2014CRYPTO 2023. ed. by H. Handschuh, A. Lysyanskaya (Springer, Cham, 2023), pp. 236\u2013262","DOI":"10.1007\/978-3-031-38557-5_8"},{"key":"9536_CR4","doi-asserted-by":"crossref","unstructured":"G. Asharov, A. Jain, A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, D. Wichs, Multiparty computation with low communication, computation and interaction via threshold fhe, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2012), pp. 483\u2013501","DOI":"10.1007\/978-3-642-29011-4_29"},{"key":"9536_CR5","doi-asserted-by":"crossref","unstructured":"S. Badrinarayanan, A. Jain, N. Manohar, A. Sahai, Secure mpc: laziness leads to god, in Advances in Cryptology\u2014ASIACRYPT 2020. ed. by S. Moriai, H. Wang (Springer, Cham, 2020), pp. 120\u2013150","DOI":"10.1007\/978-3-030-64840-4_5"},{"key":"9536_CR6","unstructured":"M. Ball, A. \u00c7akan, T. Malkin, Linear threshold secret-sharing with binary reconstruction, in 2nd Conference on Information-Theoretic Cryptography (ITC 2021), volume 199 of Leibniz International Proceedings in Informatics (LIPIcs). ed. by S. Tessaro (Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 2021), pp. 11\u20131222"},{"key":"9536_CR7","doi-asserted-by":"crossref","unstructured":"R. Bendlin, I. Damg\u00e5rd, Threshold decryption and zero-knowledge proofs for lattice-based cryptosystems, in Theory of Cryptography Conference (Springer, 2010), pp. 201\u2013218","DOI":"10.1007\/978-3-642-11799-2_13"},{"key":"9536_CR8","unstructured":"F. Benhamouda, S. Halevi, L. Stambler, Weighted secret sharing from wiretap channels, in 4th Conference on Information-Theoretic Cryptography (ITC 2023), volume 267 of Leibniz International Proceedings in Informatics (LIPIcs), vol. 267, ed. by K.-M. Chung (Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany, 2023), pp. 81\u2013819"},{"key":"9536_CR9","doi-asserted-by":"crossref","unstructured":"N. Bitansky, Verifiable random functions from non-interactive witness-indistinguishable proofs. J. Cryptol. 33(2), 459\u2013493 (2020)","DOI":"10.1007\/s00145-019-09331-1"},{"key":"9536_CR10","doi-asserted-by":"crossref","unstructured":"G.R. Blakley 1985 Catherine Meadows, Security of ramp schemes. In G.R. Blakley and D. Chaum, editors, Advances in Cryptology (Springer, Berlin), pp. 242\u2013268","DOI":"10.1007\/3-540-39568-7_20"},{"key":"9536_CR11","doi-asserted-by":"crossref","unstructured":"M. Blum, Coin flipping by telephone a protocol for solving impossible problems. ACM SIGACT News. 15(1), 23\u201327 (1983)","DOI":"10.1145\/1008908.1008911"},{"key":"9536_CR12","doi-asserted-by":"crossref","unstructured":"A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gap-diffie-hellman-group signature scheme, in International Workshop on Public Key Cryptography (Springer, 2003), pp. 31\u201346","DOI":"10.1007\/3-540-36288-6_3"},{"key":"9536_CR13","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. Gennaro, S. Goldfeder, Using level-1 homomorphic encryption to improve threshold dsa signatures for bitcoin wallet security, in International Conference on Cryptology and Information Security in Latin America (Springer, 2017), pp. 352\u2013377","DOI":"10.1007\/978-3-030-25283-0_19"},{"key":"9536_CR14","doi-asserted-by":"crossref","unstructured":"D. Boneh, R. Gennaro, S. Goldfeder, A. Jain, S. Kim, P.M.R. Rasmussen, A. Sahai, Threshold cryptosystems from threshold fully homomorphic encryption, in Annual International Cryptology Conference (Springer, 2018), pp. 565\u2013596","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"9536_CR15","doi-asserted-by":"crossref","unstructured":"J.-P. Bossuat, R. Cammarota, J.H. Cheon, I. Chillotti, B.R. Curtis, W. Dai, H. Gong, E. Hales, D. Kim, B. Kumara et al., Security guidelines for implementing homomorphic encryption. Cryptology ePrint Archive (2024)","DOI":"10.62056\/anxra69p1"},{"key":"9536_CR16","doi-asserted-by":"crossref","unstructured":"K. Boudgoust, P. Scholl, Simple threshold (fully homomorphic) encryption from lwe with polynomial modulus, in Advances in Cryptology\u2014ASIACRYPT 2023. ed. by J. Guo, R. Steinfeld (Springer, Singapore, 2023), pp. 371\u2013404","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"9536_CR17","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, Fully homomorphic encryption without modulus switching from classical gapsvp, in Advances in Cryptology\u2014CRYPTO 2012 (Springer, Berlin, 2012), pp. 868\u2013886","DOI":"10.1007\/978-3-642-32009-5_50"},{"key":"9536_CR18","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, C. Gentry, V. Vaikuntanathan, (leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory (TOCT) 6(3), 1\u201336 (2014)","DOI":"10.1145\/2633600"},{"key":"9536_CR19","doi-asserted-by":"crossref","unstructured":"Z. Brakerski, R. Perlman, Lattice-based fully dynamic multi-key fhe with short ciphertexts, in Annual Cryptology Conference (Springer, 2016), pp. 190\u2013213","DOI":"10.1007\/978-3-662-53018-4_8"},{"key":"9536_CR20","doi-asserted-by":"crossref","unstructured":"R. Canetti, R. Gennaro, S. Goldfeder, N. Makriyannis, U. Peled, Uc non-interactive, proactive, threshold ECDSA with identifiable aborts, in Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (2020), pp. 1769\u20131787","DOI":"10.1145\/3372297.3423367"},{"key":"9536_CR21","doi-asserted-by":"crossref","unstructured":"J.H. Cheon, A. Kim, M. Kim, Y. Song, Homomorphic encryption for arithmetic of approximate numbers, in International Conference on the Theory and Application of Cryptology and Information Security (Springer, New York, 2017), pp. 409\u2013437","DOI":"10.1007\/978-3-319-70694-8_15"},{"key":"9536_CR22","doi-asserted-by":"crossref","unstructured":"J H. Cheon, D. Kim, D. Kim, Efficient homomorphic comparison methods with optimal complexity, in Advances in Cryptology\u2013ASIACRYPT 2020, ed. by S. Moriai, H. Wang (Springer, Cham, 2020), pp. 221\u2013256","DOI":"10.1007\/978-3-030-64834-3_8"},{"key":"9536_CR23","doi-asserted-by":"crossref","unstructured":"I. Chillotti, N. Gama, M. Georgieva, M. Izabachene, Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds, in international Conference on the Theory and Application of Cryptology and Information Security (Springer, 2016), pp. 3\u201333","DOI":"10.1007\/978-3-662-53887-6_1"},{"key":"9536_CR24","unstructured":"S. Chowdhury, S. Sinha, A. Singh, S. Mishra, C. Chaudhary, S. Patranabis, P. Mukherjee, A. Chatterjee, D. Mukhopadhyay, Efficient fhe with threshold decryption and application to real-time systems. Cryptology ePrint Archive (2022)"},{"key":"9536_CR25","doi-asserted-by":"crossref","unstructured":"I. Damg\u00e5rd, M. Koprowski, Practical threshold rsa signatures without a trusted dealer, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2001), pp. 152\u2013165","DOI":"10.1007\/3-540-44987-6_10"},{"key":"9536_CR26","doi-asserted-by":"crossref","unstructured":"A. De\u00a0Santis, Y. Desmedt, Y. Frankel, M. Yung, How to share a function securely, in Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing (ACM, 1994), pp. 522\u2013533","DOI":"10.1145\/195058.195405"},{"key":"9536_CR27","unstructured":"Y. Desmedt, Y. Frankel, Threshold cryptosystesns. Adv. Cryptol. 305\u2013315 (1989)"},{"key":"9536_CR28","unstructured":"J. Fan, F. Vercauteren, Somewhat practical fully homomorphic encryption. Cryptology ePrint Archive, Paper 2012\/144 (2012)"},{"key":"9536_CR29","doi-asserted-by":"crossref","unstructured":"Y. Frankel, A practical protocol for large group oriented networks, in Workshop on the Theory and Application of of Cryptographic Techniques (Springer, 1989), pp. 56\u201361","DOI":"10.1007\/3-540-46885-4_8"},{"key":"9536_CR30","doi-asserted-by":"crossref","unstructured":"S. Garg, A. Jain, P. Mukherjee, R. Sinha, M. Wang, Y. Zhang, Cryptography with weights: Mpc, encryption and signatures, in Advances in Cryptology\u2013CRYPTO 2023. ed. by H. Handschuh, A. Lysyanskaya (Springer, Cham, 2023), pp. 295\u2013327","DOI":"10.1007\/978-3-031-38557-5_10"},{"key":"9536_CR31","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Goldfeder, Fast multiparty threshold ecdsa with fast trustless setup, in Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security (2018), pp. 1179\u20131194","DOI":"10.1145\/3243734.3243859"},{"key":"9536_CR32","unstructured":"R. Gennaro, S. Goldfeder, One round threshold ecdsa with identifiable abort. Cryptology ePrint Archive (2020)"},{"key":"9536_CR33","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Goldfeder, A. Narayanan, Threshold-optimal dsa\/ecdsa signatures and an application to bitcoin wallet security, in International Conference on Applied Cryptography and Network Security (Springer, 2016), pp. 156\u2013174","DOI":"10.1007\/978-3-319-39555-5_9"},{"key":"9536_CR34","doi-asserted-by":"crossref","unstructured":"R. Gennaro, S. Jarecki, H. Krawczyk, T. Rabin, Robust threshold dss signatures. Inf. Comput. 164(1), 54\u201384 (2001)","DOI":"10.1006\/inco.2000.2881"},{"key":"9536_CR35","doi-asserted-by":"crossref","unstructured":"O. Goldreich, On (Valiant\u2019s) Polynomial-Size Monotone Formula for Majority (Springer, Cham, 2020), pp. 17\u201323","DOI":"10.1007\/978-3-030-43662-9_3"},{"key":"9536_CR36","doi-asserted-by":"crossref","unstructured":"S.D. Gordon, F.-H. Liu, E. Shi, Constant-round mpc with fairness and guarantee of output delivery, in Annual Cryptology Conference (Springer, 2015), pp. 63\u201382","DOI":"10.1007\/978-3-662-48000-7_4"},{"issue":"1","key":"9536_CR37","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/BF01202041","volume":"6","author":"A Gupta","year":"1996","unstructured":"A. Gupta, S. Mahajan, Using amplification to compute majority with small majority gates. Computational Complexity. 6(1), 46\u201363 (1996)","journal-title":"Comput. Complex."},{"key":"9536_CR38","doi-asserted-by":"crossref","unstructured":"K.D. Gur, J. Katz, T. Silde, Two-round threshold lattice-based signatures from threshold homomorphic encryption, in International Conference on Post-Quantum Cryptography (Springer, 2024), pp. 266\u2013300","DOI":"10.1007\/978-3-031-62746-0_12"},{"key":"9536_CR39","doi-asserted-by":"crossref","unstructured":"S. Hoory, A. Magen, T. Pitassi, Monotone circuits for the majority function, in International Workshop on Approximation Algorithms for Combinatorial Optimization (Springer, 2006), pp. 410\u2013425","DOI":"10.1007\/11830924_38"},{"key":"9536_CR40","unstructured":"A. Jain, P.M.R. Rasmussen, A. Sahai, Threshold fully homomorphic encryption. IACR Cryptol. ePrint Arch. 2017, 257 (2017)"},{"key":"9536_CR41","doi-asserted-by":"crossref","unstructured":"D. Lapidot, A. Shamir, Publicly verifiable non-interactive zero-knowledge proofs, in Conference on the Theory and Application of Cryptography (Springer, 1990), pp. 353\u2013365","DOI":"10.1007\/3-540-38424-3_26"},{"key":"9536_CR42","doi-asserted-by":"crossref","unstructured":"Y. Lee, D. Micciancio, A.K, R. Choi, M. Deryabin, J. Eom, D. Yoo, Efficient fhew bootstrapping with small evaluation keys, and applications to threshold homomorphic encryption, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2023), pp. 227\u2013256","DOI":"10.1007\/978-3-031-30620-4_8"},{"key":"9536_CR43","doi-asserted-by":"crossref","unstructured":"A. Lewko, B. Waters, Decentralizing attribute-based encryption, in Annual international Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2011), pp. 568\u2013588","DOI":"10.1007\/978-3-642-20465-4_31"},{"key":"9536_CR44","doi-asserted-by":"crossref","unstructured":"Y. Lindell, Fast secure two-party ecdsa signing, in Annual International Cryptology Conference (Springer, 2017), pp. 613\u2013644","DOI":"10.1007\/978-3-319-63715-0_21"},{"key":"9536_CR45","doi-asserted-by":"crossref","unstructured":"A. L\u00f3pez-Alt, E. Tromer, V. Vaikuntanathan, On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption, in Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing (2012), pp. 1219\u20131234","DOI":"10.1145\/2213977.2214086"},{"key":"9536_CR46","doi-asserted-by":"crossref","unstructured":"P. MacKenzie, M.K. Reiter, Two-party generation of dsa signatures. Int. J. Inf. Secur. 2(3), 218\u2013239 (2004)","DOI":"10.1007\/s10207-004-0041-0"},{"key":"9536_CR47","doi-asserted-by":"crossref","unstructured":"P. Mukherjee, D. Wichs, Two round multiparty computation via multi-key fhe, in Annual International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2016), pp. 735\u2013763","DOI":"10.1007\/978-3-662-49896-5_26"},{"key":"9536_CR48","doi-asserted-by":"crossref","unstructured":"C Peikert, S. Shiehian, Multi-key fhe from lwe, revisited, in Theory of Cryptography Conference (Springer, 2016), pp. 217\u2013238","DOI":"10.1007\/978-3-662-53644-5_9"},{"key":"9536_CR49","doi-asserted-by":"crossref","unstructured":"A.D. Santis, S. Micali, G. Persiano, Non-interactive zero-knowledge with preprocessing, in Conference on the Theory and Application of Cryptography (Springer, 1988), pp. 269\u2013282","DOI":"10.1007\/0-387-34799-2_21"},{"key":"9536_CR50","doi-asserted-by":"crossref","unstructured":"A. Shamir, How to share a secret. Commun. ACM. 22(11), 612\u2013613 (1979)","DOI":"10.1145\/359168.359176"},{"key":"9536_CR51","doi-asserted-by":"crossref","unstructured":"V. Shoup, Practical threshold signatures, in International Conference on the Theory and Applications of Cryptographic Techniques (Springer, 2000), pp. 207\u2013220","DOI":"10.1007\/3-540-45539-6_15"},{"key":"9536_CR52","doi-asserted-by":"crossref","unstructured":"D.R. Stinson, R. Strobl, Provably secure distributed schnorr signatures and a (t, n) threshold scheme for implicit certificates, in Australasian Conference on Information Security and Privacy (Springer, 2001), pp. 417\u2013434","DOI":"10.1007\/3-540-47719-5_33"},{"key":"9536_CR53","doi-asserted-by":"crossref","unstructured":"G. Leslie, Valiant, Short monotone formulae for the majority function. J. Algorithm. 5(3), 363\u2013366 (1984)","DOI":"10.1016\/0196-6774(84)90016-6"},{"key":"9536_CR54","doi-asserted-by":"crossref","unstructured":"Z. Wang, X. Fan, F.-H. Liu, Fe for inner products and its application to decentralized abe, in Public-Key Cryptography\u2014PKC 2019. ed. by D. Lin, K. Sako (Springer, Cham, 2019), pp. 97\u2013127","DOI":"10.1007\/978-3-030-17259-6_4"}],"container-title":["Journal of Cryptology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09536-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00145-024-09536-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00145-024-09536-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:34:13Z","timestamp":1739309653000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00145-024-09536-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":54,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,1]]}},"alternative-id":["9536"],"URL":"https:\/\/doi.org\/10.1007\/s00145-024-09536-z","relation":{},"ISSN":["0933-2790","1432-1378"],"issn-type":[{"value":"0933-2790","type":"print"},{"value":"1432-1378","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]},"assertion":[{"value":"13 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 January 2025","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"15"}}