{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:15:02Z","timestamp":1778152502403,"version":"3.51.4"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032046994","type":"print"},{"value":"9783032047007","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T00:00:00Z","timestamp":1757548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-04700-7_30","type":"book-chapter","created":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:36Z","timestamp":1758498336000},"page":"406-419","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cyclic Equalizability of\u00a0Words and\u00a0Its Application to\u00a0Card-Based Cryptography"],"prefix":"10.1007","author":[{"given":"Kazumasa","family":"Shinagawa","sequence":"first","affiliation":[]},{"given":"Koji","family":"Nuida","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,9,11]]},"reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-46885-4_23","volume-title":"Advances in Cryptology \u2014 EUROCRYPT \u201989","author":"B Boer","year":"1990","unstructured":"Boer, B.: More efficient match-making and satisfiability the five card trick. In: Quisquater, J.-J., Vandewalle, J. (eds.) EUROCRYPT 1989. LNCS, vol. 434, pp. 208\u2013217. Springer, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_23"},{"key":"30_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/3-540-48329-2_27","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 93","author":"C Cr\u00e9peau","year":"1994","unstructured":"Cr\u00e9peau, C., Kilian, J.: Discreet solitary games. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 319\u2013330. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-48329-2_27"},{"issue":"1","key":"30_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/s00165-013-0274-7","volume":"26","author":"J Heather","year":"2014","unstructured":"Heather, J., Schneider, S., Teague, V.: Cryptographic protocols with everyday objects. Formal Aspects Comput. 26(1), 37\u201362 (2014)","journal-title":"Formal Aspects Comput."},{"issue":"5","key":"30_CR4","doi-asserted-by":"publisher","first-page":"2174","DOI":"10.1080\/00927872.2023.2285908","volume":"52","author":"K Kanai","year":"2024","unstructured":"Kanai, K., Miyamoto, K., Nuida, K., Shinagawa, K.: Uniform cyclic group factorizations of finite groups. Comm. Algebra 52(5), 2174\u20132184 (2024)","journal-title":"Comm. Algebra"},{"key":"30_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-319-70700-6_5","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2017","author":"J Kastner","year":"2017","unstructured":"Kastner, J., Koch, A., Walzer, S., Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: The minimum number of cards in practical card-based protocols. In: Takagi, T., Peyrin, T. (eds.) ASIACRYPT 2017. LNCS, vol. 10626, pp. 126\u2013155. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-70700-6_5"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/978-3-030-34578-5_18","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2019","author":"A Koch","year":"2019","unstructured":"Koch, A., Schrempp, M., Kirsten, M.: Card-based cryptography meets formal verification. In: Galbraith, S.D., Moriai, S. (eds.) ASIACRYPT 2019. LNCS, vol. 11921, pp. 488\u2013517. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34578-5_18"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/978-3-662-48797-6_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Koch","year":"2015","unstructured":"Koch, A., Walzer, S., H\u00e4rtel, K.: Card-based cryptographic protocols using a minimal number of cards. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 783\u2013807. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_32"},{"key":"30_CR8","volume-title":"Combinatorics on Words","author":"M Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words, vol. 17. Addison Wesley, Boston (1983)"},{"key":"30_CR9","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words, vol. 90. Cambridge University Press, Cambridge (2002)"},{"key":"30_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words","author":"M Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words, vol. 105. Cambridge University Press, Cambridge (2005)"},{"issue":"1","key":"30_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/s10207-013-0219-4","volume":"13","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: A formalization of card-based cryptographic protocols via abstract machine. Int. J. Inf. Secur. 13(1), 15\u201323 (2014)","journal-title":"Int. J. Inf. Secur."},{"key":"30_CR12","unstructured":"Shinagawa, K.,\u00a0Kanai, K.,\u00a0Miyamoto, K.,\u00a0Nuida, K.: How to covertly and uniformly scramble the 15 puzzle and rubik\u2019s cube. In: Broder, A.Z.,\u00a0Tamir, T. (eds.) Fun with Algorithms, vol. 291 of LIPIcs, pp. 30:1\u201330:15. Schloss Dagstuhl, Dagstuhl (2024)"},{"key":"30_CR13","series-title":"LNCS","first-page":"123","volume-title":"Information Security and Cryptology","author":"K Shinagawa","year":"2018","unstructured":"Shinagawa, K., Mizuki, T.: The six-card trick: secure computation of three-input equality. In: Lee, K. (ed.) Information Security and Cryptology. LNCS, vol. 11396, pp. 123\u2013131. Springer, Cham (2018)"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1016\/j.dam.2020.10.013","volume":"289","author":"K Shinagawa","year":"2021","unstructured":"Shinagawa, K., Nuida, K.: A single shuffle is enough for secure card-based computation of any Boolean circuit. Disc. Appl. Math. 289, 248\u2013261 (2021)","journal-title":"Disc. Appl. Math."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Suga, Y.: A classification proof for commutative three-element semigroups with local AND structure and its application to card-based protocols. In: 2022 IEEE International Conference on Consumer Electronics - Taiwan, pp. 171\u2013172. IEEE (2022)","DOI":"10.1109\/ICCE-Taiwan55306.2022.9869063"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-04700-7_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T23:45:38Z","timestamp":1758498338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-04700-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,11]]},"ISBN":["9783032046994","9783032047007"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-04700-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,9,11]]},"assertion":[{"value":"11 September 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FCT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Fundamentals of Computation Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Wroc\u0142aw","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 September 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fct2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/fct.ii.uni.wroc.pl","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}