{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T11:45:45Z","timestamp":1770810345147,"version":"3.50.0"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032115386","type":"print"},{"value":"9783032115393","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-11539-3_10","type":"book-chapter","created":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T05:13:21Z","timestamp":1770786801000},"page":"163-180","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Thetacrypt: A Distributed Service for\u00a0Threshold Cryptography"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-3962-7499","authenticated-orcid":false,"given":"Mariarosaria","family":"Barbaraci","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0000-4798-165X","authenticated-orcid":false,"given":"Michael","family":"Senn","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5395-1653","authenticated-orcid":false,"given":"Noah","family":"Schmid","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5477-3736","authenticated-orcid":false,"given":"Orestis","family":"Alpos","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8967-9213","authenticated-orcid":false,"given":"Christian","family":"Cachin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2026,2,12]]},"reference":[{"key":"10_CR1","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: DHAES: an encryption scheme based on the diffie-hellman problem. IACR Cryptol. ePrint Arch, p.\u00a07 (1999). http:\/\/eprint.iacr.org\/1999\/007"},{"key":"10_CR2","doi-asserted-by":"publisher","unstructured":"Abdalla, M., Bellare, M., Rogaway, P.: The oracle diffie-hellman assumptions and an analysis of DHIES. In: Naccache, D. (ed.) Topics in Cryptology - CT-RSA 2001, The Cryptographer\u2019s Track at RSA Conference 2001, San Francisco, CA, USA, April 8-12, 2001, Proceedings. Lecture Notes in Computer Science, vol.\u00a02020, pp. 143\u2013158. Springer (2001). https:\/\/doi.org\/10.1007\/3-540-45353-9_12","DOI":"10.1007\/3-540-45353-9_12"},{"key":"10_CR3","doi-asserted-by":"publisher","unstructured":"Baek, J., Zheng, Y.: Simple and efficient threshold cryptosystem from the gap diffie-hellman group. In: Proceedings of the Global Telecommunications Conference, 2003. GLOBECOM \u201903, San Francisco, CA, USA, 1-5 December 2003, pp. 1491\u20131495. IEEE (2003). https:\/\/doi.org\/10.1109\/GLOCOM.2003.1258486, https:\/\/doi.org\/10.1109\/GLOCOM.2003.1258486","DOI":"10.1109\/GLOCOM.2003.1258486"},{"key":"10_CR4","unstructured":"Barbaraci, M., Schmid, N., Alpos, O., Senn, M., Cachin, C.: Thetacrypt: a distributed service for threshold cryptography (2025). https:\/\/arxiv.org\/abs\/2502.03247"},{"key":"10_CR5","unstructured":"Bebel, J., Ojha, D.: Ferveo: threshold decryption for mempool privacy in BFT networks. IACR Cryptol. ePrint Arch, p.\u00a0898 (2022). https:\/\/eprint.iacr.org\/2022\/898"},{"key":"10_CR6","doi-asserted-by":"publisher","unstructured":"Bessani, A.N., Sousa, J., Alchieri, E.A.P.: State machine replication for the masses with BFT-SMART. In: 44th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks, DSN 2014, Atlanta, GA, USA, June 23-26, 2014, pp. 355\u2013362. IEEE Computer Society (2014). https:\/\/doi.org\/10.1109\/DSN.2014.43, https:\/\/doi.org\/10.1109\/DSN.2014.43","DOI":"10.1109\/DSN.2014.43"},{"key":"10_CR7","doi-asserted-by":"publisher","unstructured":"Boneh, D., Lynn, B., Shacham, H.: Short signatures from the weil pairing. J. Cryptol. 17(4), 297\u2013319 (2004). https:\/\/doi.org\/10.1007\/S00145-004-0314-9","DOI":"10.1007\/S00145-004-0314-9"},{"key":"10_CR8","doi-asserted-by":"publisher","unstructured":"Cachin, C., Kursawe, K., Shoup, V.: Random oracles in constantinople: practical asynchronous byzantine agreement using cryptography. J. Cryptol. 18(3), 219\u2013246 (2005). https:\/\/doi.org\/10.1007\/s00145-005-0318-0","DOI":"10.1007\/s00145-005-0318-0"},{"key":"10_CR9","doi-asserted-by":"publisher","unstructured":"Camenisch, J., et al.: Internet computer consensus. In: Milani, A., Woelfel, P. (eds.) PODC \u201922: ACM Symposium on Principles of Distributed Computing, Salerno, Italy, July 25 - 29, 2022, pp. 81\u201391. ACM (2022). https:\/\/doi.org\/10.1145\/3519270.3538430","DOI":"10.1145\/3519270.3538430"},{"key":"10_CR10","doi-asserted-by":"publisher","unstructured":"Cascudo, I., David, B.: SCRAPE: scalable randomness attested by public entities. In: Gollmann, D., Miyaji, A., Kikuchi, H. (eds.) Applied Cryptography and Network Security - 15th International Conference, ACNS 2017, Kanazawa, Japan, July 10-12, 2017, Proceedings. Lecture Notes in Computer Science, vol. 10355, pp. 537\u2013556. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-61204-1_27","DOI":"10.1007\/978-3-319-61204-1_27"},{"key":"10_CR11","doi-asserted-by":"publisher","unstructured":"Choi, K., Manoj, A., Bonneau, J.: Sok: distributed randomness beacons. In: 44th IEEE Symposium on Security and Privacy, SP 2023, San Francisco, CA, USA, May 21-25, 2023, pp. 75\u201392. IEEE (2023). https:\/\/doi.org\/10.1109\/SP46215.2023.10179419","DOI":"10.1109\/SP46215.2023.10179419"},{"key":"10_CR12","unstructured":"Cloud native computing foundation: GRPC: a high performance, open source universal RPC framework (2025). https:\/\/grpc.io\/"},{"key":"10_CR13","doi-asserted-by":"publisher","unstructured":"Daian, P., et al.: Flash boys 2.0: frontrunning in decentralized exchanges, miner extractable value, and consensus instability. In: 2020 IEEE Symposium on Security and Privacy, SP 2020, San Francisco, CA, USA, May 18-21, 2020, pp. 910\u2013927. IEEE (2020). https:\/\/doi.org\/10.1109\/SP40000.2020.00040, https:\/\/doi.org\/10.1109\/SP40000.2020.00040","DOI":"10.1109\/SP40000.2020.00040"},{"key":"10_CR14","doi-asserted-by":"publisher","unstructured":"Das, S., Krishnan, V., Isaac, I.M., Ren, L.: Spurt: scalable distributed randomness beacon with transparent setup. In: 43rd IEEE Symposium on Security and Privacy, SP 2022, San Francisco, CA, USA, May 22-26, 2022, pp. 2502\u20132517. IEEE (2022). https:\/\/doi.org\/10.1109\/SP46214.2022.9833580, https:\/\/doi.org\/10.1109\/SP46214.2022.9833580","DOI":"10.1109\/SP46214.2022.9833580"},{"key":"10_CR15","doi-asserted-by":"publisher","unstructured":"Desmedt, Y.: Threshold cryptography. Eur. Trans. Telecommun. 5(4), 449\u2013458 (1994). https:\/\/doi.org\/10.1002\/ETT.4460050407","DOI":"10.1002\/ETT.4460050407"},{"key":"10_CR16","unstructured":"The DFINITY foundation (2025). https:\/\/dfinity.org"},{"key":"10_CR17","unstructured":"DFNS: Web3 wallets as an API (2025). https:\/\/www.dfns.co"},{"key":"10_CR18","unstructured":"DRAND: distributed randomness beacon (2025). https:\/\/drand.love"},{"key":"10_CR19","doi-asserted-by":"publisher","unstructured":"Galindo, D., Liu, J., Ordean, M., Wong, J.: Fully distributed verifiable random functions and their application to decentralised random beacons. In: IEEE European Symposium on Security and Privacy, EuroS &P 2021, Vienna, Austria, September 6-10, 2021, pp. 88\u2013102. IEEE (2021). https:\/\/doi.org\/10.1109\/EUROSP51992.2021.00017","DOI":"10.1109\/EUROSP51992.2021.00017"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Gamal, T.E.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31(4), 469\u2013472 (1985).","DOI":"10.1109\/TIT.1985.1057074"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-030-40186-3_13","volume-title":"Topics in Cryptology \u2013 CT-RSA 2020","author":"J Garay","year":"2020","unstructured":"Garay, J., Kiayias, A.: SOK: A Consensus Taxonomy in the Blockchain Era. In: Jarecki, S. (ed.) CT-RSA 2020. LNCS, vol. 12006, pp. 284\u2013318. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-40186-3_13"},{"key":"10_CR22","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Goldfeder, S.: Fast multiparty threshold ECDSA with fast trustless setup. In: Lie, D., Mannan, M., Backes, M., Wang, X. (eds.) Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, CCS 2018, Toronto, ON, Canada, October 15-19, 2018, pp. 1179\u20131194. ACM (2018). https:\/\/doi.org\/10.1145\/3243734.3243859, https:\/\/doi.org\/10.1145\/3243734.3243859","DOI":"10.1145\/3243734.3243859"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-319-39555-5_9","volume-title":"Applied Cryptography and Network Security","author":"R Gennaro","year":"2016","unstructured":"Gennaro, R., Goldfeder, S., Narayanan, A.: Threshold-Optimal DSA\/ECDSA Signatures and an Application to Bitcoin Wallet Security. In: Manulis, M., Sadeghi, A.-R., Schneider, S. (eds.) ACNS 2016. LNCS, vol. 9696, pp. 156\u2013174. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39555-5_9"},{"key":"10_CR24","doi-asserted-by":"publisher","unstructured":"Gennaro, R., Jarecki, S., Krawczyk, H., Rabin, T.: Secure distributed key generation for discrete-log based cryptosystems. J. Cryptol. 20(1), 51\u201383 (2007). https:\/\/doi.org\/10.1007\/S00145-006-0347-3","DOI":"10.1007\/S00145-006-0347-3"},{"key":"10_CR25","unstructured":"Google: protocol buffers (2025). https:\/\/protobuf.dev\/"},{"key":"10_CR26","unstructured":"Helios: helios voting (2025). https:\/\/vote.heliosvoting.org"},{"key":"10_CR27","unstructured":"Internet assigned numbers authority (IANA): DNSSEC information: root zone operator information (2025). https:\/\/www.iana.org\/dnssec"},{"key":"10_CR28","doi-asserted-by":"publisher","unstructured":"Kho, Y., Heng, S., Chin, J.: A review of cryptographic electronic voting. Symmetry 14(5), 858 (2022). https:\/\/doi.org\/10.3390\/sym14050858","DOI":"10.3390\/sym14050858"},{"key":"10_CR29","doi-asserted-by":"publisher","unstructured":"Komlo, C., Goldberg, I.: FROST: flexible round-optimized schnorr threshold signatures. In: Dunkelman, O., Jr., M.J.J., O\u2019Flynn, C. (eds.) Selected Areas in Cryptography - SAC 2020 - 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12804, pp. 34\u201365. Springer (2020). https:\/\/doi.org\/10.1007\/978-3-030-81652-0_2","DOI":"10.1007\/978-3-030-81652-0_2"},{"key":"10_CR30","doi-asserted-by":"publisher","unstructured":"Lamport, L., Shostak, R.E., Pease, M.C.: The byzantine generals problem. ACM Trans. Program. Lang. Syst. 4(3), 382\u2013401 (1982). https:\/\/doi.org\/10.1145\/357172.357176","DOI":"10.1145\/357172.357176"},{"key":"10_CR31","unstructured":"Lindell, Y.: Digital asset management with MPC (2023). https:\/\/www.coinbase.com\/blog\/digital-asset-management-with-mpc-whitepaper"},{"key":"10_CR32","unstructured":"MIRACL: MIRACL core (2024). https:\/\/github.com\/miracl\/core"},{"key":"10_CR33","unstructured":"National Institute of Standards and Technology (NIST): multi-party threshold cryptography (MPTC) project. https:\/\/csrc.nist.gov\/Projects\/Threshold-Cryptography\/ (2025)"},{"key":"10_CR34","unstructured":"Partisia bockchain: prtisia: solving the blockchain trilemma (2023). https:\/\/partisiablockchain.com"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-46416-6_47","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201991","author":"TP Pedersen","year":"1991","unstructured":"Pedersen, T.P.: A Threshold Cryptosystem without a Trusted Party. In: Davies, D.W. (ed.) EUROCRYPT 1991. LNCS, vol. 547, pp. 522\u2013526. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-46416-6_47"},{"key":"10_CR36","unstructured":"Protocol labs: libp2p: the peer-to-peer network (2024). https:\/\/libp2p.io\/"},{"key":"10_CR37","doi-asserted-by":"publisher","unstructured":"Ruffing, T., Ronge, V., Jin, E., Schneider-Bensch, J., Schr\u00f6der, D.: ROAST: robust asynchronous schnorr threshold signatures. In: Yin, H., Stavrou, A., Cremers, C., Shi, E. (eds.) Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, CCS 2022, Los Angeles, CA, USA, November 7-11, 2022, pp. 2551\u20132564. ACM (2022). https:\/\/doi.org\/10.1145\/3548606.3560583","DOI":"10.1145\/3548606.3560583"},{"key":"10_CR38","doi-asserted-by":"publisher","unstructured":"Schneider, F.B.: Implementing fault-tolerant services using the state machine approach: a tutorial. ACM Comput. Surv. 22(4), 299\u2013319 (1990). https:\/\/doi.org\/10.1145\/98163.98167","DOI":"10.1145\/98163.98167"},{"issue":"3","key":"10_CR39","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/BF00196725","volume":"4","author":"CP Schnorr","year":"1991","unstructured":"Schnorr, C.P.: Efficient signature generation by smart cards. J. Cryptol. 4(3), 161\u2013174 (1991). https:\/\/doi.org\/10.1007\/BF00196725","journal-title":"J. Cryptol."},{"key":"10_CR40","doi-asserted-by":"crossref","unstructured":"von Seck, R., Rezabek, F., Carle, G.: Thresh-hold: assessment of threshold cryptography in leader-based consensus. In: 2024 IEEE 49th Conference on Local Computer Networks (LCN), pp.\u00a01\u20138. IEEE (2024)","DOI":"10.1109\/LCN60385.2024.10639786"},{"key":"10_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/3-540-45539-6_15","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2000","author":"V Shoup","year":"2000","unstructured":"Shoup, V.: Practical Threshold Signatures. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 207\u2013220. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-45539-6_15"},{"key":"10_CR42","doi-asserted-by":"publisher","unstructured":"Shoup, V., Gennaro, R.: Securing threshold cryptosystems against chosen ciphertext attack. J. Cryptol. 15(2), 75\u201396 (2002). https:\/\/doi.org\/10.1007\/s00145-001-0020-9","DOI":"10.1007\/s00145-001-0020-9"},{"key":"10_CR43","doi-asserted-by":"publisher","unstructured":"Xiang, Z., Das, S., Li, Z., Ma, Z., Spiegelman, A.: The latency price of threshold cryptosystem in blockchains. CoRR abs\/2407.12172 (2024). https:\/\/doi.org\/10.48550\/ARXIV.2407.12172","DOI":"10.48550\/ARXIV.2407.12172"},{"key":"10_CR44","doi-asserted-by":"publisher","unstructured":"Zhang, H., Merino, L., Qu, Z., Bastankhah, M., Estrada-Gali\u00f1anes, V., Ford, B.: F3B: a low-overhead blockchain architecture with per-transaction front-running protection. In: Bonneau, J., Weinberg, S.M. (eds.) 5th Conference on Advances in Financial Technologies, AFT 2023, October 23-25, 2023, Princeton, NJ, USA. LIPIcs, vol.\u00a0282, pp. 3:1\u20133:23. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2023). https:\/\/doi.org\/10.4230\/LIPICS.AFT.2023.3","DOI":"10.4230\/LIPICS.AFT.2023.3"}],"container-title":["Communications in Computer and Information Science","Dependable and Secure Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-11539-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T05:13:27Z","timestamp":1770786807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11539-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032115386","9783032115393"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11539-3_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"12 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin-American Symposium on Dependable Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Valpara\u00edso","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","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":"27 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ladc2025a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ladc.sbc.org.br\/2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}