{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:13:05Z","timestamp":1755997985645,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_29","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"398-410","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Physical Zero-Knowledge Proof for\u00a0Sumplete, a\u00a0Puzzle Generated by\u00a0ChatGPT"],"prefix":"10.1007","author":[{"given":"Kyosuke","family":"Hatsugai","sequence":"first","affiliation":[]},{"given":"Kyoichi","family":"Asano","sequence":"additional","affiliation":[]},{"given":"Yoshiki","family":"Abe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"29_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":"29_CR2","unstructured":"Bultel, X., Dreier, J., Dumas, J., Lafourcade, P.: Physical zero-knowledge proofs for Akari, Takuzu, Kakuro and KenKen. In: FUN, vol. 49, pp. 8:1\u20138:20 (2016)"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bultel, X., et al.: Physical zero-knowledge proof for Makaro. In: SSS, pp. 111\u2013125 (2018)","DOI":"10.1007\/978-3-030-03232-6_8"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Chien, Y., Hon, W.: Cryptographic and physical zero-knowledge proof: from Sudoku to Nonogram. In: FUN, pp. 102\u2013112 (2010)","DOI":"10.1007\/978-3-642-13122-6_12"},{"key":"29_CR5","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"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Dumas, J., Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: Interactive physical zero-knowledge proof for Norinori. In: COCOON, pp. 166\u2013177 (2019)","DOI":"10.1007\/978-3-030-26176-4_14"},{"issue":"1","key":"29_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput. 18(1), 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"29_CR8","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/s00224-008-9119-9","volume":"44","author":"R Gradwohl","year":"2009","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. Theory Comput. Syst. 44(2), 245\u2013268 (2009)","journal-title":"Theory Comput. Syst."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Ishikawa, R., Chida, E., Mizuki, T.: Efficient card-based protocols for generating a hidden random permutation without fixed points. In: UCNC, vol. 9252, pp. 215\u2013226 (2015)","DOI":"10.1007\/978-3-319-21819-9_16"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Komano, Y., Mizuki, T.: Card-based zero-knowledge proof protocol for pancake sorting. In: SecITC, pp. 222\u2013239 (2022)","DOI":"10.1007\/978-3-031-32636-3_13"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., et al.: How to construct physical zero-knowledge proofs for puzzles with a \u201csingle loop condition.\u201d Theor. Comput. Sci. 888, 41\u201355 (2021)","DOI":"10.1016\/j.tcs.2021.07.019"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Lafourcade, P., Miyahara, D., Mizuki, T., Sasaki, T., Sone, H.: A physical ZKP for slitherlink: how to perform physical topology-preserving computation. In: ISPEC, pp. 135\u2013151 (2019)","DOI":"10.1007\/978-3-030-34339-2_8"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.tcs.2019.11.005","volume":"803","author":"D Miyahara","year":"2020","unstructured":"Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: Practical card-based implementations of yao\u2019s millionaire protocol. Theor. Comput. Sci. 803, 207\u2013221 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR14","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: FUN, pp. 20:1\u201320:21 (2021)"},{"key":"29_CR15","doi-asserted-by":"crossref","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-A(9), 1072\u20131078 (2019)","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: FAW, pp. 358\u2013369 (2009)","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Nakai, T., Tokushige, Y., Misawa, Y., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for millionaires\u2019 problem utilizing private permutations. In: CANS, pp. 500\u2013517 (2016)","DOI":"10.1007\/978-3-319-48965-0_30"},{"key":"29_CR18","unstructured":"OpenAI: GPT-4 technical report (2023)"},{"key":"29_CR19","unstructured":"Penguin, P.: ChatGPT invented its own puzzle game (2023). https:\/\/puzzledpenguin.substack.com\/p\/chatgpt-invented-its-own-puzzle-game"},{"issue":"1","key":"29_CR20","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00354-021-00146-y","volume":"40","author":"S Ruangwises","year":"2022","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for sudoku. New Gener. Comput. 40(1), 49\u201365 (2022)","journal-title":"New Gener. Comput."},{"issue":"5","key":"29_CR21","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/s10878-023-01050-5","volume":"45","author":"S Ruangwises","year":"2023","unstructured":"Ruangwises, S.: An improved physical ZKP for nonogram and nonogram color. J. Comb. Optim. 45(5), 122 (2023)","journal-title":"J. Comb. Optim."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Securely computing the n-variable equality function with 2n cards. In: TAMC, pp. 25\u201336 (2020)","DOI":"10.1007\/978-3-030-59267-7_3"},{"key":"29_CR23","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Numberlink. In: FUN, vol. 157, pp. 22:1\u201322:11 (2021)"},{"issue":"1","key":"29_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00354-020-00114-y","volume":"39","author":"S Ruangwises","year":"2021","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)","journal-title":"New Gener. Comput."},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical zero-knowledge proof for Ripple Effect. In: WALCOM, vol. 12635, pp. 296\u2013307 (2021)","DOI":"10.1007\/978-3-030-68211-8_24"},{"key":"29_CR26","unstructured":"Ruangwises, S., Itoh, T.: How to physically verify a rectangle in a grid: a physical ZKP for shikaku. In: FUN, pp. 24:1\u201324:12 (2022)"},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Ruangwises, S., Itoh, T.: Physical ZKP for makaro using a standard deck of cards. In: TAMC, vol. 13571, pp. 43\u201354 (2022)","DOI":"10.1007\/978-3-031-20350-3_5"},{"key":"29_CR28","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/j.tcs.2020.05.036","volume":"839","author":"T Sasaki","year":"2020","unstructured":"Sasaki, T., Miyahara, D., Mizuki, T., Sone, H.: Efficient card-based zero-knowledge proof for sudoku. Theor. Comput. Sci. 839, 135\u2013142 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"29_CR29","unstructured":"Sasaki, T., Mizuki, T., Sone, H.: Card-based zero-knowledge proof for sudoku. In: FUN, vol. 100, pp. 29:1\u201329:10 (2018)"},{"key":"29_CR30","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Multi-party computation with small shuffle complexity using regular polygon cards. In: ProvSec, pp. 127\u2013146 (2015)","DOI":"10.1007\/978-3-319-26059-4_7"},{"key":"29_CR31","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100-A(9), 1900\u20131909 (2017)","DOI":"10.1587\/transfun.E100.A.1900"},{"key":"29_CR32","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.tcs.2020.09.008","volume":"845","author":"K Takashima","year":"2020","unstructured":"Takashima, K., et al.: Card-based protocols for secure ranking computations. Theor. Comput. Sci. 845, 122\u2013135 (2020)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:12:15Z","timestamp":1702026735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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","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":"6","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)"}}]}}