{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T14:17:06Z","timestamp":1772893026265,"version":"3.50.1"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783031212796","type":"print"},{"value":"9783031212802","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21280-2_30","type":"book-chapter","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T08:30:15Z","timestamp":1668760215000},"page":"537-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Physical Zero-Knowledge Proof Protocol for\u00a0Topswops"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5121-3458","authenticated-orcid":false,"given":"Yuichi","family":"Komano","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-1043","authenticated-orcid":false,"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","unstructured":"Bulteau, L., Fertin, G., Rusu, I.: Pancake flipping is hard. J. Comput. Syst. Sci. 81(8), 1556\u20131574 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.02.003, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000015000124","DOI":"10.1016\/j.jcss.2015.02.003"},{"key":"30_CR2","unstructured":"Bultel, X., Dreier, J., Dumas, J.G., Lafourcade, P.: Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen. In: Demaine, E.D., Grandoni, F. (eds.) Fun with Algorithms. LIPIcs, vol. 49, pp. 8:1\u20138:20. Schloss Dagstuhl, Dagstuhl, Germany (2016). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2016.8"},{"key":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-030-03232-6_8","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"X Bultel","year":"2018","unstructured":"Bultel, X., et al.: Physical zero-knowledge proof for Makaro. In: Izumi, T., Kuznetsov, P. (eds.) SSS 2018. LNCS, vol. 11201, pp. 111\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03232-6_8"},{"key":"30_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13122-6_12","volume-title":"Fun with Algorithms","author":"Y-F Chien","year":"2010","unstructured":"Chien, Y.-F., Hon, W.-K.: Cryptographic and physical zero-knowledge proof: from Sudoku to Nonogram. In: Boldi, P., Gargano, L. (eds.) FUN 2010. LNCS, vol. 6099, pp. 102\u2013112. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-13122-6_12"},{"key":"30_CR5","doi-asserted-by":"publisher","unstructured":"Chitturi, B., et al.: An (18\/11)n upper bound for sorting by prefix reversals. Theor. Comput. Sci. 410(36), 3372\u20133390 (2009). https:\/\/doi.org\/10.1016\/j.tcs.2008.04.045, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397508003575, graphs, Games and Computation: Dedicated to Professor Burkhard Monien on the Occasion of his 65th Birthday","DOI":"10.1016\/j.tcs.2008.04.045"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-030-26176-4_14","volume-title":"Computing and Combinatorics","author":"J-G Dumas","year":"2019","unstructured":"Dumas, J.-G., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for Norinori. In: Du, D.-Z., Duan, Z., Tian, C. (eds.) COCOON 2019. LNCS, vol. 11653, pp. 166\u2013177. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-26176-4_14"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0012-365X(79)90068-2","volume":"27","author":"WH Gates","year":"1979","unstructured":"Gates, W.H., Papadimitriou, C.H.: Bounds for sorting by prefix reversal. Discret. Math. 27(1), 47\u201357 (1979). https:\/\/doi.org\/10.1016\/0012-365X(79)90068-2","journal-title":"Discret. Math."},{"key":"30_CR8","doi-asserted-by":"publisher","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof-systems. In: Annual ACM Symposium on Theory of Computing, pp. 291\u2013304. STOC 1985, ACM, New York (1985). https:\/\/doi.org\/10.1145\/22145.22178","DOI":"10.1145\/22145.22178"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-031-17433-9_19","volume-title":"AFRICACRYPT 2022","author":"R Haga","year":"2022","unstructured":"Haga, R., Hayashi, Y., Miyahara, D., Mizuki, T.: Card-Minimal Protocols for Three-Input Functions with Standard Playing Cards. In: Batina, L., Daemen, J. (eds.) AFRICACRYPT 2022. Lecture Notes in Computer Science, vol. 13503, pp. 448\u2013468. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17433-9_19"},{"key":"30_CR10","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1007\/978-3-031-15255-9_12","volume-title":"Advances in Information and Computer Security","author":"R Haga","year":"2022","unstructured":"Haga, R., Toyoda, K., Shinoda, Y., Miyahara, D., Shinagawa, K., Hayashi, Y., Mizuki, T.: Card-based secure sorting protocol. In: Cheng, C.M., Akiyama, M. (eds.) Advances in Information and Computer Security. LNCS, vol. 13504, pp. 224\u2013240. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15255-9_12"},{"key":"30_CR11","doi-asserted-by":"publisher","unstructured":"Hashimoto, Y., Nuida, K., Shinagawa, K., Inamura, M., Hanaoka, G.: Toward finite-runtime card-based protocol for generating a hidden random permutation without fixed points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E101.A(9), 1503\u20131511 (2018). https:\/\/doi.org\/10.1587\/transfun.E101.A.1503","DOI":"10.1587\/transfun.E101.A.1503"},{"key":"30_CR12","doi-asserted-by":"publisher","unstructured":"Heydari, M.H., Sudborough, I.: On the diameter of the pancake network. J. Algorithms 25(1), 67\u201394 (1997). https:\/\/doi.org\/10.1006\/jagm.1997.0874, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677497908749","DOI":"10.1006\/jagm.1997.0874"},{"key":"30_CR13","doi-asserted-by":"publisher","unstructured":"Ibaraki, T., Manabe, Y.: A more efficient card-based protocol for generating a random permutation without fixed points. In: Mathematics and Computers in Sciences and in Industry (MCSI), pp. 252\u2013257 (2016). https:\/\/doi.org\/10.1109\/MCSI.2016.054","DOI":"10.1109\/MCSI.2016.054"},{"key":"30_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-319-21819-9_16","volume-title":"Unconventional Computation and Natural Computation","author":"R Ishikawa","year":"2015","unstructured":"Ishikawa, R., Chida, E., Mizuki, T.: Efficient card-based protocols for generating a hidden random permutation without fixed points. In: Calude, C.S., Dinneen, M.J. (eds.) UCNC 2015. LNCS, vol. 9252, pp. 215\u2013226. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21819-9_16"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-030-87993-8_4","volume-title":"Unconventional Computation and Natural Computation","author":"R Isuzugawa","year":"2021","unstructured":"Isuzugawa, R., Miyahara, D., Mizuki, T.: Zero-knowledge proof protocol for\u00a0cryptarithmetic using dihedral cards. In: Kostitsyna, I., Orponen, P. (eds.) UCNC 2021. LNCS, vol. 12984, pp. 51\u201367. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87993-8_4"},{"key":"30_CR16","doi-asserted-by":"publisher","unstructured":"Kimura, K., Takahashi, A., Araki, T., Amano, K.: Maximum number of steps of topswops on 18 and 19 cards. arXiv:2103.08346 (2021). https:\/\/doi.org\/10.48550\/ARXIV.2103.08346, https:\/\/arxiv.org\/abs\/2103.08346","DOI":"10.48550\/ARXIV.2103.08346"},{"key":"30_CR17","doi-asserted-by":"publisher","unstructured":"Klamkin, M.S.: Problems in applied mathematics: selections from SIAM review (1990). https:\/\/doi.org\/10.1137\/1.9781611971729.ch4, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611971729.ch4","DOI":"10.1137\/1.9781611971729.ch4"},{"key":"30_CR18","doi-asserted-by":"crossref","unstructured":"Kleitman, D.J., Kramer, E., Conway, J.H., Bell, S., Dweighter, H.: Elementary problems: e2564\u2013e2569. Am. Math. Monthly 82(10), 1009\u20131010 (1975). http:\/\/www.jstor.org\/stable\/2318260","DOI":"10.2307\/2318260"},{"key":"30_CR19","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming). Addison-Wesley Professional (2005)"},{"key":"30_CR20","doi-asserted-by":"publisher","unstructured":"Koch, A.: Cryptographic protocols from physical assumptions. Ph.D. thesis, Karlsruhe Institute of Technology (2019). https:\/\/doi.org\/10.5445\/IR\/1000097756","DOI":"10.5445\/IR\/1000097756"},{"key":"30_CR21","unstructured":"Koch, A.: The landscape of optimal card-based protocols. Math. Cryptol. 1(2), 115\u2013131 (2022). https:\/\/journals.flvc.org\/mathcryptology\/article\/view\/130529"},{"key":"30_CR22","doi-asserted-by":"crossref","unstructured":"Koch, A., Walzer, S.: Private function evaluation with cards. New Gener. Comput. pp. 1\u201333 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00149-9. (in press)","DOI":"10.1007\/s00354-021-00149-9"},{"key":"30_CR23","doi-asserted-by":"publisher","unstructured":"Kuzuma, T., Toyoda, K., Miyahara, D., Mizuki, T.: Card-based single-shuffle protocols for secure multiple-input AND and XOR computations. In: ASIA Public-Key Cryptography, pp. 51\u201358. ACM, NY (2022). https:\/\/doi.org\/10.1145\/3494105.3526236","DOI":"10.1145\/3494105.3526236"},{"key":"30_CR24","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Robert, L., Sasaki, T., Sone, H.: How to construct physical zero-knowledge proofs for puzzles with a \u201csingle loop\u201d condition. Theor. Comput. Sci. (2021). in press). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.019","DOI":"10.1016\/j.tcs.2021.07.019"},{"key":"30_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-34339-2_8","volume-title":"Information Security Practice and Experience","author":"P Lafourcade","year":"2019","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: A physical ZKP for slitherlink: how to perform physical topology-preserving computation. In: Heng, S.-H., Lopez, J. (eds.) ISPEC 2019. LNCS, vol. 11879, pp. 135\u2013151. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34339-2_8"},{"key":"30_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/978-3-030-79987-8_33","volume-title":"Combinatorial Algorithms","author":"Y Manabe","year":"2021","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols for three-input functions using private operations. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 469\u2013484. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-79987-8_33"},{"key":"30_CR27","doi-asserted-by":"publisher","unstructured":"Manabe, Y., Ono, H.: Card-based cryptographic protocols with malicious players using private operations. New Gener. Comput. pp. 1\u201327 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00148-w. (in press)","DOI":"10.1007\/s00354-021-00148-w"},{"key":"30_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-030-90402-9_8","volume-title":"Provable and Practical Security","author":"D Miyahara","year":"2021","unstructured":"Miyahara, D., Haneda, H., Mizuki, T.: Card-based zero-knowledge proof protocols for graph problems and their computational model. In: Huang, Q., Yu, Yu. (eds.) ProvSec 2021. LNCS, vol. 13059, pp. 136\u2013152. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90402-9_8"},{"key":"30_CR29","doi-asserted-by":"crossref","unstructured":"Miyahara, D., Mizuki, T.: Secure computations through checking suits of playing cards. In: Frontiers in Algorithmics. Lecture Notes in Computer Science. Springer, Cham (2022). to appear","DOI":"10.1007\/978-3-031-20796-9_9"},{"key":"30_CR30","doi-asserted-by":"publisher","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Fun with Algorithms. LIPIcs, vol. 157, pp. 20:1\u201320:21. Schloss Dagstuhl, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.20","DOI":"10.4230\/LIPIcs.FUN.2021.20"},{"key":"30_CR31","doi-asserted-by":"publisher","unstructured":"Miyahara, D., Sasaki, T., Mizuki, T., Sone, H.: Card-based physical zero-knowledge proof for Kakuro. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 102(9), 1072\u20131078 (2019). https:\/\/doi.org\/10.1587\/transfun.E102.A.1072","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"30_CR32","doi-asserted-by":"publisher","unstructured":"Miyamoto, K., Shinagawa, K.: Graph automorphism shuffles from pile-scramble shuffles. New Gener. Comput. 40, 199\u2013223 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00164-4","DOI":"10.1007\/s00354-022-00164-4"},{"key":"30_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00354-021-00127-1","volume":"39","author":"T Mizuki","year":"2021","unstructured":"Mizuki, T.: Preface: special issue on card-based cryptography. New Gener. Comput. 39, 1\u20132 (2021). https:\/\/doi.org\/10.1007\/s00354-021-00127-1","journal-title":"New Gener. Comput."},{"key":"30_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s00354-022-00170-6","volume":"40","author":"T Mizuki","year":"2022","unstructured":"Mizuki, T.: Preface: special issue on card-based cryptography 2. New Gener. Comput. 40, 47\u201348 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00170-6","journal-title":"New Gener. Comput."},{"key":"30_CR35","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Komano, Y.: Information leakage due to operative errors in card-based protocols. Inf. Comput. 285, 104910 (2022). https:\/\/doi.org\/10.1016\/j.ic.2022.104910","DOI":"10.1016\/j.ic.2022.104910"},{"issue":"1","key":"30_CR36","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). https:\/\/doi.org\/10.1007\/s10207-013-0219-4","journal-title":"Int. J. Inf. Secur."},{"key":"30_CR37","doi-asserted-by":"publisher","unstructured":"Mizuki, T., Shizuya, H.: Computational model of card-based cryptographic protocols and its applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E100.A(1), 3\u201311 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.3","DOI":"10.1587\/transfun.E100.A.3"},{"key":"30_CR38","doi-asserted-by":"publisher","unstructured":"Morales, L., Sudborough, H.: A quadratic lower bound for topswops. Theor. Comput. Sci. 411(44), 3965\u20133970 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.08.011, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397510004287","DOI":"10.1016\/j.tcs.2010.08.011"},{"key":"30_CR39","doi-asserted-by":"publisher","unstructured":"Nakai, T., Shirouchi, S., Tokushige, Y., Iwamoto, M., Ohta, K.: Secure computation for threshold functions with physical cards: Power of private permutations. New Gener. Comput. 1\u201319 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00153-7. (in press)","DOI":"10.1007\/s00354-022-00153-7"},{"issue":"1","key":"30_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s00354-020-00113-z","volume":"39","author":"H Ono","year":"2021","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 39(1), 19\u201340 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00113-z","journal-title":"New Gener. Comput."},{"key":"30_CR41","doi-asserted-by":"crossref","unstructured":"Pepperdine, A.: 73.23 topswops. Math. Gazette 73(464), 131\u2013133 (1989). http:\/\/www.jstor.org\/stable\/3619674","DOI":"10.2307\/3619674"},{"key":"30_CR42","doi-asserted-by":"crossref","unstructured":"Robert, L., Lafourcade, P., Miyahara, D., Mizuki, T.: Card-based ZKP protocol for nurimisaki. In: Stabilization, Safety, and Security of Distributed Systems. LNCS, vol. 13751. Springer, Cham (2022). (to appear)","DOI":"10.1007\/978-3-031-21017-4_19"},{"key":"30_CR43","doi-asserted-by":"publisher","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Physical zero-knowledge proof for Suguru puzzle. In: Devismes, S., Mittal, N. (eds.) Stabilization, Safety, and Security of Distributed Systems. LNCS, vol. 12514, pp. 235\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_19","DOI":"10.1007\/978-3-030-64348-5_19"},{"key":"30_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-030-80049-9_37","volume-title":"Connecting with Computability","author":"L Robert","year":"2021","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Interactive physical ZKP for\u00a0connectivity: applications to\u00a0Nurikabe\u00a0and Hitori. In: De Mol, L., Weiermann, A., Manea, F., Fern\u00e1ndez-Duque, D. (eds.) CiE 2021. LNCS, vol. 12813, pp. 373\u2013384. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-80049-9_37"},{"key":"30_CR45","doi-asserted-by":"crossref","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Hide a liar: card-based ZKP protocol for Usowan. In: Theory and Applications of Models of Computation. LNCS, Springer, Cham (2022). (to appear)","DOI":"10.1007\/978-3-031-20350-3_17"},{"key":"30_CR46","doi-asserted-by":"publisher","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Libralesso, L., Mizuki, T.: Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle. Inf. Comput. 104858 (2021). https:\/\/doi.org\/10.1016\/j.ic.2021.104858, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540121001905, in press","DOI":"10.1016\/j.ic.2021.104858"},{"key":"30_CR47","doi-asserted-by":"publisher","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Card-based ZKP for connectivity: applications to Nurikabe, Hitori, and Heyawake. New Gener. Comput. 1\u201323 (2022). https:\/\/doi.org\/10.1007\/s00354-022-00155-5, in press","DOI":"10.1007\/s00354-022-00155-5"},{"key":"30_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1007\/978-3-030-92681-6_22","volume-title":"Combinatorial Optimization and Applications","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S.: An improved physical ZKP for\u00a0Nonogram. In: Du, D.-Z., Du, D., Wu, C., Xu, D. (eds.) COCOA 2021. LNCS, vol. 13135, pp. 262\u2013272. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-92681-6_22"},{"key":"30_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-030-89543-3_52","volume-title":"Computing and Combinatorics","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for Sudoku. In: Chen, C.-Y., Hon, W.-K., Hung, L.-J., Lee, C.-W. (eds.) COCOON 2021. LNCS, vol. 13025, pp. 631\u2013642. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-89543-3_52"},{"key":"30_CR50","unstructured":"Ruangwises, S.: Using five cards to encode each integer in Z\/6Z. In: Innovative Security Solutions for Information Technology and Communications. LNCS. Springer, Cham (2021). (to appear)"},{"key":"30_CR51","doi-asserted-by":"publisher","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for sudoku. New Gener. Comput. 1\u201317 (2022). https:\/\/doi.org\/10.1007\/s00354-021-00146-y. (in press)","DOI":"10.1007\/s00354-021-00146-y"},{"key":"30_CR52","doi-asserted-by":"publisher","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) Fun with Algorithms. LIPIcs, vol. 157, pp. 22:1\u201322:11. Schloss Dagstuhl, Dagstuhl, Germany (2020). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.22","DOI":"10.4230\/LIPIcs.FUN.2021.22"},{"key":"30_CR53","doi-asserted-by":"publisher","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink puzzle and k vertex-disjoint paths problem. New Gener. Comput. 39(1), 3\u201317 (2021). https:\/\/doi.org\/10.1007\/s00354-020-00114-y","DOI":"10.1007\/s00354-020-00114-y"},{"key":"30_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-030-68211-8_24","volume-title":"WALCOM: Algorithms and Computation","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for ripple effect. In: Uehara, R., Hong, S.-H., Nandy, S.C. (eds.) WALCOM 2021. LNCS, vol. 12635, pp. 296\u2013307. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-68211-8_24"},{"key":"30_CR55","doi-asserted-by":"publisher","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for ripple effect. Theor. Comput. Sci. 895, 115\u2013123 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.09.034","DOI":"10.1016\/j.tcs.2021.09.034"},{"key":"30_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/978-3-030-87993-8_10","volume-title":"Unconventional Computation and Natural Computation","author":"S Ruangwises","year":"2021","unstructured":"Ruangwises, S., Itoh, T.: Physical ZKP for connected spanning subgraph: applications to bridges puzzle and other problems. In: Kostitsyna, I., Orponen, P. (eds.) UCNC 2021. LNCS, vol. 12984, pp. 149\u2013163. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-87993-8_10"},{"key":"30_CR57","doi-asserted-by":"publisher","unstructured":"Ruangwises, S., Itoh, T.: Securely computing the n-variable equality function with 2n cards. Theor. Comput. Sci. 887, 99\u2013110 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.07.007","DOI":"10.1016\/j.tcs.2021.07.007"},{"key":"30_CR58","doi-asserted-by":"publisher","unstructured":"Ruangwises, S., Itoh, T.: How to physically verify a rectangle in a grid: a physical ZKP for Shikaku. In: Fraigniaud, P., Uno, Y. (eds.) Fun with Algorithms. LIPIcs, vol. 226, pp. 24:1\u201324:12. Schloss Dagstuhl, Dagstuhl (2022). https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2022.24","DOI":"10.4230\/LIPIcs.FUN.2022.24"},{"key":"30_CR59","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical ZKP for Makaro using a standard deck of cards. In: Theory and Applications of Models of Computation. LNCS. Springer, Cham (2022). (to appear)","DOI":"10.1007\/978-3-031-20350-3_5"},{"key":"30_CR60","doi-asserted-by":"publisher","unstructured":"Sasaki, T., Miyahara, D., Mizuki, T., Sone, H.: Efficient card-based zero-knowledge proof for Sudoku. Theor. Comput. Sci. 839, 135\u2013142 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.05.036","DOI":"10.1016\/j.tcs.2020.05.036"},{"key":"30_CR61","doi-asserted-by":"publisher","unstructured":"Sasaki, T., Mizuki, T., Sone, H.: Card-based zero-knowledge proof for Sudoku. In: Ito, H., Leonardi, S., Pagli, L., Prencipe, G. (eds.) Fun with Algorithms. LIPIcs, vol. 100, pp. 29:1\u201329:10. Schloss Dagstuhl, Dagstuhl, Germany (2018), https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2018.29","DOI":"10.4230\/LIPIcs.FUN.2018.29"},{"key":"30_CR62","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-031-17715-6_25","volume-title":"Theoretical Aspects of Computing \u2013 ICTAC 2022","author":"H Shikata","year":"2022","unstructured":"Shikata, H., Toyoda, K., Miyahara, D., Mizuki, T.: Card-minimal protocols for symmetric Boolean functions of more than seven inputs. In: Seidl, H., Liu, Z., Pasareanu, C.S. (eds.) ICTAC 2022. LNCS, vol. 13572, pp. 388\u2013406. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-17715-6_25"},{"key":"30_CR63","unstructured":"Shinagawa, K.: On the construction of easy to perform card-based protocols. Ph.D. thesis, Tokyo Institute of Technology (2020)"},{"key":"30_CR64","doi-asserted-by":"publisher","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, NY (2022). https:\/\/doi.org\/10.1109\/ICCE-Taiwan55306.2022.9869063","DOI":"10.1109\/ICCE-Taiwan55306.2022.9869063"}],"container-title":["Lecture Notes in Computer Science","Information Security Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21280-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T17:15:11Z","timestamp":1672852511000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21280-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031212796","9783031212802"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21280-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ISPEC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Security Practice and Experience","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taipei","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ispec2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ispec2022.ndhu.edu.tw\/","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":"87","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":"33","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":"38% - 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":"2.3","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}