{"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":1772893026255,"version":"3.50.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031877599","type":"print"},{"value":"9783031877605","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-87760-5_10","type":"book-chapter","created":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:48:24Z","timestamp":1753523304000},"page":"118-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Card-Based Arithmetic Operations and\u00a0Application to\u00a0Statistical Data Aggregation"],"prefix":"10.1007","author":[{"given":"Shun","family":"Odaka","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5121-3458","authenticated-orcid":false,"given":"Yuichi","family":"Komano","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,27]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Den\u00a0Boer, B.: More efficient match-making and satisfiability the five card trick. In: Quisquater, J.J., Vandewalle, J. (eds.) Advances in Cryptology\u2014EUROCRYPT \u201989. LNCS, vol.\u00a0434, pp. 208\u2013217. Springer, Berlin, Heidelberg (1990). https:\/\/doi.org\/10.1007\/3-540-46885-4_23","DOI":"10.1007\/3-540-46885-4_23"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Gradwohl, R., Naor, M., Pinkas, B., Rothblum, G.N.: Cryptographic and physical zero-knowledge proof systems for solutions of Sudoku puzzles. Theor. Comput. Syst. 44(2), 245\u2013268 (2009). https:\/\/doi.org\/10.1007\/s00224-008-9119-9","DOI":"10.1007\/s00224-008-9119-9"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Koch, A.: The landscape of security from physical assumptions. In: 2021 IEEE Information Theory Workshop (ITW), pp.\u00a01\u20136. IEEE, Los Alamitos, CA, USA (2021). https:\/\/doi.org\/10.1109\/ITW48936.2021.9611501","DOI":"10.1109\/ITW48936.2021.9611501"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Komano, Y., Mizuki, T.: Card-based zero-knowledge proof protocol for pancake sorting. In: Bella, G., Doinea, M., Janicke, H. (eds.) Innovative Security Solutions for Information Technology and Communications - 15th International Conference, SecITC 2022. LNCS, vol. 13809, pp. 222\u2013239. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-32636-3_13","DOI":"10.1007\/978-3-031-32636-3_13"},{"key":"10_CR5","unstructured":"Meinck, S.: Computing sampling weights in large-scale assessments in education. Survey Insights: methods from the field, weighting: practical issues and \u2018how to\u2019 approach. Retrieved (2015). https:\/\/surveyinsights.org\/?p=5353"},{"key":"10_CR6","doi-asserted-by":"crossref","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). https:\/\/doi.org\/10.1016\/j.tcs.2019.11.005","DOI":"10.1016\/j.tcs.2019.11.005"},{"key":"10_CR7","doi-asserted-by":"crossref","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":"10_CR8","doi-asserted-by":"crossref","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) Frontiers in Algorithmics. LNCS, vol.\u00a05598, pp. 358\u2013369. Springer, Berlin, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36","DOI":"10.1007\/978-3-642-02270-8_36"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Pile-shifting scramble for card-based protocols. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101(9), 1494\u20131502 (2018). https:\/\/doi.org\/10.1587\/transfun.E101.A.1494","DOI":"10.1587\/transfun.E101.A.1494"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Nuida, K.: Efficient card-based millionaires\u2019 protocols via non-binary input encoding. In: Shikata, J., Kuzuno, H. (eds.) Advances in Information and Computer Security - 18th International Workshop on Security, IWSEC 2023. Lecture Notes in Computer Science, vol. 14128, pp. 237\u2013254. Springer (2023)","DOI":"10.1007\/978-3-031-41326-1_13"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Ruangwises, S.: Two standard decks of playing cards are sufficient for a ZKP for Sudoku (2021). https:\/\/arxiv.org\/abs\/2106.13646","DOI":"10.1007\/978-3-030-89543-3_52"},{"key":"10_CR12","doi-asserted-by":"crossref","unstructured":"Ruangwises, S.: Using five cards to encode each integer in Z\/6Z. In: Ryan, P.Y.A., Toma, C. (eds.) Innovative Security Solutions for Information Technology and Communications - 14th International Conference, SecITC 2021. Lecture Notes in Computer Science, vol. 13195, pp. 165\u2013177. Springer (2021)","DOI":"10.1007\/978-3-031-17510-7_12"},{"key":"10_CR13","doi-asserted-by":"crossref","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":"10_CR14","doi-asserted-by":"crossref","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":"10_CR15","doi-asserted-by":"crossref","unstructured":"Shinagawa, K., et al.: Card-based protocols using regular polygon cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E100.A(9), 1900\u20131909 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.1900","DOI":"10.1587\/transfun.E100.A.1900"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"Suga, Y.: A card-based protocol that lets you know how close two parties are in their opinions (agree\/disagree) by using a four-point likert scale. In: Applied Cryptography and Network Security Workshops - ACNS 2023, vol. 13907, pp. 716\u2013721. Springer (2023)","DOI":"10.1007\/978-3-031-41181-6_46"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Takashima, K., et al.: Card-based protocols for secure ranking computations. Theor. Comput. Sci. 845, 122\u2013135 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.09.008","DOI":"10.1016\/j.tcs.2020.09.008"},{"key":"10_CR18","unstructured":"Tomoki Kuzuma et al.: SIG technical report. IPSJ, 2024-CSEC-104(40), pp.\u00a01\u20138 (2024). (in Japanese)"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-87760-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,26]],"date-time":"2025-07-26T09:48:32Z","timestamp":1753523312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-87760-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031877599","9783031877605"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-87760-5_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"27 July 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SecITC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Information Technology and Communications Security","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bucharest","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 November 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 November 2024","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":"itc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/secitc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}