{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T05:02:26Z","timestamp":1781758946098,"version":"3.54.5"},"reference-count":162,"publisher":"Association for Computing Machinery (ACM)","issue":"12","license":[{"start":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T00:00:00Z","timestamp":1677715200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2023,12,31]]},"abstract":"<jats:p>Blockchain technology provides efficient and secure solutions to various online activities by utilizing a wide range of cryptographic tools. In this article, we survey the existing literature on post-quantum secure digital signatures that possess<jats:italic>exotic<\/jats:italic>advanced features and that are crucial cryptographic tools used in the blockchain ecosystem for (1) account management, (2) consensus efficiency, (3) empowering scriptless blockchain, and (4) privacy. The exotic signatures that we particularly focus on in this work are the following: multi-\/aggregate, threshold, adaptor, blind, and ring signatures. Herein the term \u201dexotic\u201d refers to signatures with properties that are not just beyond the norm for signatures, e.g., unforgeability, but also imbue new forms of functionalities. Our treatment of such exotic signatures includes discussions on existing challenges and future research directions in the post-quantum space. We hope that this article will help to foster further research to make post-quantum cryptography more accessible so that blockchain systems can be made ready in advance of the approaching quantum threats.<\/jats:p>","DOI":"10.1145\/3572771","type":"journal-article","created":{"date-parts":[[2022,12,1]],"date-time":"2022-12-01T12:37:41Z","timestamp":1669898261000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["A Survey on Exotic Signatures for Post-quantum Blockchain: Challenges and Research Directions"],"prefix":"10.1145","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7094-9970","authenticated-orcid":false,"given":"Maxime","family":"Buser","sequence":"first","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7588-2410","authenticated-orcid":false,"given":"Rafael","family":"Dowsley","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1650-3748","authenticated-orcid":false,"given":"Muhammed","family":"Esgin","sequence":"additional","affiliation":[{"name":"Monash University, Australia, and CSIRO\u2019s Data61, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0835-8678","authenticated-orcid":false,"given":"Cl\u00e9mentine","family":"Gritti","sequence":"additional","affiliation":[{"name":"University of Canterbury, New Zealand"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7928-0636","authenticated-orcid":false,"given":"Shabnam","family":"Kasra Kermanshahi","sequence":"additional","affiliation":[{"name":"RMIT University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7724-2601","authenticated-orcid":false,"given":"Veronika","family":"Kuchta","sequence":"additional","affiliation":[{"name":"Florida Atlantic University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6239-6616","authenticated-orcid":false,"given":"Jason","family":"Legrow","sequence":"additional","affiliation":[{"name":"Virginia Polytechnic Institute and State University, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6656-6240","authenticated-orcid":false,"given":"Joseph","family":"Liu","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7448-4595","authenticated-orcid":false,"given":"Rapha\u00ebl","family":"Phan","sequence":"additional","affiliation":[{"name":"Monash University, Malaysia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4569-3384","authenticated-orcid":false,"given":"Amin","family":"Sakzad","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1745-4183","authenticated-orcid":false,"given":"Ron","family":"Steinfeld","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8006-7392","authenticated-orcid":false,"given":"Jiangshan","family":"Yu","sequence":"additional","affiliation":[{"name":"Monash University, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,3,2]]},"reference":[{"key":"e_1_3_2_2_2","first-page":"99","volume-title":"Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC\u201996)","author":"Ajtai M.","year":"1996","unstructured":"M. Ajtai. 1996. Generating hard instances of lattice problems (extended abstract). In Proceedings of the 28th Annual ACM Symposium on Theory of Computing (STOC\u201996). Association for Computing Machinery, New York, NY, 99\u2013108. DOI:https:\/\/doi.org\/10.1145\/237814.237838"},{"key":"e_1_3_2_3_2","first-page":"430","volume-title":"Advances in Cryptology (EUROCRYPT\u201915), Proceedings, Part I (LNCS)","volume":"9056","author":"Albrecht Martin R.","year":"2015","unstructured":"Martin R. Albrecht, Christian Rechberger, Thomas Schneider, Tyge Tiessen, and Michael Zohner. 2015. Ciphers for MPC and FHE. In Advances in Cryptology (EUROCRYPT\u201915), Proceedings, Part I (LNCS), Elisabeth Oswald and Marc Fischlin (Eds.), Vol. 9056. Springer, 430\u2013454."},{"key":"e_1_3_2_4_2","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1007\/978-3-030-51280-4_26","volume-title":"Financial Cryptography and Data Security","author":"Alkadri Nabil Alkeilani","year":"2020","unstructured":"Nabil Alkeilani Alkadri, Rachid El Bansarkhani, and Johannes Buchmann. 2020. BLAZE: Practical lattice-based blind signatures for privacy-preserving applications. In Financial Cryptography and Data Security, Joseph Bonneau and Nadia Heninger (Eds.). Springer International Publishing, Cham, 484\u2013502."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/978-3-030-55304-3_3","volume-title":"Information Security and Privacy","author":"Alkadri Nabil Alkeilani","year":"2020","unstructured":"Nabil Alkeilani Alkadri, Rachid El Bansarkhani, and Johannes Buchmann. 2020. On lattice-based interactive protocols: An approach with less or no aborts. In Information Security and Privacy, Joseph K. Liu and Hui Cui (Eds.). Springer International Publishing, Cham, 41\u201361."},{"key":"e_1_3_2_6_2","unstructured":"Gavin Andresen. 2011. BIP 0011: M-of-N Standard Transactions. https:\/\/en.bitcoin.it\/wiki\/BIP_0011."},{"issue":"7779","key":"e_1_3_2_7_2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute Frank","year":"2019","unstructured":"Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A Buell, et\u00a0al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505\u2013510.","journal-title":"Nature"},{"key":"e_1_3_2_8_2","first-page":"476","article-title":"Generalized bitcoin-compatible channels","volume":"2020","author":"Aumayr Lukas","year":"2020","unstructured":"Lukas Aumayr, Oguzhan Ersoy, Andreas Erwig, Sebastian Faust, Kristina Host\u00e1kov\u00e1, Matteo Maffei, Pedro Moreno-Sanchez, and Siavash Riahi. 2020. Generalized bitcoin-compatible channels. IACR Cryptol. ePrint Arch. 2020 (2020), 476.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_9_2","volume-title":"Supersingular Isogeny Key Encapsulation","author":"Azarderakhsh Reza","year":"2017","unstructured":"Reza Azarderakhsh, Matthew Campagna, Craig Costello, Luca De Feo, Basil Hess, Aaron Hutchinson, Amir Jalali, Koray Karabina, Brian Koziel, Brian LaMacchia, Patrick Longa, Michael Naehrig, Geovandro Pereira, Joost Renes, Vladimir Soukharev, and David Urbanik. 2017. Supersingular Isogeny Key Encapsulation. Technical Report."},{"key":"e_1_3_2_10_2","first-page":"28","volume-title":"CT-RSA (LNCS)","author":"Bai Shi","year":"2014","unstructured":"Shi Bai and Steven D. Galbraith. 2014. An improved compression technique for signatures based on learning with errors. In CT-RSA (LNCS), Vol. 8366. Springer, 28\u201347."},{"key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/978-3-319-45871-7_25","volume-title":"Information Security (ISC\u201916), Proceedings (LNCS)","volume":"9866","author":"Bansarkhani Rachid El","year":"2016","unstructured":"Rachid El Bansarkhani, Mohamed Saied Emam Mohamed, and Albrecht Petzoldt. 2016. MQSAS - A multivariate sequential aggregate signature scheme. In Information Security (ISC\u201916), Proceedings (LNCS), Matt Bishop and Anderson C. A. Nascimento (Eds.), Vol. 9866. Springer, 426\u2013439."},{"key":"e_1_3_2_12_2","unstructured":"Itan Barmes and Bram Bosch. [n.d.]. Quantum computers and the Bitcoin blockchain. https:\/\/www2.deloitte.com\/nl\/nl\/pages\/innovatie\/artikelen\/quantum-computers-and-the-bitcoin-blockchain.html."},{"key":"e_1_3_2_13_2","first-page":"266","volume-title":"Public-Key Cryptography (PKC\u201921) - Proceedings, Part I (Lecture Notes in Computer Science)","volume":"12710","author":"Baum Carsten","year":"2021","unstructured":"Carsten Baum, Cyprien Delpech de Saint Guilhem, Daniel Kales, Emmanuela Orsini, Peter Scholl, and Greg Zaverucha. 2021. Banquet: Short and fast signatures from AES. In Public-Key Cryptography (PKC\u201921) - Proceedings, Part I (Lecture Notes in Computer Science), Juan A. Garay (Ed.), Vol. 12710. Springer, 266\u2013297."},{"key":"e_1_3_2_14_2","first-page":"46","article-title":"Scalable, transparent, and post-quantum secure computational integrity.","volume":"2018","author":"Ben-Sasson Eli","year":"2018","unstructured":"Eli Ben-Sasson, Iddo Bentov, Yinon Horesh, and Michael Riabzev. 2018. Scalable, transparent, and post-quantum secure computational integrity.IACR Cryptol. ePrint Arch. 2018 (2018), 46.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_15_2","first-page":"103","volume-title":"Advances in Cryptology (EUROCRYPT\u201919), Proceedings, Part I (LNCS)","volume":"11476","author":"Ben-Sasson Eli","year":"2019","unstructured":"Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, and Nicholas P. Ward. 2019. Aurora: Transparent succinct arguments for R1CS. In Advances in Cryptology (EUROCRYPT\u201919), Proceedings, Part I (LNCS), Yuval Ishai and Vincent Rijmen (Eds.), Vol. 11476. Springer, 103\u2013128."},{"key":"e_1_3_2_16_2","first-page":"60","volume-title":"TCC (LNCS)","author":"Bender Adam","year":"2006","unstructured":"Adam Bender, Jonathan Katz, and Ruggero Morselli. 2006. Ring signatures: Stronger definitions, and constructions without random oracles. In TCC (LNCS), Vol. 3876. Springer, 60\u201379."},{"key":"e_1_3_2_17_2","first-page":"218","volume-title":"ACNS (Lecture Notes in Computer Science)","author":"Bendlin Rikke","year":"2013","unstructured":"Rikke Bendlin, Sara Krehbiel, and Chris Peikert. 2013. How to share a lattice trapdoor: Threshold protocols for signatures and (H)IBE. In ACNS (Lecture Notes in Computer Science), Vol. 7954. Springer, 218\u2013236."},{"issue":"3","key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/TIT.1978.1055873","article-title":"On the inherent intractability of certain coding problems (corresp.)","volume":"24","author":"Berlekamp Elwyn R.","year":"1978","unstructured":"Elwyn R. Berlekamp, Robert J. McEliece, and Henk C. A. van Tilborg. 1978. On the inherent intractability of certain coding problems (corresp.). IEEE Trans. Inf. Theory 24, 3 (1978), 384\u2013386. DOI:https:\/\/doi.org\/10.1109\/TIT.1978.1055873","journal-title":"IEEE Trans. Inf. Theory"},{"key":"e_1_3_2_19_2","first-page":"214","article-title":"Breaking rainbow takes a weekend on a laptop","author":"Beullens Ward","year":"2022","unstructured":"Ward Beullens. 2022. Breaking rainbow takes a weekend on a laptop. IACR Cryptol. ePrint Arch. (2022), 214(to appear at CRYPTO\u201922).","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_20_2","first-page":"464","volume-title":"Advances in Cryptology (ASIACRYPT\u201920)","author":"Beullens Ward","year":"2020","unstructured":"Ward Beullens, Shuichi Katsumata, and Federico Pintore. 2020. Calamari and Falafl: Logarithmic (linkable) ring signatures from isogenies and lattices. In Advances in Cryptology (ASIACRYPT\u201920), Shiho Moriai and Huaxiong Wang (Eds.). Springer International Publishing, Cham, 464\u2013492."},{"key":"e_1_3_2_21_2","first-page":"227","volume-title":"Advances in Cryptology (ASIACRYPT\u201919)","author":"Beullens Ward","year":"2019","unstructured":"Ward Beullens, Thorsten Kleinjung, and Frederik Vercauteren. 2019. CSI-FiSh: Efficient isogeny based signatures through class group computations. In Advances in Cryptology (ASIACRYPT\u201919), Steven D. Galbraith and Shiho Moriai (Eds.). Springer International Publishing, Cham, 227\u2013247."},{"key":"e_1_3_2_22_2","article-title":"LUOV: Signature scheme proposal for NIST PQC project","author":"Beullens Ward","year":"2019","unstructured":"Ward Beullens, Bart Preneel, Alan Szepieniec, and Frederik Vercauteren. 2019. LUOV: Signature scheme proposal for NIST PQC project. Submission to the NIST\u2019s post-quantum cryptography standardization process (2019).","journal-title":"Submission to the NIST\u2019s post-quantum cryptography standardization process"},{"key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"2025","DOI":"10.1145\/3372297.3417893","volume-title":"Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security","author":"Bhadauria Rishabh","year":"2020","unstructured":"Rishabh Bhadauria, Zhiyong Fang, Carmit Hazay, Muthuramakrishnan Venkitasubramaniam, Tiancheng Xie, and Yupeng Zhang. 2020. Ligero++: A new optimized sublinear IOP. In Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security. 2025\u20132038."},{"key":"e_1_3_2_24_2","unstructured":"Bitcoin Wiki. 2022. Script. Retrieved January 31 2022 from https:\/\/en.bitcoin.it\/wiki\/Script."},{"key":"e_1_3_2_25_2","first-page":"313","volume-title":"Managing Requirements Knowledge, International Workshop on","author":"Blakley G. R.","year":"1979","unstructured":"G. R. Blakley. 1979. Safeguarding cryptographic keys. In Managing Requirements Knowledge, International Workshop on. IEEE Computer Society, Los Alamitos, CA, 313. DOI:https:\/\/doi.org\/10.1109\/AFIPS.1979.98"},{"key":"e_1_3_2_26_2","doi-asserted-by":"crossref","first-page":"2718","DOI":"10.1109\/ISIT.2017.8007023","volume-title":"2017 IEEE International Symposium on Information Theory (ISIT\u201917)","author":"Blazy Olivier","year":"2017","unstructured":"Olivier Blazy, Philippe Gaborit, Julien Schrek, and Nicolas Sendrier. 2017. A code-based blind signature. In 2017 IEEE International Symposium on Information Theory (ISIT\u201917). IEEE, 2718\u20132722."},{"key":"e_1_3_2_27_2","first-page":"41","volume-title":"Advances in Cryptology (ASIACRYPT\u201911)","author":"Boneh Dan","year":"2011","unstructured":"Dan Boneh, \u00d6zg\u00fcr Dagdelen, Marc Fischlin, Anja Lehmann, Christian Schaffner, and Mark Zhandry. 2011. Random oracles in a quantum world. In Advances in Cryptology (ASIACRYPT\u201911), Dong Hoon Lee and Xiaoyun Wang (Eds.). Springer, Berlin, 41\u201369."},{"key":"e_1_3_2_28_2","first-page":"565","volume-title":"Advances in Cryptology (CRYPTO\u201918) - Proceedings, Part I","author":"Boneh Dan","year":"2018","unstructured":"Dan Boneh, Rosario Gennaro, Steven Goldfeder, Aayush Jain, Sam Kim, Peter M. R. Rasmussen, and Amit Sahai. 2018. Threshold cryptosystems from threshold fully homomorphic encryption. In Advances in Cryptology (CRYPTO\u201918) - Proceedings, Part I. 565\u2013596."},{"key":"e_1_3_2_29_2","first-page":"416","volume-title":"Advances in Cryptology (EUROCRYPT\u201903), Proceedings (LNCS)","volume":"2656","author":"Boneh Dan","year":"2003","unstructured":"Dan Boneh, Craig Gentry, Ben Lynn, and Hovav Shacham. 2003. Aggregate and verifiably encrypted signatures from bilinear maps. In Advances in Cryptology (EUROCRYPT\u201903), Proceedings (LNCS), Eli Biham (Ed.), Vol. 2656. Springer, 416\u2013432."},{"key":"e_1_3_2_30_2","first-page":"592","volume-title":"Advances in Cryptology (EUROCRYPT\u201913)","author":"Boneh Dan","year":"2013","unstructured":"Dan Boneh and Mark Zhandry. 2013. Quantum-secure message authentication codes. In Advances in Cryptology (EUROCRYPT\u201913), Thomas Johansson and Phong Q. Nguyen (Eds.). Springer, Berlin, 592\u2013608."},{"key":"e_1_3_2_31_2","article-title":"Lattice-based (Partially) Blind Signature without Restart","author":"Bouaziz-Ermann Samuel","year":"2020","unstructured":"Samuel Bouaziz-Ermann, S\u00e9bastien Canard, Gautier Eberhart, Guillaume Kaim, Adeline Roux-Langlois, and Jacques Traor\u00e9. 2020. Lattice-based (Partially) Blind Signature without Restart. Cryptology ePrint Archive, Report 2020\/260. (2020). https:\/\/eprint.iacr.org\/2020\/260.","journal-title":"Cryptology ePrint Archive, Report 2020\/260"},{"key":"e_1_3_2_32_2","article-title":"Non-Interactive Half-Aggregate Signatures Based on Module Lattices - A First Attempt","author":"Boudgoust Katharina","year":"2021","unstructured":"Katharina Boudgoust and Adeline Roux-Langlois. 2021. Non-Interactive Half-Aggregate Signatures Based on Module Lattices - A First Attempt. Cryptology ePrint Archive, Paper 2021\/263. (2021). https:\/\/eprint.iacr.org\/2021\/263.","journal-title":"Cryptology ePrint Archive, Paper 2021\/263"},{"issue":"3","key":"e_1_3_2_33_2","first-page":"13:1\u201313:36","article-title":"(Leveled) fully homomorphic encryption without bootstrapping","volume":"6","author":"Brakerski Zvika","year":"2014","unstructured":"Zvika Brakerski, Craig Gentry, and Vinod Vaikuntanathan. 2014. (Leveled) fully homomorphic encryption without bootstrapping. ACM Trans. Comput. Theory 6, 3 (2014), 13:1\u201313:36.","journal-title":"ACM Trans. Comput. Theory"},{"key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1007\/978-3-030-01446-9_12","volume-title":"Provable Security (ProvSec\u201918), Proceedings (LNCS)","volume":"11192","author":"Branco Pedro","year":"2018","unstructured":"Pedro Branco and Paulo Mateus. 2018. A code-based linkable ring signature scheme. In Provable Security (ProvSec\u201918), Proceedings (LNCS), Joonsang Baek, Willy Susilo, and Jongkil Kim (Eds.), Vol. 11192. Springer, 203\u2013219."},{"key":"e_1_3_2_35_2","first-page":"387","volume-title":"Post-Quantum Cryptography - 2019 Revised Selected Papers (LNCS)","author":"Branco Pedro","year":"2019","unstructured":"Pedro Branco and Paulo Mateus. 2019. A traceable ring signature scheme based on coding theory. In Post-Quantum Cryptography - 2019 Revised Selected Papers (LNCS), Jintai Ding and Rainer Steinwandt (Eds.), Vol. 11505. Springer, 387\u2013403."},{"key":"e_1_3_2_36_2","first-page":"171","volume-title":"Information Security - 22nd International Conference (ISC\u201919), Proceedings (LNCS)","volume":"11723","author":"Brunetta Carlo","year":"2019","unstructured":"Carlo Brunetta, Bei Liang, and Aikaterini Mitrokotsa. 2019. Code-based zero knowledge PRF arguments. In Information Security - 22nd International Conference (ISC\u201919), Proceedings (LNCS), Zhiqiang Lin, Charalampos Papamanthou, and Michalis Polychronakis (Eds.), Vol. 11723. Springer, 171\u2013189."},{"key":"e_1_3_2_37_2","first-page":"1:1\u20131:16","volume-title":"DISC\u201917 (LIPIcs)","author":"Cachin Christian","year":"2017","unstructured":"Christian Cachin and Marko Vukolic. 2017. Blockchain consensus protocols in the wild (keynote talk). In DISC\u201917 (LIPIcs), Andrea W. Richa (Ed.), Vol. 91. Schloss Dagstuhl - Leibniz-Zentrum fur Informatik, 1:1\u20131:16."},{"key":"e_1_3_2_38_2","first-page":"578","volume-title":"Financial Cryptography and Data Security (FC\u201920) Revised Selected Papers (LNCS)","author":"Cao Tong","year":"2020","unstructured":"Tong Cao, Jiangshan Yu, J\u00e9r\u00e9mie Decouchant, Xiapu Luo, and Paulo Ver\u00edssimo. 2020. Exploring the Monero peer-to-peer network. In Financial Cryptography and Data Security (FC\u201920) Revised Selected Papers (LNCS), Joseph Bonneau and Nadia Heninger (Eds.), Vol. 12059. Springer, 578\u2013594."},{"issue":"4","key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/571637.571640","article-title":"Practical byzantine fault tolerance and proactive recovery","volume":"20","author":"Castro Miguel","year":"2002","unstructured":"Miguel Castro and Barbara Liskov. 2002. Practical byzantine fault tolerance and proactive recovery. ACM Trans. Comput. Syst. 20, 4 (2002), 398\u2013461.","journal-title":"ACM Trans. Comput. Syst."},{"key":"e_1_3_2_40_2","article-title":"An efficient key recovery attack on SIDH (preliminary version)","author":"Castryck Wouter","year":"2022","unstructured":"Wouter Castryck and Thomas Decru. 2022. An efficient key recovery attack on SIDH (preliminary version). Cryptology ePrint Archive, Paper 2022\/975. (2022). https:\/\/eprint.iacr.org\/2022\/975.","journal-title":"Cryptology ePrint Archive, Paper 2022\/975"},{"key":"e_1_3_2_41_2","first-page":"395","volume-title":"Advances in Cryptology (ASIACRYPT\u201918)","author":"Castryck Wouter","year":"2018","unstructured":"Wouter Castryck, Tanja Lange, Chloe Martindale, Lorenz Panny, and Joost Renes. 2018. CSIDH: An efficient post-quantum commutative group action. In Advances in Cryptology (ASIACRYPT\u201918), Thomas Peyrin and Steven Galbraith (Eds.). Springer International Publishing, 395\u2013427."},{"key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"1825","DOI":"10.1145\/3133956.3133997","volume-title":"Proceedings of the 2017 ACM Sigsac Conference on Computer and Communications Security","author":"Chase Melissa","year":"2017","unstructured":"Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Sebastian Ramacher, Christian Rechberger, Daniel Slamanig, and Greg Zaverucha. 2017. Post-quantum zero-knowledge and signatures from symmetric-key primitives. In Proceedings of the 2017 ACM Sigsac Conference on Computer and Communications Security. 1825\u20131842."},{"key":"e_1_3_2_43_2","first-page":"199","volume-title":"Advances in Cryptology: Proceedings of CRYPTO\u201982","author":"Chaum David","year":"1982","unstructured":"David Chaum. 1982. Blind signatures for untraceable payments. In Advances in Cryptology: Proceedings of CRYPTO\u201982, David Chaum, Ronald L. Rivest, and Alan T. Sherman (Eds.). Plenum Press, New York, NY, 199\u2013203."},{"key":"e_1_3_2_44_2","first-page":"455","article-title":"FloodXMR: Low-cost transaction flooding attack with Monero\u2019s bulletproof protocol","volume":"2019","author":"Chervinski Jo\u00e3o Ot\u00e1vio Massari","year":"2019","unstructured":"Jo\u00e3o Ot\u00e1vio Massari Chervinski, Diego Kreutz, and Jiangshan Yu. 2019. FloodXMR: Low-cost transaction flooding attack with Monero\u2019s bulletproof protocol. IACR Cryptol. ePrint Arch. 2019 (2019), 455.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_45_2","article-title":"A survey on NIST PQ signatures","volume":"2107","author":"Chiano Nicola Di","year":"2021","unstructured":"Nicola Di Chiano, Riccardo Longo, Alessio Meneghetti, and Giordano Santilli. 2021. A survey on NIST PQ signatures. CoRR abs\/2107.11082 (2021).","journal-title":"CoRR"},{"key":"e_1_3_2_46_2","article-title":"Hard Homogeneous Spaces","author":"Couveignes Jean-Marc","year":"2006","unstructured":"Jean-Marc Couveignes. 2006. Hard Homogeneous Spaces. Cryptology ePrint Archive, Report 2006\/291. (2006). https:\/\/eprint.iacr.org\/2006\/291.","journal-title":"Cryptology ePrint Archive, Report 2006\/291"},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/978-3-030-35199-1_7","volume-title":"Cryptography and Coding - 17th IMA International Conference (IMACC\u201919), Proceedings","author":"Cozzo Daniele","year":"2019","unstructured":"Daniele Cozzo and Nigel P. Smart. 2019. Sharing the LUOV: Threshold post-quantum signatures. In Cryptography and Coding - 17th IMA International Conference (IMACC\u201919), Proceedings. 128\u2013153."},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-030-44223-1_10","volume-title":"Post-Quantum Cryptography","author":"Cozzo Daniele","year":"2020","unstructured":"Daniele Cozzo and Nigel P. Smart. 2020. Sashimi: Cutting up CSI-FiSh secret keys to produce an actively secure distributed signing protocol. In Post-Quantum Cryptography, Jintai Ding and Jean-Pierre Tillich (Eds.). Springer International Publishing, Cham, 169\u2013186."},{"key":"e_1_3_2_49_2","first-page":"106","volume-title":"FC\u201916 (LNCS)","author":"Croman Kyle","year":"2016","unstructured":"Kyle Croman, Christian Decker, Ittay Eyal, Adem Efe Gencer, Ari Juels, Ahmed E. Kosba, Andrew Miller, Prateek Saxena, Elaine Shi, Emin Gun Sirer, Dawn Song, and Roger Wattenhofer. 2016. On scaling decentralized blockchains - A position paper. In FC\u201916 (LNCS), Jeremy Clark, Sarah Meiklejohn, Peter Y. A. Ryan, Dan S. Wallach, Michael Brenner, and Kurt Rohloff (Eds.), Vol. 9604. Springer, 106\u2013125."},{"key":"e_1_3_2_50_2","unstructured":"CryptoNote Coins 2018. CryptoNote Currencies. https:\/\/cryptonote.org\/coins\/."},{"key":"e_1_3_2_51_2","first-page":"222","volume-title":"Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009. Proceedings (LNCS)","volume":"5921","author":"Dallot L\u00e9onard","year":"2009","unstructured":"L\u00e9onard Dallot and Damien Vergnaud. 2009. Provably secure code-based threshold ring signatures. In Cryptography and Coding, 12th IMA International Conference, Cryptography and Coding 2009. Proceedings (LNCS), Matthew G. Parker (Ed.), Vol. 5921. Springer, 222\u2013235."},{"key":"e_1_3_2_52_2","first-page":"99","volume-title":"PKC\u201921, Part I","author":"Damg\u00e5rd Ivan","year":"2021","unstructured":"Ivan Damg\u00e5rd, Claudio Orlandi, Akira Takahashi, and Mehdi Tibouchi. 2021. Two-round n-out-of-n and multi-signatures and trapdoor commitment from lattices. In PKC\u201921, Part I. 99\u2013130."},{"key":"e_1_3_2_53_2","first-page":"759","volume-title":"Advances in Cryptology (EUROCRYPT\u201919)","author":"Feo Luca De","year":"2019","unstructured":"Luca De Feo and Steven D. Galbraith. 2019. SeaSign: Compact isogeny signatures from class group actions. In Advances in Cryptology (EUROCRYPT\u201919), Yuval Ishai and Vincent Rijmen (Eds.). Springer International Publishing, Cham, 759\u2013789."},{"key":"e_1_3_2_54_2","first-page":"187","volume-title":"Public-Key Cryptography (PKC\u201920)","author":"Feo Luca De","year":"2020","unstructured":"Luca De Feo and Michael Meyer. 2020. Threshold schemes from isogeny assumptions. In Public-Key Cryptography (PKC\u201920), Aggelos Kiayias, Markulf Kohlweiss, Petros Wallden, and Vassilis Zikas (Eds.). Springer International Publishing, Cham, 187\u2013212."},{"key":"e_1_3_2_55_2","first-page":"669","volume-title":"International Conference on Selected Areas in Cryptography","author":"Guilhem Cyprien Delpech de Saint","year":"2019","unstructured":"Cyprien Delpech de Saint Guilhem, Lauren De Meyer, Emmanuela Orsini, and Nigel P Smart. 2019. BBQ: Using AES in picnic signatures. In International Conference on Selected Areas in Cryptography. Springer, 669\u2013692."},{"key":"e_1_3_2_56_2","volume-title":"European Conference on Computer Systems (EuroSys\u201922)","author":"Decouchant Jeremie","year":"2022","unstructured":"Jeremie Decouchant, David Kozhaya, Vincent Rahli, and Jiangshan Yu. 2022. DAMYSUS: Streamlined BFT consensus leveraging trusted components. In European Conference on Computer Systems (EuroSys\u201922)."},{"key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/978-3-319-79063-3_20","volume-title":"International Conference on Post-Quantum Cryptography","author":"Derler David","year":"2018","unstructured":"David Derler, Sebastian Ramacher, and Daniel Slamanig. 2018. Post-quantum zero-knowledge proofs for accumulators with applications to ring signatures from symmetric-key primitives. In International Conference on Post-Quantum Cryptography. Springer, 419\u2013440."},{"key":"e_1_3_2_58_2","first-page":"457","volume-title":"Advances in Cryptology (CRYPTO\u201991)","author":"Desmedt Yvo","year":"1992","unstructured":"Yvo Desmedt and Yair Frankel. 1992. Shared generation of authenticators and signatures. In Advances in Cryptology (CRYPTO\u201991), Joan Feigenbaum (Ed.). Springer, Berlin, 457\u2013469."},{"key":"e_1_3_2_59_2","first-page":"164","volume-title":"ACNS (Lecture Notes in Computer Science)","author":"Ding Jintai","year":"2005","unstructured":"Jintai Ding and Dieter Schmidt. 2005. Rainbow, a new multivariable polynomial signature scheme. In ACNS (Lecture Notes in Computer Science), Vol. 3531. 164\u2013175."},{"key":"e_1_3_2_60_2","first-page":"520","article-title":"MMSAT: A scheme for multimessage multiuser signature aggregation.","volume":"2020","author":"Dor\u00f6z Yarkin","year":"2020","unstructured":"Yarkin Dor\u00f6z, Jeffrey Hoffstein, Joseph H. Silverman, and Berk Sunar. 2020. MMSAT: A scheme for multimessage multiuser signature aggregation.IACR Cryptol. ePrint Arch. 2020 (2020), 520.","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"e_1_3_2_61_2","unstructured":"Thaddeus Dryja. [n.d.]. Discrete log contracts. https:\/\/adiabat.github.io\/dlc.pdf."},{"key":"e_1_3_2_62_2","volume-title":"CHES","author":"Ducas L\u00e9o","year":"2018","unstructured":"L\u00e9o Ducas, Tancr\u00e8de Lepoint, Vadim Lyubashevsky, Peter Schwabe, Gregor Seiler, and Damien Stehl\u00e9. 2018. Crystals\u2013dilithium: Digital signatures from module lattices. In CHES, Vol. 2018-1. https:\/\/eprint.iacr.org\/2017\/633.pdf."},{"key":"e_1_3_2_63_2","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/978-3-319-48965-0_9","volume-title":"International Conference on Cryptology and Network Security","author":"Bansarkhani Rachid El","year":"2016","unstructured":"Rachid El Bansarkhani and Jan Sturm. 2016. An efficient lattice-based multisignature scheme with applications to bitcoins. In International Conference on Cryptology and Network Security. Springer, 140\u2013155."},{"key":"e_1_3_2_64_2","first-page":"378","volume-title":"ESORICS (2) (LNCS)","author":"Esgin Muhammed F.","year":"2020","unstructured":"Muhammed F. Esgin, Oguzhan Ersoy, and Zekeriya Erkin. 2020. Post-quantum adaptor signatures and payment channel networks. In ESORICS (2) (LNCS), Vol. 12309. Springer, 378\u2013397."},{"key":"e_1_3_2_65_2","first-page":"115","volume-title":"CRYPTO (1) (LNCS)","author":"Esgin Muhammed F.","year":"2019","unstructured":"Muhammed F. Esgin, Ron Steinfeld, Joseph K. Liu, and Dongxi Liu. 2019. Lattice-based zero-knowledge proofs: New techniques for shorter and faster constructions and applications. In CRYPTO (1) (LNCS), Vol. 11692. Springer, 115\u2013146. (Full version at ia.cr\/2019\/445)."},{"key":"e_1_3_2_66_2","first-page":"67","volume-title":"ACNS (LNCS)","author":"Esgin Muhammed F.","year":"2019","unstructured":"Muhammed F. Esgin, Ron Steinfeld, Amin Sakzad, Joseph K. Liu, and Dongxi Liu. 2019. Short lattice-based one-out-of-many proofs and applications to ring signatures. In ACNS (LNCS). Springer, 67\u201388. (Full version at ia.cr\/2018\/773)."},{"key":"e_1_3_2_67_2","first-page":"1281","volume-title":"IEEE Symposium on Security and Privacy","author":"Esgin Muhammed F.","year":"2022","unstructured":"Muhammed F. Esgin, Ron Steinfeld, and Raymond K. Zhao. 2022. MatRiCT \\(^+\\) : More efficient post-quantum private blockchain payments. In IEEE Symposium on Security and Privacy. IEEE, 1281\u20131298. (Full version at ia.cr\/2021\/545)."},{"key":"e_1_3_2_68_2","first-page":"567","volume-title":"ACM CCS 2019, Proceedings","author":"Esgin Muhammed F.","year":"2019","unstructured":"Muhammed F. Esgin, Raymond K. Zhao, Ron Steinfeld, Joseph K. Liu, and Dongxi Liu. 2019. MatRiCT: Efficient, scalable and post-quantum blockchain confidential transactions protocol. In ACM CCS 2019, Proceedings. ACM, 567\u2013584. (Full version at ia.cr\/2019\/1287)."},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"21091","DOI":"10.1109\/ACCESS.2020.2968985","article-title":"Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks","volume":"8","author":"Fern\u00e1ndez-Caram\u00e9s Tiago M.","year":"2020","unstructured":"Tiago M. Fern\u00e1ndez-Caram\u00e9s and Paula Fraga-Lamas. 2020. Towards post-quantum blockchain: A review on blockchain cryptography resistant to quantum computing attacks. IEEE Access 8 (2020), 21091\u201321116.","journal-title":"IEEE Access"},{"key":"e_1_3_2_70_2","first-page":"186","volume-title":"Advances in Cryptology (CRYPTO\u2019 86)","author":"Fiat Amos","year":"1987","unstructured":"Amos Fiat and Adi Shamir. 1987. How to prove yourself: Practical solutions to identification and signature problems. In Advances in Cryptology (CRYPTO\u2019 86), Andrew M. Odlyzko (Ed.). Springer, Berlin, 186\u2013194."},{"key":"e_1_3_2_71_2","first-page":"60","volume-title":"Advances in Cryptology (CRYPTO\u201906)","author":"Fischlin Marc","year":"2006","unstructured":"Marc Fischlin. 2006. Round-optimal composable blind signatures in the common reference string model. In Advances in Cryptology (CRYPTO\u201906), Cynthia Dwork (Ed.). Springer, Berlin, 60\u201377."},{"key":"e_1_3_2_72_2","first-page":"45","volume-title":"ProvSec\u201920","author":"Fukumitsu Masayuki","year":"2020","unstructured":"Masayuki Fukumitsu and Shingo Hasegawa. 2020. A lattice-based provably secure multisignature scheme in quantum random oracle model. In ProvSec\u201920. 45\u201364."},{"key":"e_1_3_2_73_2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/978-3-319-11659-4_6","volume-title":"Post-Quantum Cryptography (PQCrypto\u201914), Proceedings (LNCS)","volume":"8772","author":"Gaborit Philippe","year":"2014","unstructured":"Philippe Gaborit, Olivier Ruatta, Julien Schrek, and Gilles Z\u00e9mor. 2014. RankSign: An efficient signature algorithm based on the rank metric. In Post-Quantum Cryptography (PQCrypto\u201914), Proceedings (LNCS), Michele Mosca (Ed.), Vol. 8772. Springer, 88\u2013107."},{"key":"e_1_3_2_74_2","first-page":"205","volume-title":"Information Security and Cryptology","author":"Gao Wen","year":"2017","unstructured":"Wen Gao, Yupu Hu, Baocang Wang, and Jia Xie. 2017. Identity-based blind signature from lattices in standard model. In Information Security and Cryptology, Kefei Chen, Dongdai Lin, and Moti Yung (Eds.). Springer International Publishing, Cham, 205\u2013218."},{"key":"e_1_3_2_75_2","first-page":"156","volume-title":"ACNS\u201916, Proceedings","author":"Gennaro Rosario","year":"2016","unstructured":"Rosario Gennaro, Steven Goldfeder, and Arvind Narayanan. 2016. Threshold-optimal DSA\/ECDSA signatures and an application to bitcoin wallet security. In ACNS\u201916, Proceedings. Springer, 156\u2013174."},{"issue":"1","key":"e_1_3_2_76_2","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1006\/inco.2000.2881","article-title":"Robust threshold DSS signatures","volume":"164","author":"Gennaro Rosario","year":"2001","unstructured":"Rosario Gennaro, Stanis\u0142aw Jarecki, Hugo Krawczyk, and Tal Rabin. 2001. Robust threshold DSS signatures. Information and Computation 164, 1 (2001), 54\u201384. DOI:https:\/\/doi.org\/10.1006\/inco.2000.2881","journal-title":"Information and Computation"},{"key":"e_1_3_2_77_2","first-page":"1069","volume-title":"25th \\(\\lbrace\\) Usenix \\(\\rbrace\\) Security Symposium ( \\(\\lbrace\\) Usenix \\(\\rbrace\\) Security 16)","author":"Giacomelli Irene","year":"2016","unstructured":"Irene Giacomelli, Jesper Madsen, and Claudio Orlandi. 2016. Zkboo: Faster zero-knowledge for boolean circuits. In 25th \\(\\lbrace\\) Usenix \\(\\rbrace\\) Security Symposium ( \\(\\lbrace\\) Usenix \\(\\rbrace\\) Security 16). 1069\u20131083."},{"key":"e_1_3_2_78_2","first-page":"568","volume-title":"49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201919)","author":"Golan-Gueta Guy","year":"2019","unstructured":"Guy Golan-Gueta, Ittai Abraham, Shelly Grossman, Dahlia Malkhi, Benny Pinkas, Michael K. Reiter, Dragos-Adrian Seredinschi, Orr Tamir, and Alin Tomescu. 2019. SBFT: A scalable and decentralized trust infrastructure. In 49th Annual IEEE\/IFIP International Conference on Dependable Systems and Networks (DSN\u201919). IEEE, 568\u2013580."},{"key":"e_1_3_2_79_2","first-page":"291","volume-title":"ACM STOC\u201985, Proceedings","author":"Goldwasser Shafi","year":"1985","unstructured":"Shafi Goldwasser, Silvio Micali, and Charles Rackoff. 1985. The knowledge complexity of interactive proof-systems (extended abstract). In ACM STOC\u201985, Proceedings, Robert Sedgewick (Ed.). ACM, 291\u2013304."},{"key":"e_1_3_2_80_2","first-page":"201","volume-title":"Financial Cryptography and Data Security (FC\u201920) Revised Selected Papers (Lecture Notes in Computer Science)","author":"Gudgeon Lewis","year":"2020","unstructured":"Lewis Gudgeon, Pedro Moreno-Sanchez, Stefanie Roos, Patrick McCorry, and Arthur Gervais. 2020. SoK: Layer-two blockchain protocols. In Financial Cryptography and Data Security (FC\u201920) Revised Selected Papers (Lecture Notes in Computer Science), Joseph Bonneau and Nadia Heninger (Eds.), Vol. 12059. Springer, 201\u2013226."},{"key":"e_1_3_2_81_2","first-page":"530","volume-title":"Cryptographic Hardware and Embedded Systems (CHES\u201912), Proceedings","author":"G\u00fcneysu Tim","year":"2012","unstructured":"Tim G\u00fcneysu, Vadim Lyubashevsky, and Thomas P\u00f6ppelmann. 2012. Practical lattice-based cryptography: A signature scheme for embedded systems. In Cryptographic Hardware and Embedded Systems (CHES\u201912), Proceedings. 530\u2013547."},{"key":"e_1_3_2_82_2","first-page":"62","volume-title":"Proceedings of the 1st ACM Conference on Advances in Financial Technologies (AFT\u201919)","author":"Han Runchao","year":"2019","unstructured":"Runchao Han, Haoyu Lin, and Jiangshan Yu. 2019. On the optionality and fairness of atomic swaps. In Proceedings of the 1st ACM Conference on Advances in Financial Technologies (AFT\u201919). ACM, 62\u201375."},{"key":"e_1_3_2_83_2","doi-asserted-by":"crossref","first-page":"307\u2013313(6)","DOI":"10.1049\/ip-cdt:19941293","article-title":"Group-oriented \\((t, n)\\) threshold digital signature scheme and digital multisignature","volume":"141","author":"Harn L.","year":"1994","unstructured":"L. Harn. 1994. Group-oriented \\((t, n)\\) threshold digital signature scheme and digital multisignature. IEE Proceedings - Computers and Digital Techniques 141, 5 (September1994), 307\u2013313(6).","journal-title":"IEE Proceedings - Computers and Digital Techniques"},{"key":"e_1_3_2_84_2","first-page":"500","volume-title":"Advances in Cryptology (CRYPTO\u201920)","author":"Hauck Eduard","year":"2020","unstructured":"Eduard Hauck, Eike Kiltz, Julian Loss, and Ngoc Khanh Nguyen. 2020. Lattice-based blind signatures, revisited. In Advances in Cryptology (CRYPTO\u201920), Daniele Micciancio and Thomas Ristenpart (Eds.). Springer International Publishing, Cham, 500\u2013529."},{"key":"e_1_3_2_85_2","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1007\/978-3-319-07536-5_28","volume-title":"Applied Cryptography and Network Security (ACNS\u201914). Proceedings","author":"Hoffstein Jeffrey","year":"2014","unstructured":"Jeffrey Hoffstein, Jill Pipher, John M. Schanck, Joseph H. Silverman, and William Whyte. 2014. Practical signatures from the partial fourier recovery problem. In Applied Cryptography and Network Security (ACNS\u201914). Proceedings. 476\u2013493."},{"issue":"3","key":"e_1_3_2_86_2","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1137\/080725398","article-title":"Zero-knowledge proofs from secure multiparty computation","volume":"39","author":"Ishai Yuval","year":"2009","unstructured":"Yuval Ishai, Eyal Kushilevitz, Rafail Ostrovsky, and Amit Sahai. 2009. Zero-knowledge proofs from secure multiparty computation. SIAM J. Comput. 39, 3 (2009), 1121\u20131152.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_87_2","first-page":"1","article-title":"A public-key cryptosystem suitable for digital multisignatures","volume":"71","author":"Itakura Kazuharu","year":"1983","unstructured":"Kazuharu Itakura and Katsuhiro Nakamura. 1983. A public-key cryptosystem suitable for digital multisignatures. NEC Research & Development 71 (1983), 1\u20138.","journal-title":"NEC Research & Development"},{"key":"e_1_3_2_88_2","first-page":"663","volume-title":"Advances in Cryptology (ASIACRYPT\u201912), Proceedings (LNCS)","volume":"7658","author":"Jain Abhishek","year":"2012","unstructured":"Abhishek Jain, Stephan Krenn, Krzysztof Pietrzak, and Aris Tentes. 2012. Commitments and efficient zero-knowledge proofs from learning parity with noise. In Advances in Cryptology (ASIACRYPT\u201912), Proceedings (LNCS), Xiaoyun Wang and Kazue Sako (Eds.), Vol. 7658. Springer, 663\u2013680."},{"key":"e_1_3_2_89_2","first-page":"19","volume-title":"Post-Quantum Cryptography","author":"Jao David","year":"2011","unstructured":"David Jao and Luca De Feo. 2011. Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies. In Post-Quantum Cryptography, Bo-Yin Yang (Ed.). Springer, Berlin, 19\u201334."},{"key":"e_1_3_2_90_2","first-page":"160","volume-title":"Post-Quantum Cryptography","author":"Jao David","year":"2014","unstructured":"David Jao and Vladimir Soukharev. 2014. Isogeny-based quantum-resistant undeniable signatures. In Post-Quantum Cryptography, Michele Mosca (Ed.). Springer International Publishing, Cham, 160\u2013179."},{"key":"e_1_3_2_91_2","first-page":"150","volume-title":"Advances in Cryptology (CRYPTO\u201997)","author":"Juels Ari","year":"1997","unstructured":"Ari Juels, Michael Luby, and Rafail Ostrovsky. 1997. Security of blind digital signatures. In Advances in Cryptology (CRYPTO\u201997), Burton S. Kaliski (Ed.). Springer, Berlin, 150\u2013164."},{"key":"e_1_3_2_92_2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.46586\/tches.v2020.i4.154-188","article-title":"Improving the performance of the picnic signature scheme","author":"Kales Daniel","year":"2020","unstructured":"Daniel Kales and Greg Zaverucha. 2020. Improving the performance of the picnic signature scheme. IACR Transactions on Cryptographic Hardware and Embedded Systems (2020), 154\u2013188.","journal-title":"IACR Transactions on Cryptographic Hardware and Embedded Systems"},{"key":"e_1_3_2_93_2","first-page":"525","volume-title":"ACM SIGSAC CCS 2018, Proceedings","author":"Katz Jonathan","year":"2018","unstructured":"Jonathan Katz, Vladimir Kolesnikov, and Xiao Wang. 2018. Improved non-interactive zero knowledge with applications to post-quantum signatures. In ACM SIGSAC CCS 2018, Proceedings. 525\u2013537."},{"key":"e_1_3_2_94_2","first-page":"153","volume-title":"ESORICS","author":"Kumar Amrit","year":"2017","unstructured":"Amrit Kumar, Cl\u00e9ment Fischer, Shruti Tople, and Prateek Saxena. 2017. A traceability analysis of Monero\u2019s blockchain. In ESORICS. 153\u2013173."},{"key":"e_1_3_2_95_2","volume-title":"Constructing Digital Signatures from a One-way Function","author":"Lamport Leslie","year":"1979","unstructured":"Leslie Lamport. 1979. Constructing Digital Signatures from a One-way Function. Technical Report. Citeseer."},{"issue":"3","key":"e_1_3_2_96_2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10623-014-9938-4","article-title":"Worst-case to average-case reductions for module lattices","volume":"75","author":"Langlois Adeline","year":"2015","unstructured":"Adeline Langlois and Damien Stehl\u00e9. 2015. Worst-case to average-case reductions for module lattices. Des. Codes Cryptogr. 75, 3 (2015), 565\u2013599.","journal-title":"Des. Codes Cryptogr."},{"key":"e_1_3_2_97_2","first-page":"1","volume-title":"2019 IEEE Conference on Dependable and Secure Computing (DSC\u201919)","author":"Le H. Q.","year":"2019","unstructured":"H. Q. Le, W. Susilo, T. X. Khuc, M. K. Bui, and D. H. Duong. 2019. A blind signature from module latices. In 2019 IEEE Conference on Dependable and Secure Computing (DSC\u201919). 1\u20138. DOI:https:\/\/doi.org\/10.1109\/DSC47296.2019.8937613"},{"key":"e_1_3_2_98_2","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF01457454","article-title":"Factoring polynomials with rational coefficients","volume":"261","author":"Lenstra A. K.","unstructured":"A. K. Lenstra, H. W. Lenstra, and L. Lov\u00e1sz. [n.d.]. Factoring polynomials with rational coefficients. Math. Ann. 261 ([n.d.]), 515\u2013534. https:\/\/doi.org\/10.1007\/BF014","journal-title":"Math. Ann."},{"key":"e_1_3_2_99_2","first-page":"803","volume-title":"2011 7th International Conference on Computational Intelligence and Security","author":"Liang C.","year":"2011","unstructured":"C. Liang, C. Yongquan, T. Xueming, H. Dongping, and W. Xin. 2011. Hierarchical ID-based blind signature from lattices. In 2011 7th International Conference on Computational Intelligence and Security. 803\u2013807. DOI:https:\/\/doi.org\/10.1109\/CIS.2011.182"},{"key":"e_1_3_2_100_2","first-page":"613","volume-title":"Advances in Cryptology (CRYPTO\u201917), Proceedings, Part II (LNCS)","author":"Lindell Yehuda","year":"2017","unstructured":"Yehuda Lindell. 2017. Fast secure two-party ECDSA signing. In Advances in Cryptology (CRYPTO\u201917), Proceedings, Part II (LNCS). Springer, 613\u2013644."},{"key":"e_1_3_2_101_2","first-page":"325","volume-title":"Information Security and Privacy","author":"Liu Joseph K.","year":"2004","unstructured":"Joseph K. Liu, Victor K. Wei, and Duncan S. Wong. 2004. Linkable spontaneous anonymous group signature for ad hoc groups. In Information Security and Privacy, Huaxiong Wang, Josef Pieprzyk, and Vijay Varadharajan (Eds.). Springer, Berlin, 325\u2013335."},{"key":"e_1_3_2_102_2","first-page":"110","volume-title":"ACNS (LNCS)","author":"Lu Xingye","year":"2019","unstructured":"Xingye Lu, Man Ho Au, and Zhenfei Zhang. 2019. Raptor: A practical lattice-based (linkable) ring signature. In ACNS (LNCS), Vol. 11464. Springer, 110\u2013130."},{"key":"e_1_3_2_103_2","first-page":"598","volume-title":"ASIACRYPT","author":"Lyubashevsky Vadim","year":"2009","unstructured":"Vadim Lyubashevsky. 2009. Fiat-Shamir with aborts: Applications to lattice and factoring-based signatures. In ASIACRYPT. Springer, 598\u2013616."},{"key":"e_1_3_2_104_2","first-page":"738","volume-title":"Advances in Cryptology (EUROCRYPT\u201912), Proceedings (LNCS)","author":"Lyubashevsky Vadim","year":"2012","unstructured":"Vadim Lyubashevsky. 2012. Lattice signatures without trapdoors. In Advances in Cryptology (EUROCRYPT\u201912), Proceedings (LNCS). 738\u2013755."},{"key":"e_1_3_2_105_2","first-page":"144","volume-title":"ICALP (2) (Lecture Notes in Computer Science)","author":"Lyubashevsky Vadim","year":"2006","unstructured":"Vadim Lyubashevsky and Daniele Micciancio. 2006. Generalized compact knapsacks are collision resistant. In ICALP (2) (Lecture Notes in Computer Science), Vol. 4052. Springer, 144\u2013155."},{"key":"e_1_3_2_106_2","article-title":"SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions","author":"Lyubashevsky Vadim","year":"2021","unstructured":"Vadim Lyubashevsky, Ngoc Khanh Nguyen, and Gregor Seiler. 2021. SMILE: Set Membership from Ideal Lattices with Applications to Ring Signatures and Confidential Transactions. Cryptology ePrint Archive, Report 2021\/564. (2021). ia.cr\/2021\/564 (to appear at Crypto 2021).","journal-title":"Cryptology ePrint Archive, Report 2021\/564"},{"key":"e_1_3_2_107_2","first-page":"1","volume-title":"EUROCRYPT (Lecture Notes in Computer Science)","author":"Lyubashevsky Vadim","year":"2010","unstructured":"Vadim Lyubashevsky, Chris Peikert, and Oded Regev. 2010. On ideal lattices and learning with errors over rings. In EUROCRYPT (Lecture Notes in Computer Science), Vol. 6110. Springer, 1\u201323."},{"key":"e_1_3_2_108_2","first-page":"9","article-title":"Isogeny-based quantum-resistant undeniable blind signature scheme","volume":"20","author":"S. Srinath M.","year":"2018","unstructured":"Srinath M. S. and Venkatachalam Chandrasekaran. 2018. Isogeny-based quantum-resistant undeniable blind signature scheme. International Journal of Network Security 20 (2018), 9\u201318. DOI:https:\/\/doi.org\/10.6633\/IJNS.201801.20(1).02","journal-title":"International Journal of Network Security"},{"key":"e_1_3_2_109_2","doi-asserted-by":"crossref","first-page":"179765","DOI":"10.1109\/ACCESS.2019.2958816","article-title":"Practical lattice-based multisignature schemes for blockchains","volume":"7","author":"Ma Changshe","year":"2019","unstructured":"Changshe Ma and Mei Jiang. 2019. Practical lattice-based multisignature schemes for blockchains. IEEE Access 7 (2019), 179765\u2013179778.","journal-title":"IEEE Access"},{"key":"e_1_3_2_110_2","article-title":"An attack on SIDH with arbitrary starting curve","author":"Maino Luciano","year":"2022","unstructured":"Luciano Maino and Chloe Martindale. 2022. An attack on SIDH with arbitrary starting curve. Cryptology ePrint Archive, Paper 2022\/1026. (2022). https:\/\/eprint.iacr.org\/2022\/1026.","journal-title":"Cryptology ePrint Archive, Paper 2022\/1026"},{"key":"e_1_3_2_111_2","volume-title":"NDSS\u201919","author":"Malavolta Giulio","year":"2019","unstructured":"Giulio Malavolta, Pedro Moreno-Sanchez, Clara Schneidewind, Aniket Kate, and Matteo Maffei. 2019. Anonymous multi-hop locks for blockchain scalability and interoperability. In NDSS\u201919. https:\/\/www.ndss-symposium.org\/ndss-paper\/anonymous-multi-hop-locks-for-blockchain-scalability-and-interoperability\/."},{"key":"e_1_3_2_112_2","volume-title":"Theory of Computing","author":"Malkhi Dahlia","year":"1997","unstructured":"Dahlia Malkhi and Michael K. Reiter. 1997. Byzantine quorum systems. In Theory of Computing."},{"key":"e_1_3_2_113_2","first-page":"419","volume-title":"Advances in Cryptology (EUROCRYPT\u201988)","author":"Matsumoto Tsutomu","year":"1988","unstructured":"Tsutomu Matsumoto and Hideki Imai. 1988. Public quadratic polynomial-tuples for efficient signature-verification and message-encryption. In Advances in Cryptology (EUROCRYPT\u201988), D. Barstow, W. Brauer, P. Brinch Hansen, D. Gries, D. Luckham, C. Moler, A. Pnueli, G. Seegm\u00fcller, J.A Stoer, N. Wirth, and Christoph G. G\u00fcnther (Eds.). Springer, Berlin, 419\u2013453."},{"issue":"9","key":"e_1_3_2_114_2","doi-asserted-by":"crossref","first-page":"2139","DOI":"10.1007\/s10623-019-00608-x","article-title":"Simple Schnorr multi-signatures with applications to bitcoin","volume":"87","author":"Maxwell Gregory","year":"2019","unstructured":"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), 2139\u20132164.","journal-title":"Designs, Codes and Cryptography"},{"key":"e_1_3_2_115_2","first-page":"218","volume-title":"Advances in Cryptology (CRYPTO\u201989), 9th Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science)","volume":"435","author":"Merkle Ralph C.","year":"1989","unstructured":"Ralph C. Merkle. 1989. A certified digital signature. In Advances in Cryptology (CRYPTO\u201989), 9th Annual International Cryptology Conference, Proceedings (Lecture Notes in Computer Science), Gilles Brassard (Ed.), Vol. 435. Springer, 218\u2013238. DOI:https:\/\/doi.org\/10.1007\/0-387-34805-0_21"},{"key":"e_1_3_2_116_2","first-page":"496","volume-title":"Topics in Cryptology (CT-RSA\u201920)","author":"Merz Simon-Philipp","year":"2020","unstructured":"Simon-Philipp Merz, Romy Minko, and Christophe Petit. 2020. Another look at some isogeny hardness assumptions. In Topics in Cryptology (CT-RSA\u201920), Stanislaw Jarecki (Ed.). Springer International Publishing, Cham, 496\u2013511."},{"issue":"4","key":"e_1_3_2_117_2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s00037-007-0234-9","article-title":"Generalized compact knapsacks, cyclic lattices, and efficient one-way functions","volume":"16","author":"Micciancio Daniele","year":"2007","unstructured":"Daniele Micciancio. 2007. Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16, 4 (2007), 365\u2013411. DOI:https:\/\/doi.org\/10.1007\/s00037-007-0234-9","journal-title":"Comput. Complex."},{"key":"e_1_3_2_118_2","volume-title":"FC","author":"Mirzaei Arash","year":"2021","unstructured":"Arash Mirzaei, Amin Sakzad, Jiangshan Yu, and Ron Steinfeld. 2021. FPPW: A fair and privacy preserving watchtower for bitcoin. In FC."},{"key":"e_1_3_2_119_2","first-page":"3","volume-title":"Progress in Cryptology (AFRICACRYPT\u201917), Proceedings (LNCS)","volume":"10239","author":"Mohamed Mohamed Saied Emam","year":"2017","unstructured":"Mohamed Saied Emam Mohamed and Albrecht Petzoldt. 2017. RingRainbow - An efficient multivariate ring signature scheme. In Progress in Cryptology (AFRICACRYPT\u201917), Proceedings (LNCS), Marc Joye and Abderrahmane Nitaj (Eds.), Vol. 10239. 3\u201320."},{"issue":"3","key":"e_1_3_2_120_2","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1515\/popets-2018-0025","article-title":"An empirical analysis of traceability in the monero blockchain","volume":"2018","author":"M\u00f6ser Malte","year":"2018","unstructured":"Malte M\u00f6ser, Kyle Soska, Ethan Heilman, Kevin Lee, Henry Heffan, Shashvat Srivastava, Kyle Hogan, Jason Hennessey, Andrew Miller, Arvind Narayanan, and Nicolas Christin. 2018. An empirical analysis of traceability in the monero blockchain. PoPETs 2018, 3 (2018), 143\u2013163.","journal-title":"PoPETs"},{"key":"e_1_3_2_121_2","unstructured":"Satoshi Nakamoto. 2009. Bitcoin: A Peer-to-Peer Electronic Cash System. https:\/\/bitcoin.org"},{"key":"e_1_3_2_122_2","article-title":"Deconstructing blockchains: A comprehensive survey on consensus, membership and structure","volume":"1908","author":"Natoli Christopher","year":"2019","unstructured":"Christopher Natoli, Jiangshan Yu, Vincent Gramoli, and Paulo Jorge Esteves Ver\u00edssimo. 2019. Deconstructing blockchains: A comprehensive survey on consensus, membership and structure. CoRR abs\/1908.08316 (2019). http:\/\/arxiv.org\/abs\/1908.08316","journal-title":"CoRR"},{"key":"e_1_3_2_123_2","article-title":"Ring Signature Confidential Transactions for Monero","author":"Noether Shen","year":"2015","unstructured":"Shen Noether. 2015. Ring Signature Confidential Transactions for Monero. Cryptology ePrint Archive, Report 2015\/1098. (2015). ia.cr\/2015\/1098.","journal-title":"Cryptology ePrint Archive, Report 2015\/1098"},{"key":"e_1_3_2_124_2","article-title":"Leakage-Resilient Lattice-Based Partially Blind Signatures","author":"Papachristoudis D.","year":"2019","unstructured":"D. Papachristoudis, D. Hristu-Varsakelis, F. Baldimtsi, and G. Stephanides. 2019. Leakage-Resilient Lattice-Based Partially Blind Signatures. Cryptology ePrint Archive, Report 2019\/1452. (2019). \/eprint.iacr.org\/2019\/1452.","journal-title":"Cryptology ePrint Archive, Report 2019\/1452"},{"key":"e_1_3_2_125_2","first-page":"33","volume-title":"Advances in Cryptology (EUROCRYPT\u201996), Proceedings (Lecture Notes in Computer Science)","volume":"1070","author":"Patarin Jacques","year":"1996","unstructured":"Jacques Patarin. 1996. Hidden fields equations (HFE) and isomorphisms of polynomials (IP): Two new families of asymmetric algorithms. In Advances in Cryptology (EUROCRYPT\u201996), Proceedings (Lecture Notes in Computer Science), Ueli M. Maurer (Ed.), Vol. 1070. Springer, 33\u201348."},{"key":"e_1_3_2_126_2","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/3-540-45353-9_21","volume-title":"Topics in Cryptology (CT-RSA\u201901), The Cryptographer\u2019s Track at RSA 2001, Proceedings (LNCS)","volume":"2020","author":"Patarin Jacques","year":"2001","unstructured":"Jacques Patarin, Nicolas T. Courtois, and Louis Goubin. 2001. QUARTZ, 128-bit long digital signatures. In Topics in Cryptology (CT-RSA\u201901), The Cryptographer\u2019s Track at RSA 2001, Proceedings (LNCS), David Naccache (Ed.), Vol. 2020. Springer, 282\u2013297."},{"key":"e_1_3_2_127_2","first-page":"522","volume-title":"Advances in Cryptology (EUROCRYPT\u201991)","author":"Pedersen Torben Pryds","year":"1991","unstructured":"Torben Pryds Pedersen. 1991. A threshold cryptosystem without a trusted party. In Advances in Cryptology (EUROCRYPT\u201991), Donald W. Davies (Ed.). Springer, Berlin, 522\u2013526."},{"key":"e_1_3_2_128_2","unstructured":"Edwin Pednault John Gunnels Dmitri Maslov and Jay Gambetta. [n.d.]. On \u201cQuantum Supremacy.\u201dhttps:\/\/www.ibm.com\/blogs\/research\/2019\/10\/on-quantum-supremacy\/."},{"key":"e_1_3_2_129_2","first-page":"463","volume-title":"Advances in Cryptology (EUROCRYPT\u201920)","author":"Peikert Chris","year":"2020","unstructured":"Chris Peikert. 2020. He gives c-sieves on the CSIDH. In Advances in Cryptology (EUROCRYPT\u201920), Anne Canteaut and Yuval Ishai (Eds.). Springer International Publishing, Cham, 463\u2013492."},{"key":"e_1_3_2_130_2","first-page":"145","volume-title":"TCC (Lecture Notes in Computer Science)","author":"Peikert Chris","year":"2006","unstructured":"Chris Peikert and Alon Rosen. 2006. Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices. In TCC (Lecture Notes in Computer Science), Vol. 3876. Springer, 145\u2013166."},{"issue":"3","key":"e_1_3_2_131_2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00200-013-0190-3","article-title":"A multivariate based threshold ring signature scheme","volume":"24","author":"Petzoldt Albrecht","year":"2013","unstructured":"Albrecht Petzoldt, Stanislav Bulygin, and Johannes Buchmann. 2013. A multivariate based threshold ring signature scheme. Appl. Algebra Eng. Commun. Comput. 24, 3\u20134 (2013), 255\u2013275.","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"e_1_3_2_132_2","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/978-3-319-70972-7_25","volume-title":"Financial Cryptography and Data Security (FC\u201917), Revised Selected Papers (LNCS)","author":"Petzoldt Albrecht","year":"2017","unstructured":"Albrecht Petzoldt, Alan Szepieniec, and Mohamed Saied Emam Mohamed. 2017. A practical multivariate blind signature scheme. In Financial Cryptography and Data Security (FC\u201917), Revised Selected Papers (LNCS), Aggelos Kiayias (Ed.), Vol. 10322. Springer, 437\u2013454."},{"key":"e_1_3_2_133_2","unstructured":"Andrew Poelstra. [n.d.]. Adaptor signatures and atomic swaps from scriptless scripts. https:\/\/github.com\/ ElementsProject\/scriptless-scripts\/blob\/master\/md\/atomic-swap.md."},{"key":"e_1_3_2_134_2","article-title":"Scriptless Scripts","author":"Poelstra Andrew","unstructured":"Andrew Poelstra. [n.d.]. Scriptless Scripts. Presentation Slides. ([n.d.]). https:\/\/download.wpsoftware.net\/bitcoin\/wizardry\/mw-slides\/ 2017-05-milan-meetup\/slides.pdf.","journal-title":"Presentation Slides"},{"key":"e_1_3_2_135_2","first-page":"84","volume-title":"Proceedings of the 37th Annual ACM Symposium on Theory of Computing","author":"Regev Oded","year":"2005","unstructured":"Oded Regev. 2005. On lattices, learning with errors, random linear codes, and cryptography. In Proceedings of the 37th Annual ACM Symposium on Theory of Computing, Harold N. Gabow and Ronald Fagin (Eds.). ACM, 84\u201393. DOI:https:\/\/doi.org\/10.1145\/1060590.1060603"},{"key":"e_1_3_2_136_2","first-page":"552","volume-title":"Advances in Cryptology (ASIACRYPT\u201901)","author":"Rivest Ronald L.","year":"2001","unstructured":"Ronald L. Rivest, Adi Shamir, and Yael Tauman. 2001. How to leak a secret. In Advances in Cryptology (ASIACRYPT\u201901), Colin Boyd (Ed.). Springer, Berlin, 552\u2013565."},{"key":"e_1_3_2_137_2","article-title":"Breaking SIDH in polynomial time","author":"Robert Damien","year":"2022","unstructured":"Damien Robert. 2022. Breaking SIDH in polynomial time. Cryptology ePrint Archive, Paper 2022\/1038. (2022). https:\/\/eprint.iacr.org\/2022\/1038.","journal-title":"Cryptology ePrint Archive, Paper 2022\/1038"},{"key":"e_1_3_2_138_2","first-page":"413","volume-title":"Advances in Cryptology (ASIACRYPT\u201910), Proceedings (LNCS)","volume":"6477","author":"R\u00fcckert Markus","year":"2010","unstructured":"Markus R\u00fcckert. 2010. Lattice-based blind signatures. In Advances in Cryptology (ASIACRYPT\u201910), Proceedings (LNCS), Masayuki Abe (Ed.), Vol. 6477. Springer, 413\u2013430."},{"key":"e_1_3_2_139_2","article-title":"Supersingular Isogeny-Based Designated Verifier Blind Signature","author":"Sahu Rajeev Anand","year":"2019","unstructured":"Rajeev Anand Sahu, Agnese Gini, and Ankan Pal. 2019. Supersingular Isogeny-Based Designated Verifier Blind Signature. Cryptology ePrint Archive, Report 2019\/1498. (2019). https:\/\/eprint.iacr.org\/2019\/1498.","journal-title":"Cryptology ePrint Archive, Report 2019\/1498"},{"key":"e_1_3_2_140_2","first-page":"706","volume-title":"Advances in Cryptology (CRYPTO\u201911), Proceedings (LNCS)","volume":"6841","author":"Sakumoto Koichi","year":"2011","unstructured":"Koichi Sakumoto, Taizo Shirai, and Harunaga Hiwatari. 2011. Public-key identification schemes based on multivariate quadratic polynomials. In Advances in Cryptology (CRYPTO\u201911), Proceedings (LNCS), Phillip Rogaway (Ed.), Vol. 6841. Springer, 706\u2013723."},{"key":"e_1_3_2_141_2","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/0-387-34805-0_22","volume-title":"Advances in Cryptology (CRYPTO\u201989) Proceedings","author":"Schnorr C. P.","year":"1990","unstructured":"C. P. Schnorr. 1990. Efficient identification and signatures for smart cards. In Advances in Cryptology (CRYPTO\u201989) Proceedings, Gilles Brassard (Ed.). Springer, New York, NY, 239\u2013252."},{"issue":"11","key":"e_1_3_2_142_2","doi-asserted-by":"crossref","first-page":"612","DOI":"10.1145\/359168.359176","article-title":"How to share a secret","volume":"22","author":"Shamir Adi","year":"1979","unstructured":"Adi Shamir. 1979. How to share a secret. Commun. ACM 22, 11 (Nov.1979), 612\u2013613. DOI:https:\/\/doi.org\/10.1145\/359168.359176","journal-title":"Commun. ACM"},{"key":"e_1_3_2_143_2","first-page":"124","volume-title":"FOCS\u201994","author":"Shor Peter W.","year":"1994","unstructured":"Peter W. Shor. 1994. Algorithms for quantum computation: Discrete logarithms and factoring. In FOCS\u201994. IEEE Computer Society, 124\u2013134."},{"key":"e_1_3_2_144_2","first-page":"617","volume-title":"ASIACRYPT (Lecture Notes in Computer Science)","author":"Stehl\u00e9 Damien","year":"2009","unstructured":"Damien Stehl\u00e9, Ron Steinfeld, Keisuke Tanaka, and Keita Xagawa. 2009. Efficient public key encryption based on ideal lattices. In ASIACRYPT (Lecture Notes in Computer Science), Vol. 5912. Springer, 617\u2013635."},{"key":"e_1_3_2_145_2","first-page":"13","volume-title":"Advances in Cryptology (CRYPTO\u201993), Proceedings (LNCS)","volume":"773","author":"Stern Jacques","year":"1993","unstructured":"Jacques Stern. 1993. A new identification scheme based on syndrome decoding. In Advances in Cryptology (CRYPTO\u201993), Proceedings (LNCS), Douglas R. Stinson (Ed.), Vol. 773. Springer, 13\u201321."},{"key":"e_1_3_2_146_2","article-title":"Post-Quantum Adaptor Signature for Privacy-Preserving Off-Chain Payments","author":"Tairi Erkan","year":"2020","unstructured":"Erkan Tairi, Pedro Moreno-Sanchez, and Matteo Maffei. 2020. Post-Quantum Adaptor Signature for Privacy-Preserving Off-Chain Payments. Cryptology ePrint Archive, Report 2020\/1345. (2020). https:\/\/eprint.iacr.org\/2020\/1345.","journal-title":"Cryptology ePrint Archive, Report 2020\/1345"},{"key":"e_1_3_2_147_2","first-page":"755","volume-title":"Advances in Cryptology (EUROCRYPT\u201915)","author":"Unruh Dominique","year":"2015","unstructured":"Dominique Unruh. 2015. Non-interactive zero-knowledge proofs in the quantum random oracle model. In Advances in Cryptology (EUROCRYPT\u201915). 755\u2013784. DOI:https:\/\/doi.org\/10.1007\/978-3-662-46803-6_25"},{"key":"e_1_3_2_148_2","first-page":"112","volume-title":"Financial Cryptography and Data Security (FC\u201915) International Workshops, BITCOIN, WAHC, and Wearable, Revised Selected Papers (Lecture Notes in Computer Science)","author":"Valenta Luke","year":"2015","unstructured":"Luke Valenta and Brendan Rowan. 2015. Blindcoin: Blinded, accountable mixes for bitcoin. In Financial Cryptography and Data Security (FC\u201915) International Workshops, BITCOIN, WAHC, and Wearable, Revised Selected Papers (Lecture Notes in Computer Science), Michael Brenner, Nicolas Christin, Benjamin Johnson, and Kurt Rohloff (Eds.), Vol. 8976. Springer, 112\u2013126."},{"key":"e_1_3_2_149_2","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/978-3-662-48051-9_9","volume-title":"Financial Cryptography and Data Security","author":"Valenta Luke","year":"2015","unstructured":"Luke Valenta and Brendan Rowan. 2015. Blindcoin: Blinded, accountable mixes for bitcoin. In Financial Cryptography and Data Security, Michael Brenner, Nicolas Christin, Benjamin Johnson, and Kurt Rohloff (Eds.). Springer, Berlin, 112\u2013126."},{"key":"e_1_3_2_150_2","unstructured":"Nicolas van Saberhagen. 2012. CryptoNote v 1.0. https:\/\/cryptonote.org\/whitepaper_v1.pdf"},{"key":"e_1_3_2_151_2","first-page":"112","volume-title":"IFIPWG114 (LNCS)","author":"Vukolic Marko","year":"2015","unstructured":"Marko Vukolic. 2015. The quest for scalable blockchain fabric: Proof-of-work vs. BFT replication. In IFIPWG114 (LNCS), Jan Camenisch and Dogan Kesdogan (Eds.), Vol. 9591. Springer, 112\u2013125."},{"issue":"10","key":"e_1_3_2_152_2","doi-asserted-by":"crossref","first-page":"3973","DOI":"10.1016\/j.camwa.2011.09.052","article-title":"Ring signature scheme based on multivariate public key cryptosystems","volume":"62","author":"Wang Shangping","year":"2011","unstructured":"Shangping Wang, Rui Ma, Yaling Zhang, and Xiaofeng Wang. 2011. Ring signature scheme based on multivariate public key cryptosystems. Comput. Math. Appl. 62, 10 (2011), 3973\u20133979.","journal-title":"Comput. Math. Appl."},{"key":"e_1_3_2_153_2","first-page":"163","article-title":"Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ECDSA)","author":"X9.62-2005 American National Standard","year":"2005","unstructured":"American National Standard X9.62-2005. 2005. Public key cryptography for the financial services industry: The elliptic curve digital signature algorithm (ECDSA). ANSI X9 (2005), 163.","journal-title":"ANSI X9"},{"key":"e_1_3_2_154_2","first-page":"613","volume-title":"Proceedings of the 2019 ACM (AsiaCCS\u201919)","author":"Yi Xun","year":"2019","unstructured":"Xun Yi and Kwok-Yan Lam. 2019. A new blind ECDSA scheme for bitcoin transaction anonymity. In Proceedings of the 2019 ACM (AsiaCCS\u201919), Steven D. Galbraith, Giovanni Russello, Willy Susilo, Dieter Gollmann, Engin Kirda, and Zhenkai Liang (Eds.). ACM, 613\u2013620."},{"key":"e_1_3_2_155_2","volume-title":"Blockchain Foundations and Applications","author":"Yi Xun","year":"2022","unstructured":"Xun Yi, Xuechao Yang, Andrei Kelarev, Kwok Yan Lam, and Zahir Tari. 2022. Blockchain Foundations and Applications. Springer."},{"key":"e_1_3_2_156_2","first-page":"347","volume-title":"Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing","author":"Yin Maofan","year":"2019","unstructured":"Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan-Gueta, and Ittai Abraham. 2019. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing. 347\u2013356."},{"key":"e_1_3_2_157_2","first-page":"163","volume-title":"Financial Cryptography and Data Security","author":"Yoo Youngho","year":"2017","unstructured":"Youngho Yoo, Reza Azarderakhsh, Amir Jalali, David Jao, and Vladimir Soukharev. 2017. A post-quantum digital signature scheme based on supersingular isogenies. In Financial Cryptography and Data Security, Aggelos Kiayias (Ed.). Springer International Publishing, Cham, 163\u2013181."},{"key":"e_1_3_2_158_2","doi-asserted-by":"crossref","unstructured":"Jiangshan Yu Man Ho Allen Au and Paulo Jorge Esteves Ver\u00edssimo. 2019. Re-thinking untraceability in the cryptonote-style blockchain. In IEEE CSF . 94\u2013107.","DOI":"10.1109\/CSF.2019.00014"},{"key":"e_1_3_2_159_2","article-title":"RepuCoin: Your reputation is your power","author":"Yu Jiangshan","year":"2019","unstructured":"Jiangshan Yu, David Kozhaya, Jeremie Decouchant, and Paulo Esteves-Verissimo. 2019. RepuCoin: Your reputation is your power. IEEE Transactions on Computers (ToC) 68 (2019), 1225\u20131237.","journal-title":"IEEE Transactions on Computers (ToC)"},{"key":"e_1_3_2_160_2","first-page":"133","volume-title":"Financial Cryptography and Data Security (FC\u201919), Revised Selected Papers (Lecture Notes in Computer Science)","author":"Yu Zuoxia","year":"2019","unstructured":"Zuoxia Yu, Man Ho Au, Jiangshan Yu, Rupeng Yang, Qiuliang Xu, and Wang Fat Lau. 2019. New empirical traceability analysis of cryptonote-style blockchains. In Financial Cryptography and Data Security (FC\u201919), Revised Selected Papers (Lecture Notes in Computer Science), Ian Goldberg and Tyler Moore (Eds.), Vol. 11598. Springer, 133\u2013149."},{"key":"e_1_3_2_161_2","first-page":"251","volume-title":"CRYPTO (1) (Lecture Notes in Computer Science)","author":"Yuen Tsz Hon","year":"2021","unstructured":"Tsz Hon Yuen, Muhammed F. Esgin, Joseph K. Liu, Man Ho Au, and Zhimin Ding. 2021. DualRing: Generic construction of ring signatures with efficient instantiations. In CRYPTO (1) (Lecture Notes in Computer Science), Vol. 12825. Springer, 251\u2013281."},{"issue":"2","key":"e_1_3_2_162_2","first-page":"154","article-title":"Code-based ring signature scheme","volume":"5","author":"Zheng Dong","year":"2007","unstructured":"Dong Zheng, Xiangxue Li, and Kefei Chen. 2007. Code-based ring signature scheme. Int. J. Netw. Secur. 5, 2 (2007), 154\u2013157.","journal-title":"Int. J. Netw. Secur."},{"key":"e_1_3_2_163_2","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/j.future.2017.01.031","article-title":"A round-optimal lattice-based blind signature scheme for cloud services","volume":"73","author":"Zhu Hongfei","year":"2017","unstructured":"Hongfei Zhu, Yu an Tan, Xiaosong Zhang, Liehuang Zhu, Changyou Zhang, and Jun Zheng. 2017. A round-optimal lattice-based blind signature scheme for cloud services. Future Generation Computer Systems 73 (2017), 106\u2013114. DOI:https:\/\/doi.org\/10.1016\/j.future.2017.01.031","journal-title":"Future Generation Computer Systems"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572771","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3572771","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:51:08Z","timestamp":1750182668000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3572771"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,2]]},"references-count":162,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2023,12,31]]}},"alternative-id":["10.1145\/3572771"],"URL":"https:\/\/doi.org\/10.1145\/3572771","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,2]]},"assertion":[{"value":"2022-02-06","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-11-08","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-03-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}