{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,11]],"date-time":"2024-05-11T00:11:40Z","timestamp":1715386300723},"reference-count":13,"publisher":"Institute of Electronics, Information and Communications Engineers (IEICE)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEICE Trans. Fundamentals"],"published-print":{"date-parts":[[2023,3,1]]},"DOI":"10.1587\/transfun.2022cip0020","type":"journal-article","created":{"date-parts":[[2022,9,11]],"date-time":"2022-09-11T22:11:20Z","timestamp":1662934280000},"page":"306-314","source":"Crossref","is-referenced-by-count":2,"title":["Automorphism Shuffles for Graphs and Hypergraphs and Its Applications"],"prefix":"10.1587","volume":"E106.A","author":[{"given":"Kazumasa","family":"SHINAGAWA","sequence":"first","affiliation":[{"name":"Ibaraki University"},{"name":"National Institute of Advanced Industrial Science and Technology (AIST)"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kengo","family":"MIYAMOTO","sequence":"additional","affiliation":[{"name":"Ibaraki University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"532","reference":[{"key":"1","unstructured":"[2] E. Cheung, C. Hawthorne, and P. Lee, \u201cCs 758 project: Secure computation with playing cards,\u201d 2013. https:\/\/cdchawthorne.com\/writings\/secure_playing_cards.pdf"},{"key":"2","unstructured":"[3] B. den Boer, \u201cMore efficient match-making and satisfiability: <i>The Five Card Trick<\/i>,\u201d Advances in Cryptology-EUROCRYPT &apos;89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, J. Quisquater and J. Vandewalle, eds., volume 434 of Lecture Notes in Computer Science, pp.208-217. Springer, 1989. 10.1007\/3-540-46885-4_23"},{"key":"3","doi-asserted-by":"crossref","unstructured":"[4] R. Ishikawa, E. Chida, and T. Mizuki, \u201cEfficient card-based protocols for generating a hidden random permutation without fixed points,\u201d Unconventional Computation and Natural Computation-14th International Conference, UCNC 2015, Auckland, New Zealand, Aug. 30-Sept. 3, 2015, Proceedings, C.S. Calude and M.J. Dinneen, eds., volume 9252 of Lecture Notes in Computer Science, pp.215-226. Springer, 2015. 10.1007\/978-3-319-21819-9_16","DOI":"10.1007\/978-3-319-21819-9_16"},{"key":"4","unstructured":"[5] A. Koch and S. Walzer, \u201cFoundations for actively secure card-based cryptography,\u201d FUN 2021, volume 157 of LIPIcs, pp.17:1-17:23, Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, 2021. 10.4230\/LIPIcs.FUN.2021.17"},{"key":"5","doi-asserted-by":"crossref","unstructured":"[6] A. Koch, S. Walzer, and K. H\u00e4rtel, \u201cCard-based cryptographic protocols using a minimal number of cards,\u201d Advances in Cryptology-ASIACRYPT 2015-21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, Nov. 29-Dec. 3, 2015, Proceedings, Part I, T. Iwata and J.H. Cheon, eds., volume 9452 of Lecture Notes in Computer Science, pp.783-807, Springer, 2015. 10.1007\/978-3-662-48797-6_32","DOI":"10.1007\/978-3-662-48797-6_32"},{"key":"6","unstructured":"[7] A. Marcedone, Z. Wen, and E. Shi, \u201cSecure dating with four or fewer cards,\u201d Cryptology ePrint Archive, Report 2015\/1031, 2015."},{"key":"7","doi-asserted-by":"publisher","unstructured":"[8] K. Miyamoto and K. Shinagawa, \u201cGraph automorphism shuffles from pile-scramble shuffles,\u201d New Gener. Comput., vol.40, no.1, pp.199-223, 2022. 10.1007\/s00354-022-00164-4","DOI":"10.1007\/s00354-022-00164-4"},{"key":"8","unstructured":"[9] T. Mizuki, \u201cApplications of card-based cryptography to education,\u201d IEICE Technical Report, vol.116, no.289, pp.13-17, 2016 (in Japanese)."},{"key":"9","doi-asserted-by":"publisher","unstructured":"[10] T. Mizuki and H. Shizuya, \u201cA formalization of card-based cryptographic protocols via abstract machine,\u201d Int. J. Inf. Secur., vol.13, no.1, pp.15-23, 2014. 10.1007\/s10207-013-0219-4","DOI":"10.1007\/s10207-013-0219-4"},{"key":"10","doi-asserted-by":"crossref","unstructured":"[11] T. Mizuki and H. Sone, \u201cSix-card secure AND and four-card secure XOR,\u201d Frontiers in Algorithmics, Third International Workshop, FAW 2009, Hefei, China, June 20-23, 2009. Proceedings, X. Deng, J.E. Hopcroft, and J. Xue, eds., volume 5598 of Lecture Notes in Computer Science, pp.358-369, Springer, 2009. 10.1007\/978-3-642-02270-8_36","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"11","doi-asserted-by":"crossref","unstructured":"[12] T. Saito, D. Miyahara, Y. Abe, T. Mizuki, and H. Shizuya, \u201cHow to implement a non-uniform or non-closed shuffle,\u201d Theory and Practice of Natural Computing-9th International Conference, TPNC 2020, Taoyuan, Taiwan, Dec. 7-9, 2020, Proceedings, C. Mart\u00edn-Vide M.A. Vega-Rodr\u00edguez, and M. Yang, eds., volume 12494 of Lecture Notes in Computer Science, pp.107-118, Springer, 2020. 10.1007\/978-3-030-63000-3_9","DOI":"10.1007\/978-3-030-63000-3_9"},{"key":"12","unstructured":"[13] K. Shinagawa, \u201cA report on a lecture for elementary and junior high school using card-based cryptography,\u201d The Symposium on Cryptography and Information Security, 2F4-4, 2022 (in Japanese)."},{"key":"13","doi-asserted-by":"crossref","unstructured":"[14] K. Shinagawa, T. Mizuki, J.C.N. Schuldt, K. Nuida, N. Kanayama, T. Nishide, G. Hanaoka, and E. Okamoto, \u201cMulti-party computation with small shuffle complexity using regular polygon cards,\u201d Provable Security-9th International Conference, ProvSec 2015, Kanazawa, Japan, Nov. 24-26, 2015, Proceedings, M.H. Au and A. Miyaji, eds., volume 9451 of Lecture Notes in Computer Science, pp.127-146, Springer, 2015. 10.1007\/978-3-319-26059-4_7","DOI":"10.1007\/978-3-319-26059-4_7"}],"container-title":["IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0020\/_pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,10]],"date-time":"2024-05-10T05:09:03Z","timestamp":1715317743000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.jstage.jst.go.jp\/article\/transfun\/E106.A\/3\/E106.A_2022CIP0020\/_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,1]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023]]}},"URL":"https:\/\/doi.org\/10.1587\/transfun.2022cip0020","relation":{},"ISSN":["0916-8508","1745-1337"],"issn-type":[{"value":"0916-8508","type":"print"},{"value":"1745-1337","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3,1]]},"article-number":"2022CIP0020"}}