* Canard et al. (2020) Sébastien Canard, Adela Georgescu, Guillaume Kaim, Adeline Langlois, and Jacques Traoré. 2020.  Constant-size lattice-based group signature with forward security in the standard model. In _Provable and Practical Security: 14th International Conference, Singapore, Proceedings 14_. Springer.
  * Canetti (2001) Ran Canetti. 2001.  Universally composable security: A new paradigm for cryptographic protocols. In _Proceedings 42nd IEEE Symposium on Foundations of Computer Science_. IEEE.
  * Canetti et al. (2020) Ran Canetti, Rosario Gennaro, Steven Goldfeder, Nikolaos Makriyannis, and Udi Peled. 2020.  UC non-interactive, proactive, threshold ECDSA with identifiable aborts. In _Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security_.
  * Cao et al. (2022) Yibo Cao, Shiyuan Xu, Xue Chen, Yunhua He, and Shuo Jiang. 2022.  A forward-secure and efficient authentication protocol through lattice-based group signature in VANETs scenarios.  _Computer Networks_ 214 (2022).
  * Cao and Liu (2008) Zhengjun Cao and Mulan Liu. 2008.  Classification of signature-only signature models.  _Science in China Series F: Information Sciences_ (2008).
  * Castagnos et al. (2020) Guilhem Castagnos, Dario Catalano, Fabien L., Federico S., and Ida T. 2020.  Bandwidth-efficient threshold EC-DSA. In _Public-Key Cryptography–PKC: 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings_. Springer.
  * Castagnos et al. (2019) Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, and Ida Tucker. 2019.  Two-party ECDSA from hash proof systems and efficient instantiations. In _Advances in Cryptology–CRYPTO 2019: 39th Annual International Cryptology Conference, Proceedings 39_. Springer.
  * Castagnos et al. (2023) Guilhem Castagnos, Dario Catalano, Fabien Laguillaumie, Federico Savasta, and Ida Tucker. 2023.  Bandwidth-efficient threshold EC-DSA revisited: Online/offline extensions, identifiable aborts proactive and adaptive security.  _Theoretical Computer Science_ (2023).
  * Castagnos and L. (2015) Guilhem Castagnos and Fabien L. 2015.  Linearly homomorphic encryption from. In _Cryptographers’ Track at the RSA Conference_. Springer.
  * Chase et al. (2016) Melissa Chase, Chaya Ganesh, and Payman Mohassel. 2016.  Efficient zero-knowledge proof of algebraic and non-algebraic statements with applications to privacy preserving credentials. In _Advances in Cryptology–CRYPTO 2016: 36th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2016, Proceedings, Part III 36_. Springer.
  * Chaum and Van Heyst (1991) David Chaum and Eugène Van Heyst. 1991.  Group signatures. In _Advances in Cryptology—EUROCRYPT’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8–11, 1991 Proceedings 10_. Springer.
  * Chen et al. (2023a) Lily Chen, Dustin Moody, Karen Randall, Andrew Regenscheid, and Angela Robinson. 2023a.  Recommendations for discrete logarithm-based cryptography: Elliptic curve domain parameters.  (2023).
  * Chen et al. (2023b) Lily Chen, Dustin Moody, Andrew Regenscheid, and Angela Robinson. 2023b.  Digital Signature Standard (DSS).  (2023).
  * Cheon et al. (2023) Jung Hee Cheon, Hyeongmin Choe, Julien Devevey, Tim Güneysu, Dongyeon Hong, Markus Krausz, Georg Land, Junbum Shin, Damien Stehlé, and MinJune Yi. 2023.  Algorithm Specifications and Supporting Documentation.  (2023).
  * Choi and Kim (2014) Rakyong Choi and Kwangjo Kim. 2014.  Lattice-based threshold signature with message block sharing. In _Proc. of The 31st Symposium on Cryptography and Information Security_.
  * Chow et al. (2008) Sherman SM Chow, Joseph K Liu, and Duncan W. 2008.  Robust Receipt-Free Election System with Ballot Secrecy and Verifiability.. In _NDSS_ , Vol. 8.
  * Costello and Longa (2016) Craig Costello and Patrick Longa. 2016.  Schnorrq: Schnorr signatures on fourq.  _MSR Tech Report, 2016_ (2016).
  * Cozzo and Smart (2019) Daniele Cozzo and Nigel P Smart. 2019.  Sharing the LUOV: threshold post-quantum signatures. In _Cryptography and Coding: 17th IMA International Conference, IMACC 2019, Oxford, UK, December 16–18, 2019, Proceedings 17_. Springer.
  * Cramer et al. (2018) Ronald Cramer, Ivan Damgård, Daniel Escudero, Peter Scholl, and Chaoping Xing. 2018.  SPD: efficient MPC mod for dishonest majority. In _Advances in Cryptology–CRYPTO: 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, Proceedings, Part II_. Springer.
  * Cramer et al. (2000) Ronald Cramer, Ivan Damgård, and Ueli M. 2000.  General secure multi-party computation from any linear secret-sharing scheme. In _Advances in Cryptology—EUROCRYPT: International Conference on the Theory and Application of Cryptographic Techniques, Proceedings 19_. Springer.
  * Crites et al. (2023) Elizabeth Crites, Chelsea Komlo, and Mary Maller. 2023.  Fully Adaptive Schnorr Threshold Signatures.  _Cryptology ePrint Archive_ (2023).
  * Dalskov et al. (2020) Anders Dalskov, Claudio Orlandi, Marcel Keller, Kris Shrishak, and Haya S. 2020.  Securing DNSSEC keys via threshold ECDSA from generic MPC. In _Computer Security–ESORICS: 25th European Symposium on Research in Computer Security, ESORICS 2020, Proceedings, Part II 25_. Springer.
  * Damgård and Dupont (2005) Ivan Damgård and Kasper Dupont. 2005.  Efficient Threshold RSA Signatures with General Moduli and No Extra Assumptions.. In _Public Key Cryptography_ , Vol. 3386. Springer.
  * Damgård et al. (2022a) Ivan Damgård, Thomas P Jakobsen, Jesper Buus Nielsen, Jakob Illeborg Pagter, and Michael Bæksvang Østergaard. 2022a.  Fast threshold ECDSA with honest majority.  _Journal of Computer Security_ 30, 1 (2022).
  * Damgård et al. (2012a) Ivan Damgård, Marcel Keller, Enrique Larraia, Christian M., and Nigel Smart. 2012a.  Implementing AES via an actively/covertly secure dishonest-majority MPC protocol. In _Security and Cryptography for Networks: 8th International Conference, Proceedings 8_. Springer.
  * Damgård et al. (2022b) Ivan Damgård, Claudio Orlandi, Akira Takahashi, and Mehdi Tibouchi. 2022b.  Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices.  _Journal of Cryptology_ 35, 2 (2022).
  * Damgård et al. (2012b) Ivan Damgård, Valerio Pastro, Nigel Smart, and Sarah Zakarias. 2012b.  Multiparty computation from somewhat homomorphic encryption. In _Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings_. Springer.
  * del Pino et al. (2023) Rafael del Pino, Thomas Espitau, Shuichi Katsumata, Mary Maller, Fabrice Mouhartem, Thomas Prest, Mélissa Rossi, and Markku-Juhani Saarinen. 2023.  A Side-Channel Secure Signature Scheme.  (2023).
  * Delerablée and Pointcheval (2006) Cécile Delerablée and David Pointcheval. 2006.  Dynamic fully anonymous short group signatures. In _Progress in Cryptology-VIETCRYPT 2006: First International Conference on Cryptology in Vietnam, Hanoi, Vietnam, September 25-28, 2006. Revised Selected Papers_. Springer.
  * Desmedt and Frankel (2001) Yvo Desmedt and Yair Frankel. 2001.  Shared generation of authenticators and signatures. In _Advances in Cryptology—CRYPTO’91: Proceedings_. Springer.
  * Dodis et al. (2004) Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi, and Victor S. 2004.  Anonymous identification in ad hoc groups. In _Advances in Cryptology-EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques, Interlaken, Switzerland, Proceedings 23_. Springer.
  * Doerner et al. (2018) Jack Doerner, Yashvanth Kondi, Eysa Lee, and Abhi Shelat. 2018.  Secure two-party threshold ECDSA from ECDSA assumptions. In _2018 IEEE Symposium on Security and Privacy (SP)_. IEEE.
  * Doerner et al. (2019) Jack Doerner, Yashvanth Kondi, Eysa Lee, and Abhi Shelat. 2019.  Threshold ECDSA from ECDSA assumptions: The multiparty case. In _2019 IEEE Symposium on Security and Privacy (SP)_. IEEE.
  * Dossogne et al. (2013) Jérôme Dossogne, Frédéric Lafitte, and Dirk Van Heule. 2013.  Secure and practical threshold RSA. In _Proceedings of the 6th International Conference on Security of Information and Networks_.
  * Drijvers et al. (2019) Manu Drijvers, Kasra Edalatnejad, Bryan Ford, Eike Kiltz, Julian Loss, Gregory Neven, and Igors Stepanovs. 2019.  On the security of two-round multi-signatures. In _2019 IEEE Symposium on Security and Privacy (SP)_. IEEE.
  * Drijvers et al. (2020) Manu Drijvers, Sergey Gorbunov, Gregory Neven, and Hoeteck Wee. 2020.  Pixel: Multi-signatures for consensus. In _29th USENIX Security Symposium (USENIX Security 20)_.
  * Ducas et al. (2013) Léo Ducas, Alain Durmus, Tancrède Lepoint, and Vadim Lyubashevsky. 2013.  Lattice signatures and bimodal Gaussians. In _Advances in Cryptology–CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I_. Springer.
  * Ducas et al. (2018) Léo Ducas, Eike Kiltz, Tancrede Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehlé. 2018.  Crystals-dilithium: A lattice-based digital signature scheme.  _IACR Transactions on Cryptographic Hardware and Embedded Systems_ (2018).
  * Ducas et al. (2014) Léo Ducas, Vadim Lyubashevsky, and Thomas P. 2014.  Efficient identity-based encryption over NTRU lattices. In _Advances in Cryptology: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Proceedings, Part II_. Springer.
  * Dwork et al. (2004) Cynthia Dwork, Moni Naor, and Amit Sahai. 2004.  Concurrent zero-knowledge.  _Journal of the ACM (JACM)_ 51, 6 (2004).
  * El Bansarkhani and Sturm (2016) Rachid El Bansarkhani and Jan Sturm. 2016.  An efficient lattice-based multisignature scheme with applications to bitcoins. In _Cryptology and Network Security: 15th International Conference, CANS 2016, Milan, Italy, November 14-16, 2016, Proceedings 15_. Springer.
  * Ergezer et al. (2020) Sinan Ergezer, Holger Kinkelin, and Filip Rezabek. 2020.  A Survey on Threshold Signature Schemes.  _Network_ 49 (2020).
  * Esgin et al. (2019a) Muhammed F Esgin, Ron Steinfeld, Amin Sakzad, Joseph K Liu, and Dongxi Liu. 2019a.  Short lattice-based one-out-of-many proofs and applications to ring signatures. In _Applied Cryptography and Network Security: 17th International Conference, Bogota, Colombia, Proceedings 17_. Springer.
  * Esgin et al. (2022) Muhammed F Esgin, Ron Steinfeld, and Raymond K Zhao. 2022.  MatRiCT+: More efficient post-quantum private blockchain payments. In _2022 IEEE Symposium on Security and Privacy (SP)_. IEEE.
  * Esgin et al. (2019b) Muhammed F Esgin, Raymond K Zhao, Ron Steinfeld, Joseph K Liu, and Dongxi Liu. 2019b.  MatRiCT: efficient, scalable and post-quantum blockchain confidential transactions protocol. In _Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security_.
  * Espitau et al. (2023) Thomas Espitau, Guilhem Niot, Chao Sun, and Mehdi Tibouchi. 2023.  Square Unstructured Integer Euclidean Lattice Signature.  (2023).
  * ETSI (2020) ETSI. 2020.  _CYBER; Quantum-safe Hybrid Key Exchanges_.  Technical Report V1.1.1. ETSI.  Technical Specification.
  * Fang et al. (2020) Weidong Fang, Wei Chen, Wuxiong Zhang, Jun Pei, Weiwei Gao, and Guohui Wang. 2020.  Digital signature scheme for information non-repudiation in blockchain: a state of the art review.  _EURASIP Journal on Wireless Communications and Networking_ 2020, 1 (2020).
  * Feldman (1987) Paul Feldman. 1987.  A practical scheme for non-interactive verifiable secret sharing. In _28th Annual Symposium on Foundations of Computer Science (sfcs 1987)_. IEEE.
  * Feng and Yang (2022) Dengguo Feng and Kang Yang. 2022.  Concretely efficient secure multi-party computation protocols: survey and more.  _Security and Safety_ 1 (2022), 2021001.
  * Feng et al. (2020) Qi Feng, Debiao He, Min Luo, Zengxiang Li, and Kim-Kwang Raymond Choo. 2020.  Practical secure two-party EdDSA signature generation with key protection and applications in cryptocurrency. In _2020 IEEE 19th International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom)_. IEEE.
  * Feng et al. (2023) Qi Feng, Kang Yang, Mimi Ma, and Debiao He. 2023.  Efficient Multi-Party EdDSA Signature With Identifiable Aborts and its Applications to Blockchain.  _IEEE Transactions on Information Forensics and Security_ 18 (2023).
  * Fiat and Shamir (1986) Amos Fiat and Adi Shamir. 1986.  How to prove yourself: Practical solutions to identification and signature problems. In _Conference on the theory and application of cryptographic techniques_. Springer.
  * Fouque et al. (2019) PA Fouque, J Hoffstein, P Kirchner, V Lyubashevsky, T Pornin, T Prest, T Ricosset, G Seiler, W Whyte, and Z Zhang. 2019.  Fast-fourier lattice-based compact signatures over NTRU.
  * Fouque et al. (2018) Pierre-Alain Fouque, Jeffrey Hoffstein, Paul Kirchner, Vadim Lyubashevsky, Thomas Pornin, Thomas Prest, Thomas Ricosset, Gregor Seiler, William Whyte, Zhenfei Zhang, et al. 2018\.  Falcon: Fast-Fourier lattice-based compact signatures over NTRU.  _Submission to the NIST’s post-quantum cryptography standardization process_ 36, 5 (2018).
  * Franklin and Yung (1992) Matthew Franklin and Moti Yung. 1992.  Communication complexity of secure computation. In _Proceedings of the twenty-fourth annual ACM symposium on Theory of computing_.
  * Frey and Rück (1994) Gerhard Frey and Hans-Georg Rück. 1994.  A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves.  _Mathematics of computation_ 62, 206 (1994).
  * Galbraith et al. (2002) Steven D Galbraith, Keith Harrison, and David Soldera. 2002.  Implementing the Tate pairing. In _Algorithmic Number Theory: 5th International Symposium, ANTS-V Sydney, Australia, July 7–12, 2002 Proceedings 5_. Springer.
  * Garg et al. (2023) Sanjam Garg, Abhishek Jain, Pratyay Mukherjee, Rohit Sinha, Mingyuan Wang, and Yinuo Zhang. 2023.  hinTS: Threshold Signatures with Silent Setup.  _Cryptology ePrint Archive_ (2023).
  * Garillot et al. (2021) François Garillot, Yashvanth Kondi, Payman Mohassel, and Valeria Nikolaenko. 2021.  Threshold schnorr with stateless deterministic signing from standard assumptions. In _Advances in Cryptology–CRYPTO: 41st Annual International Cryptology Conference, Proceedings, Part I 41_. Springer.
  * Gennaro and Goldfeder (2018) Rosario Gennaro and Steven Goldfeder. 2018.  Fast multiparty threshold ECDSA with fast trustless setup. In _Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security_.
  * Gennaro and Goldfeder (2020) Rosario Gennaro and Steven Goldfeder. 2020.  One round threshold ECDSA with identifiable abort.  _Cryptology ePrint Archive_ (2020).
  * Gennaro et al. (2016) Rosario Gennaro, Steven Goldfeder, and Arvind Narayanan. 2016.  Threshold-optimal DSA/ECDSA signatures and an application to bitcoin wallet security. In _Applied Cryptography and Network Security: 14th International Conference, ACNS 2016, Guildford, UK, Proceedings 14_. Springer.
  * Gennaro et al. (2008) Rosario Gennaro, Shai Halevi, Hugo K., and Tal Rab. 2008.  Threshold RSA for dynamic and ad-hoc groups. In _Advances in Cryptology–EUROCRYPT 2008: 27th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Istanbul, Turkey, Proceedings 27_. Springer.
  * Gennaro et al. (2003) Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. 2003.  Secure applications of Pedersen’s distributed key generation protocol. In _CT-RSA_ , Vol. 3. Springer.
  * Gennaro et al. (2007) Rosario Gennaro, Stanislaw Jarecki, Hugo Krawczyk, and Tal Rabin. 2007.  Secure distributed key generation for discrete-log based cryptosystems.  _Journal of Cryptology_ 20 (2007).
  * Gentry et al. (2008) Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan. 2008.  Trapdoors for hard lattices and new cryptographic constructions. In _Proceedings of the fortieth annual ACM symposium on Theory of computing_.
  * Ghodosi and Pieprzyk (2006) Hossein Ghodosi and Josef Pieprzyk. 2006.  An ideal and robust threshold RSA.  _Lecture notes in computer science_ 4341 (2006).
  * Gilboa (1999) Niv Gilboa. 1999.  Two party RSA key generation. In _Annual International Cryptology Conference_. Springer.
  * Goldfeder et al. (2014) Steven Goldfeder, Joseph Bonneau, JA Kroll, and EW Felten. 2014.  Securing bitcoin wallets via threshold signatures.  (2014).
  * Goldfeder et al. (2015) Steven Goldfeder, Rosario Gennaro, Harry Kalodner, Joseph Bonneau, Joshua A Kroll, Edward W Felten, and Arvind Narayanan. 2015.  Securing Bitcoin wallets via a new DSA/ECDSA threshold signature scheme.  In _et al._
  * Goldreich et al. (2019) Oded Goldreich, Silvio Micali, and Avi Wigderson. 2019.  How to play any mental game, or a completeness theorem for protocols with honest majority.  In _Providing Sound Foundations for Cryptography: On the Work of Shafi Goldwasser and Silvio Micali_.
  * Goldschlag and Stubblebine (1998) David M Goldschlag and Stuart G Stubblebine. 1998.  Publicly verifiable lotteries: Applications of delaying functions. In _International Conference on Financial Cryptography_. Springer.
  * Gong et al. (2021) Bei Gong, Xinyi Zhang, Yang Cao, Zheng Li, Jia Yang, and Wei Wang. 2021.  A threshold group signature scheme suitable for the Internet of Things.  _Concurrency and Computation: Practice and Experience_ 33, 13 (2021).
  * Gordon et al. (2010) S Dov Gordon, Jonathan Katz, and Vinod V. 2010.  A group signature scheme from lattice assumptions. In _Advances in Cryptology-ASIACRYPT 2010: 16th International Conference on the Theory and Application of Cryptology and Information Security, Singapore, Proceedings 16_. Springer.
  * Grissa et al. (2015) Mohamed Grissa, Attila Yavuz, and Bechir Hamdaoui. 2015.  LPOS: Location Privacy for Optimal Sensing in Cognitive Radio Networks. In _2015 IEEE Global Communications Conference (GLOBECOM)_. 1–6.  https://doi.org/10.1109/GLOCOM.2015.7417611
  * Grissa et al. (2019) Mohamed Grissa, Attila A Yavuz, and Bechir Hamdaoui. 2019.  TrustSAS: A trustworthy spectrum access system for the 3.5 GHz CBRS band. In _IEEE INFOCOM 2019-IEEE Conference on Computer Communications_. IEEE.
  * Groth (2007) Jens Groth. 2007.  Fully anonymous group signatures without random oracles. In _Advances in Cryptology–ASIACRYPT 2007: 13th International Conference on the Theory and Application of Cryptology and Information Security, Kuching, Malaysia, December 2-6, 2007. Proceedings 13_. Springer.
  * Group et al. (2020) Joint Task Force Interagency Working Group et al. 2020\.  Security and privacy controls for information systems and organizations.  _National Institute of Standards and Technology_ (2020).
  * Güneysu et al. (2012) Tim Güneysu, Vadim Lyubashevsky, and Thomas Pöppelmann. 2012.  Practical lattice-based cryptography: A signature scheme for embedded systems. In _Cryptographic Hardware and Embedded Systems–CHES 2012: 14th International Workshop, Leuven, Belgium, Proceedings 14_. Springer.
  * Guo et al. (2021) Lifeng Guo, Qianli Wang, and Wei-Chuen Yau. 2021.  Online/offline rewritable blockchain with auditable outsourced computation.  _IEEE Transactions on Cloud Computing_ (2021).
  * Guo and Cheng (2022) Ren Guo and Xiaogang Cheng. 2022.  Cryptanalysis and improvement of a (t, n) threshold group signature scheme.  _Quantum Information Processing_ 21, 1 (2022), 37.
  * Halevi and Kalai (2012) Shai Halevi and Yael Tauman Kalai. 2012.  Smooth projective hashing and two-message oblivious transfer.  _Journal of Cryptology_ 25, 1 (2012).
  * Hanke et al. (2018) Timo Hanke, Mahnush Movahedi, and Dominic Williams. 2018.  Dfinity technology overview series, consensus system.  _arXiv preprint arXiv:1805.04548_ (2018).
  * Hastings et al. (2019) Marcella Hastings, Brett Hemenway, Daniel Noble, and Steve Zdancewic. 2019.  Sok: General purpose compilers for secure multi-party computation. In _2019 IEEE symposium on security and privacy (SP)_. IEEE.
  * Hazay et al. (2020) Carmit Hazay, Peter S., and Eduardo V. 2020.  Low cost constant round MPC combining BMR and oblivious transfer.  _Journal of Cryptology_ (2020).
  * Herzberg et al. (1997) Amir Herzberg, Markus Jakobsson, Stanislław Jarecki, Hugo Krawczyk, and Moti Yung. 1997.  Proactive public key and signature systems. In _Proceedings of the 4th ACM Conference on Computer and Communications Security_.
  * Hirt and Nielsen (2006) Martin Hirt and Jesper Buus Nielsen. 2006.  Robust multiparty computation with linear communication complexity. In _Advances in Cryptology-CRYPTO 2006: 26th Annual International Cryptology Conference, Proceedings 26_. Springer.
  * Horster et al. (1994) Patrick Horster, Holger Petersen, and Markus Michels. 1994.  Meta-ElGamal signature schemes. In _Proceedings of the 2nd ACM Conference on Computer and Communications Security_.
  * Huang et al. (2021) Ke Huang, Yi Mu, Fatemeh Rezaeibagha, Zheyuan He, and Xiaosong Zhang. 2021.  BA2P: bidirectional and anonymous auction protocol with dispute-freeness.  _Security and Communication Networks_ 2021 (2021).
  * Huang et al. (2014) Xinyi Huang, Joseph K Liu, Shaohua Tang, Yang Xiang, Kaitai Liang, Li Xu, and Jianying Zhou. 2014.  Cost-effective authentic and anonymous data sharing with forward security.  _IEEE Transactions on computers_ 64, 4 (2014).
  * Huang et al. (2012) Yan Huang, David Evans, and Jonathan Katz. 2012.  Private set intersection: Are garbled circuits better than custom protocols?. In _NDSS_.
  * Itakura (1983) Kazuharu Itakura. 1983.  A public-key cryptosystem suitable for digital multisignatures.  _NEC J. Res. Dev._ 71 (1983).
  * Jawurek et al. (2013) Marek Jawurek, Florian Kerschbaum, and Claudio Orlandi. 2013.  Zero-knowledge using garbled circuits: how to prove non-algebraic statements efficiently. In _Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security_.
  * Jonsson and Kaliski (2003) Jakob Jonsson and Burt Kaliski. 2003.  _Public-key cryptography standards (PKCS)# 1: RSA cryptography specifications version 2.1_.  Technical Report.
  * Josefsson and Liusvaara (2017) Simon Josefsson and Ilari Liusvaara. 2017.  _Edwards-curve digital signature algorithm (EdDSA)_.  Technical Report.
  * Joshi et al. (2022) Snehil Joshi, Durgesh Pandey, and Kannan Srinathan. 2022.  ATSSIA: Asynchronous truly-threshold Schnorr signing for inconsistent availability. In _Information Security and Cryptology–ICISC 2021: 24th International Conference, Seoul, South Korea, December 1–3, 2021, Revised Selected Papers_. Springer.
  * Joux (2000) Antoine Joux. 2000.  A one round protocol for tripartite Diffie–Hellman. In _Algorithmic Number Theory: 4th International Symposium, ANTS-IV Leiden, The Netherlands, July 2-7, 2000. Proceedings 4_. Springer.
  * Kansal et al. (2020) Meenakshi Kansal, Ratna Dutta, and Sourav Mukhopadhyay. 2020.  Group signature from lattices preserving forward security in dynamic setting.  _Advances in Mathematics of Communications_ 14, 4 (2020).
  * Kara et al. (2023) Mostefa Kara, Abdelkader Laouid, and Mohammad Ha. 2023.  An efficient multi-signature scheme for blockchain.  _Cryptology ePrint Archive_ (2023).
  * Katz et al. (2018) Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. 2018.  Improved non-interactive zero knowledge with applications to post-quantum signatures. In _Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security_.
  * Keller (2020) Marcel Keller. 2020.  MP-SPDZ: A versatile framework for multi-party computation. In _Proceedings of the 2020 ACM SIGSAC conference on computer and communications security_.
  * Keller and Yanai (2018) Marcel Keller and Avishay Yanai. 2018.  Efficient maliciously secure multiparty computation for RAM. In _Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part III_. Springer.
  * Kiayias and Yung (2005) Aggelos Kiayias and Moti Yung. 2005.  Group signatures with efficient concurrent join. In _Advances in Cryptology–EUROCRYPT 2005: 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings 24_. Springer.
  * Kiltz et al. (2018) Eike Kiltz, Vadim Lyubashevsky, and Christian Schaffner. 2018.  A concrete treatment of Fiat-Shamir signatures in the quantum random-oracle model. In _Advances in Cryptology–EUROCRYPT 2018: 37th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Tel Aviv, Israel, April 29-May 3, 2018 Proceedings, Part III 37_. Springer.
  * Kolesnikov (2005) Vladimir Kolesnikov. 2005.  Gate evaluation secret sharing and secure one-round two-party computation. In _Advances in Cryptology-ASIACRYPT 2005: 11th International Conference on the Theory and Application of Cryptology and Information Security, Chennai, India, Proceedings 11_. Springer.
  * Kolesnikov and Schneider (2008) Vladimir Kolesnikov and Thomas Schneider. 2008.  Improved garbled circuit: Free XOR gates and applications. In _Automata, Languages and Programming: 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II 35_. Springer.
  * Komlo and Goldberg (2021) Chelsea Komlo and Ian Goldberg. 2021.  FROST: flexible round-optimized Schnorr threshold signatures. In _Selected Areas in Cryptography: 27th International Conference, Halifax, NS, Canada (Virtual Event), October 21-23, 2020, Revised Selected Papers 27_. Springer.
  * Kondi et al. (2023) Yashvanth Kondi, Claudio Orlandi, and Lawrence Roy. 2023.  Two-Round Stateless Deterministic Two-Party Schnorr Signatures From Pseudorandom Correlation Functions.  _Cryptology ePrint Archive_ (2023).
  * Kurt et al. (2021) Ahmet Kurt, Suat Mercan, Omer Shlomovits, Enes Erdin, and et al. 2021.  Lngate: Powering iot with next generation lightning micro-payments using threshold cryptography. In _Proceedings of the 14th ACM Conference on Security and Privacy in Wireless and Mobile Networks_.
  * Kushilevitz and Rabin (2001) Eyal Kushilevitz and Tal Rabin. 2001.  Fair e-lotteries and e-casinos. In _Topics in Cryptology—CT-RSA 2001: The Cryptographers’ Track at RSA Conference 2001 San Francisco, CA, USA, April 8–12, 2001 Proceedings_. Springer.
  * KZen (2021) Team KZen. 2021.  Bitcoin Wallet Powered by Two-Party ECDSA-Extended Abstract.  _Retrieved March_ (2021).
  * Larraia et al. (2014) Enrique Larraia, Emmanuela Orsini, and Nigel P Smart. 2014.  Dishonest majority multi-party computation for binary circuits. In _Advances in Cryptology–CRYPTO 2014: 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part II 34_. Springer.
  * Li et al. (2018) Lun Li, Jiqiang Liu, Lichen Cheng, Shuo Qiu, Wei Wang, Xi. Zhang, and Zonghua Zhang. 2018.  Creditcoin: A privacy-preserving blockchain-based incentive announcement network for communications of smart vehicles.  _IEEE Transactions on Intelligent Transportation Systems_ 19, 7 (2018).
  * Li et al. (2021a) Peng Li, Junzuo Lai, and Yongdong Wu. 2021a.  Event-oriented linkable and traceable anonymous authentication and its application to voting.  _Journal of Information Security and Applications_ 60 (2021).
  * Li et al. (2021b) Yahong Li, Jianzhou Wei, Bin Wu, Chunli Wang, Caifen Wang, Yulei Zhang, and Xiaodong Yang. 2021b.  Obfuscating encrypted threshold signature algorithm and its applications in cloud computing.  _Plos one_ 16, 4 (2021).
  * Lindell (2017) Yehuda Lindell. 2017.  Fast secure two-party ECDSA signing. In _Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20–24, 2017, Proceedings, Part II 37_. Springer.
  * Lindell (2020) Yehuda Lindell. 2020.  Secure multiparty computation (MPC).  _Cryptology ePrint Archive_ (2020).
  * Lindell (2022) Yehuda Lindell. 2022.  Simple three-round multiparty Schnorr signing with full simulatability.  _Cryptology ePrint Archive_ (2022).
  * Lindell and Nof (2018) Yehuda Lindell and Ariel Nof. 2018.  Fast secure multiparty ECDSA with practical distributed key generation and applications to cryptocurrency custody. In _Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security_.
  * Liu et al. (2023) Han Liu, Dezhi Han, Mingming Cui, Kuan-Ching Li, Alireza Souri, and Mohammad Shojafar. 2023.  IdenMultiSig: identity-based decentralized multi-signature in internet of things.  _IEEE Transactions on Computational Social Systems_ (2023).
  * Liu et al. (2020) Yizhong Liu, Jianwei Liu, Qianhong Wu, Hui Yu, Yiming Hei, and Ziyu Zhou. 2020.  SSHC: A secure and scalable hybrid consensus protocol for sharding blockchains with a formal security framework.  _IEEE Transactions on Dependable and Secure Computing_ 19, 3 (2020).
  * Lu et al. (2018) Xianhui Lu, Yamin Liu, Zhenfei Zhang, Dingding Jia, Haiyang Xue, Jingnan He, Bao Li, and Kunpeng Wang. 2018.  LAC: Practical ring-LWE based public-key encryption with byte-level modulus.  _Cryptology ePrint Archive_ (2018).
  * Lyubashevsky (2009) Vadim Lyubashevsky. 2009.  Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In _Advances in Cryptology–ASIACRYPT 2009: 15th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings 15_. Springer.
  * Lyubashevsky (2012) Vadim Lyubashevsky. 2012.  Lattice signatures without trapdoors. In _Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Cambridge, UK, April 15-19, 2012. Proceedings 31_. Springer.
  * Lyubashevsky et al. (2021) Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2021.  SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions. In _Advances in Cryptology–CRYPTO: 41st Annual International Cryptology, Proceedings, Part II_. Springer.
  * Lyubashevsky et al. (2010) Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010.  On ideal lattices and learning with errors over rings. In _Advances in Cryptology–EUROCRYPT: 29th International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings 29_. Springer.
  * Ma and Jiang (2019) Changshe Ma and Mei Jiang. 2019.  Practical lattice-based multisignature schemes for blockchains.  _IEEE Access_ 7 (2019).
  * Malina et al. (2018) Lukas Malina, Jan Hajny, Petr D., and Sara R. 2018.  Lightweight Ring Signatures for Decentralized Privacy-preserving Transactions.. In _ICETE (2)_.
  * Manna et al. (2021) Michele La Manna, Pericle Perazzo, Luigi Treccozzi, and Gianluca Dini. 2021.  Assessing the Cost of Quantum Security for Automotive Over -The-Air Updates. In _2021 IEEE Symposium on Computers and Communications (ISCC)_. 1–6.  https://doi.org/10.1109/ISCC53001.2021.9631426
  * Marcedone and Orlandi (2014) Antonio Marcedone and Claudio Orlandi. 2014.  Obfuscation IND-CPA Security Circular Security. In _Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings 9_. Springer.
  * Maxwell et al. (2019) Gregory Maxwell, Andrew Poelstra, Yannick Seurin, and Pieter Wuille. 2019.  Simple schnorr multi-signatures with applications to bitcoin.  _Designs, Codes and Cryptography_ 87, 9 (2019).
  * Mayer (2016) Hartwig Mayer. 2016.  ECDSA security in bitcoin and ethereum: a research survey.  _CoinFaabrik, June_ 28, 126 (2016), 50.
  * Meier (2022) Lúcás Críostóir Meier. 2022.  MPC for Group Reconstruction Circuits.  _Cryptology ePrint Archive_ (2022).
  * Menezes et al. (1991) Alfred Menezes, Scott Vanstone, and Tatsuaki Okamoto. 1991.  Reducing elliptic curve logarithms to logarithms in a finite field. In _Proceedings of the twenty-third annual ACM symposium on Theory of computing_.
  * Mi et al. (2020) Bo Mi, Yang Li, Huang Darong, Tiancheng Wei, and Qianqian Zou. 2020.  Secure data de-duplication based on threshold blind signature and bloom filter in internet of things.  _IEEE Access_ 8 (2020).
  * Micali et al. (2001) Silvio Micali, Kazuo Ohta, and Leonid Reyzin. 2001.  Accountable-subgroup multisignatures. In _Proceedings of the 8th ACM Conference on Computer and Communications Security_.
  * Micciancio and Peikert (2012) Daniele Micciancio and Chris Peikert. 2012.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller.. In _Eurocrypt_ , Vol. 7237. Springer.
  * Mohassel et al. (2015) Payman Mohassel, Mike Rosulek, and Ye Zhang. 2015.  Fast and secure three-party computation: The garbled circuit approach. In _Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security_.
  * Moriarty et al. (2016) Kathleen Moriarty, Burt Kaliski, Jakob Jonsson, and Andreas Rusch. 2016.  _PKCS# 1: RSA cryptography specifications version 2.2_.  Technical Report.
  * Munch-Hansen et al. (2021) Alexander Munch-Hansen, Claudio Orlandi, and Sophia Yakoubov. 2021.  Stronger notions and a more efficient construction of threshold ring signatures. In _International Conference on Cryptology and Information Security in Latin America_. Springer, 363–381.
  * Nagar and Sethia (2017) Preeti Nagar and Divyashikha Sethia. 2017.  Group authorization using threshold signatures for medical procedures. In _2017 9th International Conference on Communication Systems and Networks (COMSNETS)_. IEEE.
  * Nakamoto (2008) Satoshi Nakamoto. 2008.  Bitcoin: A peer-to-peer electronic cash system.  _Decentralized business review_ (2008).
  * Nakamoto and Bitcoin (2008) Satoshi Nakamoto and A Bitcoin. 2008.  A peer-to-peer electronic cash system.  _Bitcoin.–URL: https://bitcoin. org/bitcoin. pdf_ 4, 2 (2008), 15.
  * Naor (2002) Moni Naor. 2002.  Deniable ring authentication. In _Advances in Cryptology—CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings 22_. Springer.
  * Nguyen and Safavi-Naini (2004) Lan Nguyen and Rei Safavi-Naini. 2004.  Efficient and provably secure trapdoor-free group signature schemes from bilinear pairings. In _Advances in Cryptology: 10th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings 10_. Springer.
  * Nick et al. (2021) Jonas Nick, Tim Ruffing, and Yannick Seurin. 2021.  MuSig2: simple two-round Schnorr multi-signatures. In _Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I_. Springer.
  * Nick et al. (2020) Jonas Nick, Tim Ruffing, Yannick Seurin, and Pieter Wuille. 2020.  MuSig-DN: Schnorr multi-signatures with verifiably deterministic nonces. In _Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security_.
  * Nielsen et al. (2012) Jesper Buus Nielsen, Peter Sebastian Nordholt, Claudio Orlandi, and Sai Sheshank Burra. 2012.  A new approach to practical active-secure two-party computation. In _Advances in Cryptology–CRYPTO 2012: 32nd Annual Cryptology Conference, Santa Barbara, CA, USA., Proceedings_. Springer.
  * NIST (2016) NIST. 2016.  Call for Proposals - Post-Quantum Cryptography — csrc.nist.gov.  https://csrc.nist.gov/Projects/post-quantum-cryptography/post-quantum-cryptography-standardization/Call-for-Proposals.  [Accessed 15-10-2023].
  * NIST (2022) NIST. 2022.  Selected Algorithms 2022 - Post-Quantum Cryptography — csrc.nist.gov.  https://csrc.nist.gov/Projects/post-quantum-cryptography/selected-algorithms-2022.  [Accessed 15-10-2023].
  * Nouma and Yavuz (2023) Saif E. Nouma and Attila A. Yavuz. 2023.  Practical Cryptographic Forensic Tools for Lightweight Internet of Things and Cold Storage Systems _(IoTDI ’23)_. Association for Computing Machinery, New York, NY, USA, 340–353.  https://doi.org/10.1145/3576842.3582376
  * Okamoto et al. (2018) Takeshi Okamoto, Raylin Tso, Michitomo Yamaguchi, and Eiji Okamoto. 2018.  A $k$-out-of-$n$ Ring Signature with Flexible Participation for Signers.  _Cryptology ePrint Archive_ (2018).
  * Orlandi et al. (2021) Claudio Orlandi, Peter S., and Sophia Y. 2021.  The rise of paillier: Homomorphic secret sharing and public-key silent OT. In _Advances in Cryptology: 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings, Part I_. Springer.
  * Orsini (2021) Emmanuela Orsini. 2021.  Efficient, actively secure MPC with a dishonest majority: a survey. In _Arithmetic of Finite Fields: 8th International Workshop, WAIFI 2020, Rennes, France, July 6–8, 2020, Revised Selected and Invited Papers 8_. Springer, 42–71.
  * Ozmen et al. (2019a) Muslum Ozgur Ozmen, Rouzbeh Behnia, and Attila A Yavuz. 2019a.  Fast authentication from aggregate signatures with improved security. In _Financial Cryptography and Data Security: 23rd International Conference, FC 2019, Frigate Bay, St. Kitts and Nevis, Revised Selected Papers_. Springer.
  * Ozmen et al. (2019b) Muslum Ozgur Ozmen, Attila A Yavuz, and Rouzbeh Behnia. 2019b.  Energy-aware digital signatures for embedded medical devices. In _2019 IEEE Conference on Communications and Network Security (CNS)_. IEEE.
  * Pan et al. (2022) Shimin Pan, Kwan Yin Chan, Handong Cui, and Tsz Hon Yuen. 2022.  Multi-signatures for ECDSA and Its Applications in Blockchain. In _Australasian Conference on Information Security and Privacy_. Springer.
  * Parno et al. (2011) Bryan Parno, Jacob R Lorch, John R Douceur, James Mickens, and Jonathan M McCune. 2011.  Memoir: Practical state continuity for protected modules. In _2011 IEEE Symposium on Security and Privacy_. IEEE.
  * Perera et al. (2022) Maharage Nisansala Sevwandi Perera, Toru Nakamura, Masayuki Hashimoto, Hiroyuki Yokoyama, Chen-Mou Cheng, and Kouichi Sakurai. 2022.  A survey on group signatures and ring signatures: traceability vs. anonymity.  _Cryptography_ 6, 1 (2022).
  * Pilaram and Eghlidos (2015) Hossein Pilaram and Taraneh Eghlidos. 2015.  An efficient lattice based multi-stage secret sharing scheme.  _IEEE Transactions on Dependable and Secure Computing_ 14, 1 (2015).
  * Pilaram et al. (2021) Hossein Pilaram, Taraneh Eghlidos, and Rahim Toluee. 2021.  An efficient lattice-based threshold signature scheme using multi-stage secret sharing.  _IET Information Security_ 15, 1 (2021).
  * Pino et al. (2016) Rafael Pino, Vadim Lyubashevsky, and David Pointcheval. 2016.  The whole is less than the sum of its parts: Constructing more efficient lattice-based AKEs. In _Security and Cryptography for Networks: 10th International Conference, SCN 2016, Amalfi, Italy, Proceedings_. Springer.
  * Pornin (2013) Thomas Pornin. 2013.  _Deterministic usage of the digital signature algorithm (DSA) and elliptic curve digital signature algorithm (ECDSA)_.  Technical Report.
  * Qiao et al. (2020) Rui Qiao, Xiang-Yang Luo, Si-Feng Zhu, Ao-Di Liu, Xin-Qing Yan, and Qing-Xian Wang. 2020.  Dynamic autonomous cross consortium chain mechanism in e-healthcare.  _IEEE journal of biomedical and health informatics_ 24, 8 (2020).
  * Rabin (1983) Michael O Rabin. 1983.  Randomized byzantine generals. In _24th annual symposium on foundations of computer science (sfcs 1983)_. IEEE.
  * Rabin (1998) Tal Rabin. 1998.  A simplified approach to threshold and proactive RSA. In _Advances in Cryptology—CRYPTO’98: 18th Annual International Cryptology Conference Santa Barbara, California, USA August 23–27, 1998 Proceedings 18_. Springer.
  * Rinaldi et al. (2020) Federica Rinaldi, Helka-Liina Maattanen, Johan Torsner, Sara Pizzi, Sergey Andreev, Antonio Iera, Yevgeni Koucheryavy, and Giuseppe Araniti. 2020.  Non-Terrestrial Networks in 5G & Beyond: A Survey.  _IEEE Access_ 8 (2020), 165178–165200.  https://doi.org/10.1109/ACCESS.2020.3022981
  * Rivest et al. (2001) Ronald L Rivest, Adi Shamir, and Yael Tauman. 2001.  How to leak a secret. In _Advances in Cryptology—ASIACRYPT 2001: 7th International Conference on the Theory and Application of Cryptology and Information Security Gold Coast, 2001 Proceedings 7_. Springer.
  * Rotaru and Wood (2019) Dragos Rotaru and Tim Wood. 2019.  Marbled circuits: Mixing arithmetic and boolean circuits with active security. In _Progress in Cryptology–INDOCRYPT: 20th International Conference on Cryptology in India, Hyderabad, India, Proceedings_. Springer.
  * Roy (2022) Lawrence Roy. 2022.  SoftSpokenOT: Communication–Computation Tradeoffs in OT Extension.  _Cryptology ePrint Archive_ (2022).
  * Ruffing et al. (2022) Tim Ruffing, Viktoria Ronge, Elliott Jin, Jonas Schneider-Bensch, and Dominique Schröder. 2022.  ROAST: Robust Asynchronous Schnorr Threshold Signatures.  _IACR Cryptol. ePrint Arch._ 2022 (2022).
  * Şahin and Akleylek (2022) Meryem Soysaldı Şahin and Sedat Akleylek. 2022.  A constant-size lattice-based partially-dynamic group signature scheme in quantum random oracle model.  _Journal of King Saud University-Computer and Information Sciences_ 34, 10 (2022).
  * Şahin and Akleylek (2023) Meryem Soysaldı Şahin and Sedat Akleylek. 2023.  A survey of quantum secure group signature schemes: Lattice-based approach.  _Journal of Information Security and Applications_ 73 (2023).
  * Santiago et al. (2021) Carlos Santiago, Sh. Ren, Ch. Lee, and M. Ryu. 2021.  Concordia: a streamlined consensus protocol for blockchain networks.  _IEEE Access_ (2021).
  * Saxena et al. (2005) Nitesh Saxena, Gene Tsudik, and Jeong Hyun Yi. 2005.  Efficient node admission for short-lived mobile ad hoc networks. In _13TH IEEE International Conference on Network Protocols (ICNP’05)_. IEEE.
  * Schnorr (1990) Claus-Peter Schnorr. 1990.  Efficient identification and signatures for smart cards. In _Advances in Cryptology—CRYPTO’89 Proceedings 9_. Springer.
  * Shamir (1979) Adi Shamir. 1979.  How to share a secret.  _Commun. ACM_ 22, 11 (1979).
  * Shi et al. (2022) Yang Shi, Junqing Liang, Mianhong Li, Tianchen Ma, Guodong Ye, Jiangfeng Li, and Q. Zhao. 2022.  Threshold EdDSA Signature for Blockchain-based Decentralized Finance Applications. In _Proceedings of the 25th International Symposium on Research in Attacks, Intrusions and Defenses_.
  * Shor (1999) Peter W Shor. 1999.  Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer.  _SIAM review_ 41, 2 (1999).
  * Shoup (2000) Victor Shoup. 2000.  Practical threshold signatures. In _Advances in Cryptology—EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques Bruges, Belgium, May 14–18, 2000 Proceedings 19_. Springer.
  * Sliti et al. (2008) Maha Sliti, Mohamed Hamdi, and Noureddine Boudriga. 2008.  An elliptic threshold signature framework for k-security in wireless sensor networks. In _2008 15th IEEE International Conference on Electronics, Circuits and Systems_. IEEE.
  * Smart and Talibi (2019) Nigel Smart and Younes Talibi. 2019.  Distributing any elliptic curve based protocol. In _IMA International Conference on Cryptography and Coding_. Springer.
  * Smart and Wood (2019) Nigel P Smart and Tim Wood. 2019.  Error detection in monotone span programs with application to communication-efficient multi-party computation. In _Topics in Cryptology–CT-RSA: The Cryptographers’ Track at the RSA Conference 2019, USA, Proceedings_. Springer.
  * Stathakopoulou and Cachin (2017) Chrysoula Stathakopoulou and Christian Cachin. 2017.  Threshold signatures for blockchain systems.  _Swiss Federal Institute of Technology_ (2017).
  * Subramanian and Sirajudeen (2016) K Subramanian and M Mohamed Sirajudeen. 2016.  Impact of RSA algorithm on Cloud Data Security-Analytical survey.  _International Journal of Advanced Engineering Research and Science_ 3, 4 (2016), 258853.
  * Sun and Liu (2021) Yiru Sun and Yanyan Liu. 2021.  An efficient fully dynamic group signature with message dependent opening from lattice.  _Cybersecurity_ (2021).
  * Tomescu et al. (2020) Alin Tomescu, Robert Chen, Yiming Zheng, Ittai Abraham, Benny Pinkas, Guy Golan Gueta, and Srinivas Devadas. 2020.  Towards scalable threshold cryptosystems. In _2020 IEEE Symposium on Security and Privacy (SP)_. IEEE.
  * Tsang and Wei (2005) Patrick P Tsang and Victor K Wei. 2005.  Short linkable ring signatures for e-voting, e-cash and attestation. In _International Conference on Information Security Practice and Experience_. Springer.
  * Ullah et al. (2023) Shamsher Ullah, Jiangbin Zheng, Nizamud Din, Muhammad Tanveer Hussain, Farhan Ullah, and Mahwish Yousaf. 2023.  Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive survey.  _Computer Science Review_ 47 (2023).
  * Vakarjuk et al. (2021) Jelizaveta Vakarjuk, Nikita Snetkov, and Jan Willemson. 2021.  Dilizium: A two-party lattice-based signature scheme.  _Entropy_ 23, 8 (2021).
  * Wang et al. (2019) Gang Wang, Zhijie Jerry Shi, Mark Nixon, and Song Han. 2019.  Smchain: A scalable blockchain protocol for secure metering systems in distributed industrial plants. In _Proceedings of the International Conference on Internet of Things Design and Implementation_.
  * Wang et al. (2015) Qingbin Wang, Shaozhen Chen, and Aijun Ge. 2015.  A new lattice-based threshold attribute-based signature scheme. In _Information Security Practice and Experience: 11th International Conference, ISPEC 2015, Beijing, China, May 5-8, 2015, Proceedings_. Springer.
  * Wang et al. (2017) Xiao Wang, Samuel Ranellucci, and Jonathan Katz. 2017.  Global-scale secure multiparty computation. In _Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security_.
  * Wang and Fan (2020) Zhiwei Wang and Jiaxing Fan. 2020.  Flexible threshold ring signature in chronological order for privacy protection in edge computing.  _IEEE Transactions on Cloud Computing_ 10, 2 (2020).
  * Waters (2011) Brent Waters. 2011.  Ciphertext-policy attribute-based encryption: An expressive, efficient, and provably secure realization. In _Public Key Cryptography–PKC 2011: 14th International Conference on Practice and Theory in Public Key Cryptography, Proceedings 14_. Springer.
  * Werner (1984) Wilhelm Werner. 1984.  Polynomial interpolation: Lagrange versus newton.  _Mathematics of computation_ 43, 167 (1984).
  * Yadav et al. (2021) Vijay Kumar Yadav, Shekhar Verma, and Subramanian Venkatesan. 2021.  Linkable privacy-preserving scheme for location-based services.  _IEEE Transactions on Intelligent Transportation Systems_ 23, 7 (2021).
  * Yang et al. (2020) Anjia Yang, Jian Weng, Kan Yang, Cheng Huang, and Xuemin Shen. 2020.  Delegating authentication to edge: A decentralized authentication architecture for vehicular networks.  _IEEE Transactions on Intelligent Transportation Systems_ 23, 2 (2020).
  * Yao (1982) Andrew C Yao. 1982.  Protocols for secure computations. In _23rd annual symposium on foundations of computer science (sfcs 1982)_. IEEE.
  * Yao (1986) Andrew Chi-Chih Yao. 1986.  How to generate and exchange secrets. In _27th annual symposium on foundations of computer science_. IEEE.
  * Yavuz (2013) Attila Altay Yavuz. 2013.  Eta: efficient and tiny and authentication for heterogeneous wireless systems. In _Proceedings of the sixth ACM conference on Security and privacy in wireless and mobile networks_. 67–72.
  * Yavuz et al. (2022a) Attila A. Yavuz, Duncan Earl, Scott Packard, and Saif Eddine Nouma. 2022a.  Hybrid Low-Cost Quantum-Safe Key Distribution, In Quantum 2.0 Conference and Exhibition.  _Quantum 2.0 Conference and Exhibition_ , QTu4C.5.  https://doi.org/10.1364/QUANTUM.2022.QTu4C.5
  * Yavuz et al. (2017) Attila Altay Yavuz, Anand Mudgerikar, Ankush Singla, Ioannis Papapanagiotou, and Elisa Bertino. 2017.  Real-time digital signatures for time-critical networks.  _IEEE Transactions on Information Forensics and Security_ 12, 11 (2017).
  * Yavuz et al. (2022b) Attila Altay Yavuz, Saif Nouma, Thang Hoang, Duncan Earl, and Scott Packard. 2022b.  Distributed Cyber-infrastructures and Artificial Intelligence in Hybrid Post-Quantum Era. In _The 4th IEEE International Conference on Trust, Privacy and Security in Intelligent Systems_. IEEE.
  * Yi et al. (2021) Haibo Yi, Yueping Li, Mei Wang, Zengxian Yan, and Zhe Nie. 2021.  An efficient blockchain consensus algorithm based on post-quantum threshold signature.  _Big Data Research_ 26 (2021).
  * Yu and Wang (2022) H. Yu and Han Wang. 2022.  Elliptic curve threshold signature scheme for blockchain.  _Journal of Information Security and Applications_ 70 (2022).
  * Yuen et al. (2021) Tsz Yuen, Muhammed Esgin, Joseph K Liu, Man Ho Au, and Zhimin Ding. 2021.  DualRing: generic construction of ring signatures with efficient instantiations. In _Advances in Cryptology–CRYPTO: 41st Annual International Cryptology Conference, CRYPTO, Proceedings, Part I 41_. Springer.
  * Zhang and Kim (2002) Fangguo Zhang and Kwangjo Kim. 2002.  ID-based blind signature and ring signature from pairings. In _Advances in Cryptology—ASIACRYPT: 8th International Conference on the Theory and Application of Cryptology and Information Security Queenstown, Proceedings 8_. Springer.
  * Zhang et al. (2021b) Lei Zhang, Zhiyong Zheng, and Wei Wang. 2021b.  Survey of Lattice-Based Group Signature. In _Proceedings of the First International Forum on Financial Mathematics and Financial Technology_. Springer.
  * Zhang et al. (2022) Yanhua Zhang, Ximeng Liu, Yupu Hu, Yong Gan, and Huiwen Jia. 2022.  Verifier-local revocation group signatures with backward unlinkability from lattices.  _Frontiers of Information Technology & Electronic Engineering_ 23, 6 (2022).
  * Zhang et al. (2021a) Yanhua Zhang, Ximeng Liu, Yupu Hu, Huiwen Jia, and Qikun Zhang. 2021a.  An Improved Group Signature Scheme with VLR over Lattices.  _Security and Communication Networks_ 2021 (2021).
  * Zhao et al. (2019) Chuan Zhao, Shengnan Zhao, Minghao Zhao, Zhenxiang Chen, Chong-Zhi Gao, Hongwei Li, and Yu-an Tan. 2019.  Secure multi-party computation: theory, practice and applications.  _Information Sciences_ 476 (2019), 357–372.
  * Zhou and Lin (2006) Sujing Zhou and Dongdai Lin. 2006.  Shorter verifier-local revocation group signatures from bilinear maps. In _International Conference on Cryptology and Network Security_. Springer.
  * Zhou et al. (2021) Xianfei Zhou, Jing Huang, Fulong Chen, Yuqing Tang, Canlin Wang, Taochun Wang, Dong Xie, and Chuanxin Zhao. 2021.  A threshold signature scheme without trusted center for blockchain-based medical cyber-physical systems.  (2021).
  * Zhu et al. (2022) Yan Zhu, Bingyu Li, Yang Yang, Zhenyang Ding, Haibing Zheng, Guangyu He, and Shengjie Hou. 2022.  Distributed Random Beacon for Blockchain Based on Share Recovery Threshold Signature.  _Sensors_ 22, 16 (2022).