{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,20]],"date-time":"2026-02-20T19:04:18Z","timestamp":1771614258544,"version":"3.50.1"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031400025","type":"print"},{"value":"9783031400032","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-40003-2_5","type":"book-chapter","created":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:04Z","timestamp":1691586184000},"page":"113-138","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["SPDH-Sign: Towards Efficient, Post-quantum Group-Based Signatures"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Battarbee","sequence":"first","affiliation":[]},{"given":"Delaram","family":"Kahrobaei","sequence":"additional","affiliation":[]},{"given":"Ludovic","family":"Perret","sequence":"additional","affiliation":[]},{"given":"Siamak F.","family":"Shahandashti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,8,10]]},"reference":[{"key":"5_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1007\/3-540-46035-7_28","volume-title":"Advances in Cryptology \u2014 EUROCRYPT 2002","author":"M Abdalla","year":"2002","unstructured":"Abdalla, M., An, J.H., Bellare, M., Namprempre, C.: From identification to signatures via the Fiat-Shamir transform: minimizing assumptions for security and forward-security. In: Knudsen, L.R. (ed.) EUROCRYPT 2002. LNCS, vol. 2332, pp. 418\u2013433. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46035-7_28"},{"key":"5_CR2","unstructured":"Battarbee, C., Kahrobaei, D., Perret, L., Shahandashti, S.F.: A subexponential quantum algorithm for the semdirect discrete logarithm problem. In: 4th PQC NIST Conference 2022, pp. 1\u201327 (2022). https:\/\/csrc.nist.gov\/csrc\/media\/Events\/2022\/fourth-pqc-standardizationconference\/documents\/papers\/a-subexpoenential-quantum-algorithm-pqc2022.pdf"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-030-34578-5_9","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"W Beullens","year":"2019","unstructured":"Beullens, W., Kleinjung, T., Vercauteren, F.: CSI-FiSh: efficient isogeny based signatures through class group computations. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 227\u2013247. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_9"},{"key":"5_CR4","unstructured":"Boneh, D., Shoup, V.: A graduate course in applied cryptography. Draft 0.5 (2020)"},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1515\/jmc-2021-0016","volume":"16","author":"D Brown","year":"2022","unstructured":"Brown, D., Koblitz, N., Legrow, J.: Cryptanalysis of \u2018MAKE\u2019. J. Math. Cryptol. 16(1), 98\u2013102 (2022)","journal-title":"J. Math. Cryptol."},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/978-3-030-03332-3_15","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2018","author":"W Castryck","year":"2018","unstructured":"Castryck, W., Lange, T., Martindale, C., Panny, L., Renes, J.: CSIDH: an efficient post-quantum commutative group action. In: Peyrin, T., Galbraith, S. (eds.) ASIACRYPT 2018. LNCS, vol. 11274, pp. 395\u2013427. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03332-3_15"},{"issue":"1","key":"5_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1515\/jmc-2012-0016","volume":"8","author":"A Childs","year":"2014","unstructured":"Childs, A., Jao, D., Soukharev, V.: Constructing elliptic curve isogenies in quantum subexponential time. J. Math. Cryptol. 8(1), 1\u201329 (2014)","journal-title":"J. Math. Cryptol."},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1103\/RevModPhys.82.1","volume":"82","author":"AM Childs","year":"2010","unstructured":"Childs, A.M., Van Dam, W.: Quantum algorithms for algebraic problems. Rev. Mod. Phys. 82(1), 1 (2010)","journal-title":"Rev. Mod. Phys."},{"key":"5_CR9","unstructured":"Conrad, K.: Groups of Order p$$^{3}$$. https:\/\/kconrad.math.uconn.edu\/blurbs\/grouptheory\/groupsp3.pdf"},{"key":"5_CR10","unstructured":"Couveignes, J.-M.: Hard homogeneous spaces. Cryptology ePrint Archive (2006). https:\/\/eprint.iacr.org\/2006\/291.pdf"},{"key":"5_CR11","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s00013-008-2583-2","volume":"90","author":"MJ Curran","year":"2008","unstructured":"Curran, M.J.: The automorphism group of a nonsplit metacyclic p-group. Arch. Math. 90, 483\u2013489 (2008)","journal-title":"Arch. Math."},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1007\/978-3-030-17659-4_26","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2019","author":"L De Feo","year":"2019","unstructured":"De Feo, L., Galbraith, S.D.: SeaSign: compact isogeny signatures from class group actions. In: Ishai, Y., Rijmen, V. (eds.) EUROCRYPT 2019. LNCS, vol. 11478, pp. 759\u2013789. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17659-4_26"},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Duman, J., Hartmann, D., Kiltz, E., Kunzweiler, S., Lehmann, J., Riepel, D.: Generic models for group actions. Cryptology ePrint Archive (2023). https:\/\/eprint.iacr.org\/2022\/1230","DOI":"10.1007\/978-3-031-31368-4_15"},{"key":"5_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-47721-7_12","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 86","author":"A Fiat","year":"1987","unstructured":"Fiat, A., Shamir, A.: How to prove yourself: practical solutions to identification and signature problems. In: Odlyzko, A.M. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186\u2013194. Springer, Heidelberg (1987). https:\/\/doi.org\/10.1007\/3-540-47721-7_12"},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-642-38980-1_30","volume-title":"Applied Cryptography and Network Security","author":"M Habeeb","year":"2013","unstructured":"Habeeb, M., Kahrobaei, D., Koupparis, C., Shpilrain, V.: Public key exchange using semidirect product of (semi)groups. In: Jacobson, M., Locasto, M., Mohassel, P., Safavi-Naini, R. (eds.) ACNS 2013. LNCS, vol. 7954, pp. 475\u2013486. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38980-1_30"},{"issue":"1","key":"5_CR16","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1515\/jmc-2021-0049","volume":"16","author":"J Han","year":"2022","unstructured":"Han, J., Zhuang, J.: DLP in semigroups: algorithms and lower bounds. J. Math. Cryptol. 16(1), 278\u2013288 (2022)","journal-title":"J. Math. Cryptol."},{"key":"5_CR17","first-page":"89","volume":"21","author":"GJ Janusz","year":"1971","unstructured":"Janusz, G.J.: Faithful representations of p-Groups at characteristic p. Represent. Theory Finite Groups Relat. Top. 21, 89 (1971)","journal-title":"Represent. Theory Finite Groups Relat. Top."},{"issue":"5","key":"5_CR18","first-page":"752","volume":"70","author":"D Kahrobaei","year":"2023","unstructured":"Kahrobaei, D., Flores, R., Noce, M.: Group-based cryptography in the quantum era. Not. Am. Math. Soc. 70(5), 752\u2013763 (2023)","journal-title":"Not. Am. Math. Soc."},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Kahrobaei, D., Flores, R., Noce, M., Habeeb, M., Battarbee, C.: Applications of Group Theory in Cryptography: Post-quantum Group-based Cryptography. The Mathematical Surveys and Monographs Series of the American Mathematical Society (2023, forthcoming)","DOI":"10.1090\/noti2684"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-319-40189-8_14","volume-title":"Pursuit of the Universal","author":"D Kahrobaei","year":"2016","unstructured":"Kahrobaei, D., Shpilrain, V.: Using semidirect product of (semi)groups in public key cryptography. In: Beckmann, A., Bienvenu, L., Jonoska, N. (eds.) CiE 2016. LNCS, vol. 9709, pp. 132\u2013141. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40189-8_14"},{"issue":"1","key":"5_CR21","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170\u2013188 (2005)","journal-title":"SIAM J. Comput."},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-10366-7_35","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2009","author":"V Lyubashevsky","year":"2009","unstructured":"Lyubashevsky, V.: Fiat-Shamir with aborts: applications to lattice and factoring-based signatures. In: Matsui, M. (ed.) ASIACRYPT 2009. LNCS, vol. 5912, pp. 598\u2013616. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-10366-7_35"},{"key":"5_CR23","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1080\/09720529.2013.876783","volume":"18","author":"A Mahalanobis","year":"2015","unstructured":"Mahalanobis, A.: The MOR cryptosystem and extra-special p-groups. J. Discret. Math. Sci. Cryptogr. 18, 201\u2013208 (2015)","journal-title":"J. Discret. Math. Sci. Cryptogr."},{"key":"5_CR24","unstructured":"Maze, G., Monico, C., Rosenthal, J.: Public key cryptography based on semigroup actions. arXiv preprint cs\/0501017 (2005). SPDHSign 27"},{"key":"5_CR25","unstructured":"Monico, C.: Remarks on MOBS and cryptosystems using semidirect products. arXiv preprint arXiv:2109.11426 (2021)"},{"key":"5_CR26","unstructured":"Monico, C., Mahalanobis, A.: A remark on MAKE\u2013a matrix action key exchange. arXiv preprint arXiv:2012.00283 (2020)"},{"key":"5_CR27","unstructured":"Monico, C.J.: Semirings and semigroup actions in public-key cryptography. University of Notre Dame (2002)"},{"key":"5_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-031-22963-3_1","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2022","author":"H Montgomery","year":"2022","unstructured":"Montgomery, H., Zhandry, M.: Full quantum equivalence of group action DLog and CDH, and more. In: Agrawal, S., Lin, D. (eds.) ASIACRYPT 2022. LNCS, vol. 13791, pp. 3\u201332. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-22963-3_1 ISBN 978-3-031-22962-6"},{"issue":"1","key":"5_CR29","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1515\/gcc-2015-0007","volume":"7","author":"A Myasnikov","year":"2015","unstructured":"Myasnikov, A., Roman\u2019kov, V.: A linear decomposition attack. Groups Complex. Cryptol. 7(1), 81\u201394 (2015)","journal-title":"Groups Complex. Cryptol."},{"key":"5_CR30","unstructured":"PQC Standardization Process: Announcing Four Candidates to be Standardized, Plus Fourth Round Candidates. https:\/\/csrc.nist.gov\/News\/2022\/pqc-candidates-to-be-standardized-and-round-4#newcall"},{"issue":"1","key":"5_CR31","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1515\/jmc-2020-0053","volume":"16","author":"N Rahman","year":"2022","unstructured":"Rahman, N., Shpilrain, V.: MAKE: a matrix action key exchange. J. Math. Cryptol. 16(1), 64\u201372 (2022)","journal-title":"J. Math. Cryptol."},{"key":"5_CR32","unstructured":"Rahman, N., Shpilrain, V.: MOBS: matrices over bit strings public key exchange (2021). https:\/\/eprint.iacr.org\/2021\/560"},{"key":"5_CR33","unstructured":"Roman\u2019kov, V.: Linear decomposition attack on public key exchange protocols using semidirect products of (semi) groups arXiv preprint arXiv:1501.01152 (2015)"},{"key":"5_CR34","unstructured":"Rostovtsev, A., Stolbunov, A.: Public-key cryptosystem based on isogenies. Cryptology ePrint Archive (2006). https:\/\/eprint.iacr.org\/2006\/145"},{"issue":"2","key":"5_CR35","doi-asserted-by":"publisher","first-page":"215","DOI":"10.3934\/amc.2010.4.215","volume":"4","author":"A Stolbunov","year":"2010","unstructured":"Stolbunov, A.: Constructing public-key cryptographic schemes based on class group action on a set of isogenous elliptic curves. Adv. Math. Commun. 4(2), 215\u2013235 (2010)","journal-title":"Adv. Math. Commun."},{"key":"5_CR36","doi-asserted-by":"publisher","unstructured":"Stolbunov, A.: Cryptographic schemes based on isogenies. Ph.D. thesis (2012). https:\/\/doi.org\/10.13140\/RG.2.2.20826.44488","DOI":"10.13140\/RG.2.2.20826.44488"}],"container-title":["Lecture Notes in Computer Science","Post-Quantum Cryptography"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-40003-2_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,9]],"date-time":"2023-08-09T13:03:46Z","timestamp":1691586226000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-40003-2_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031400025","9783031400032"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-40003-2_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"10 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PQCrypto","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Post-Quantum Cryptography","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"College Park, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 August 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pqcrypto2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/pqcrypto2023.umiacs.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"51","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"49% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.16","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.30","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}