{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:41:18Z","timestamp":1778154078512,"version":"3.51.4"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030692544","type":"print"},{"value":"9783030692551","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-69255-1_17","type":"book-chapter","created":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:04:45Z","timestamp":1612389885000},"page":"257-270","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Card-Based Covert Lottery"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6238-989X","authenticated-orcid":false,"given":"Yuto","family":"Shinoda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5818-8937","authenticated-orcid":false,"given":"Daiki","family":"Miyahara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5219-1975","authenticated-orcid":false,"given":"Kazumasa","family":"Shinagawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8698-1043","authenticated-orcid":false,"given":"Takaaki","family":"Mizuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9395-9987","authenticated-orcid":false,"given":"Hideaki","family":"Sone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,4]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-030-36030-6_15","volume-title":"Theory of Cryptography","author":"Y Abe","year":"2019","unstructured":"Abe, Y., Iwamoto, M., Ohta, K.: Efficient private PEZ protocols for symmetric functions. In: Hofheinz, D., Rosen, A. (eds.) TCC 2019. LNCS, vol. 11891, pp. 372\u2013392. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36030-6_15"},{"key":"17_CR2","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":"17_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":"17_CR4","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-41025-4_11","volume-title":"Innovative Security Solutions for Information Technology and Communications","author":"M Costiuc","year":"2020","unstructured":"Costiuc, M., Maimu\u0162, D., Te\u015feleanu, G.: Physical cryptography. In: Simion, E., G\u00e9raud-Stewart, R. (eds.) Innovative Security Solutions for Information Technology and Communications, pp. 156\u2013171. Springer International Publishing, Cham (2020)"},{"key":"17_CR5","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":"JG 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":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/229459.229469","volume":"39","author":"R Fagin","year":"1996","unstructured":"Fagin, R., Naor, M., Winkler, P.: Comparing information without leaking it. Commun. ACM 39(5), 77\u201385 (1996). https:\/\/doi.org\/10.1145\/229459.229469","journal-title":"Commun. ACM"},{"issue":"2","key":"17_CR7","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). https:\/\/doi.org\/10.1007\/s00224-008-9119-9","journal-title":"Theory Comput. Syst."},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-319-72089-0_8","volume-title":"Information Theoretic Security","author":"Y Hashimoto","year":"2017","unstructured":"Hashimoto, Y., Shinagawa, K., Nuida, K., Inamura, M., Hanaoka, G.: Secure grouping protocol using a deck of cards. In: Shikata, J. (ed.) ICITS 2017. LNCS, vol. 10681, pp. 135\u2013152. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_8"},{"key":"17_CR9","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":"17_CR10","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., et al.: 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":"17_CR11","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":"17_CR12","doi-asserted-by":"publisher","unstructured":"Koch, A., Walzer, S.: Foundations for actively secure card-based cryptography. In: 10th International Conference on Fun with Algorithms (FUN 2020), pp. 1\u201327. Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, Dagstuhl, Germany. https:\/\/doi.org\/10.4230\/LIPIcs.FUN.2021.17","DOI":"10.4230\/LIPIcs.FUN.2021.17"},{"key":"17_CR13","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":"17_CR14","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. Theoretical Comput. Sci. 803, 207\u2013221 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.11.005","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR15","unstructured":"Miyahara, D., et al.: Card-based ZKP protocols for Takuzu and Juosan. In: Farach-Colton, M., Prencipe, G., Uehara, R. (eds.) 10th International Conference on Fun with Algorithms (FUN 2020). Leibniz International Proceedings in Informatics (LIPIcs), vol. 157, pp. 20:1\u201320:21. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2020). https:\/\/drops.dagstuhl.de\/opus\/volltexte\/2020\/12781"},{"key":"17_CR16","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. E102A(9), 1072\u20131078 (2019). https:\/\/doi.org\/10.1587\/transfun.E102.A.1072","DOI":"10.1587\/transfun.E102.A.1072"},{"key":"17_CR17","doi-asserted-by":"publisher","unstructured":"Mizuki, T.: Card-based protocols for securely computing the conjunction of multiple variables. Theoretical Comput. Sci. 622(C), 34\u201344 (2016). https:\/\/doi.org\/10.1016\/j.tcs.2016.01.039","DOI":"10.1016\/j.tcs.2016.01.039"},{"key":"17_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-540-73556-4_28","volume-title":"Combinatorial Optimization and Applications","author":"T Mizuki","year":"2007","unstructured":"Mizuki, T., Kugimoto, Y., Sone, H.: Secure multiparty computations using the 15 puzzle. In: Dress, A., Xu, Y., Zhu, B. (eds.) COCOA 2007. LNCS, vol. 4616, pp. 255\u2013266. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73556-4_28"},{"issue":"1","key":"17_CR19","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":"17_CR20","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. E100A(1), 3\u201311 (2017). https:\/\/doi.org\/10.1587\/transfun.E100.A.3","DOI":"10.1587\/transfun.E100.A.3"},{"key":"17_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-642-02270-8_36","volume-title":"Frontiers in Algorithmics","author":"T Mizuki","year":"2009","unstructured":"Mizuki, T., Sone, H.: Six-card secure AND and four-card secure XOR. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol. 5598, pp. 358\u2013369. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02270-8_36"},{"key":"17_CR22","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/978-3-030-62974-8_4","volume-title":"Information Security","author":"S Murata","year":"2020","unstructured":"Murata, S., Miyahara, D., Mizuki, T., Sone, H.: Public-PEZ cryptography. In: Susilo, W., Deng, R.H., Guo, F., Li, Y., Intan, R. (eds.) Information Security, pp. 59\u201374. Springer International Publishing, Cham (2020)"},{"key":"17_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-319-72089-0_9","volume-title":"Information Theoretic Security","author":"T Nakai","year":"2017","unstructured":"Nakai, T., Shirouchi, S., Iwamoto, M., Ohta, K.: Four cards are sufficient for a card-based three-input voting protocol utilizing private permutations. In: Shikata, J. (ed.) ICITS 2017. LNCS, vol. 10681, pp. 153\u2013165. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-72089-0_9"},{"key":"17_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-319-48965-0_30","volume-title":"Cryptology and Network Security","author":"T Nakai","year":"2016","unstructured":"Nakai, T., Tokushige, Y., Misawa, Y., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for Millionaires\u2019 problem utilizing private permutations. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 500\u2013517. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_30"},{"key":"17_CR25","doi-asserted-by":"publisher","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Securely computing three-input functions with eight cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E98A(6), 1145\u20131152 (2015). https:\/\/doi.org\/10.1587\/transfun.E98.A.1145","DOI":"10.1587\/transfun.E98.A.1145"},{"key":"17_CR26","doi-asserted-by":"publisher","unstructured":"Ono, H., Manabe, Y.: Efficient card-based cryptographic protocols for the millionaires\u2019 problem using private input operations. In: 2018 13th Asia Joint Conference on Information Security (AsiaJCIS), pp. 23\u201328, August 2018. https:\/\/doi.org\/10.1109\/AsiaJCIS.2018.00013","DOI":"10.1109\/AsiaJCIS.2018.00013"},{"key":"17_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-030-31500-9_10","volume-title":"Data Privacy Management, Cryptocurrencies and Blockchain Technology","author":"H Ono","year":"2019","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic protocols with the minimum number of rounds using private operations. In: P\u00e9rez-Sol\u00e0, C., Navarro-Arribas, G., Biryukov, A., Garcia-Alfaro, J. (eds.) DPM\/CBT 2019. LNCS, vol. 11737, pp. 156\u2013173. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-31500-9_10"},{"key":"17_CR28","doi-asserted-by":"publisher","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic logical computations using private operations. New Gener. Comput. 1, 1\u201322 (2020). https:\/\/doi.org\/10.1007\/s00354-020-00113-z","DOI":"10.1007\/s00354-020-00113-z"},{"key":"17_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-030-64348-5_19","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"L Robert","year":"2020","unstructured":"Robert, L., Miyahara, D., Lafourcade, P., Mizuki, T.: Physical zero-knowledge proof for Suguru puzzle. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 235\u2013247. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_19"},{"key":"17_CR30","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. 1, 1\u201315 (2020). https:\/\/doi.org\/10.1007\/s00354-020-00114-y","DOI":"10.1007\/s00354-020-00114-y"},{"key":"17_CR31","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. Theoretical Comput. Sci. 839, 135\u2013142 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.05.036","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR32","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. Discrete Appl. Math. 289, 248\u2013261 (2021). https:\/\/doi.org\/10.1016\/j.dam.2020.10.013","journal-title":"Discrete Appl. Math."},{"key":"17_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-030-36412-0_37","volume-title":"Combinatorial Optimization and Applications","author":"K Takashima","year":"2019","unstructured":"Takashima, K., et al.: Card-based secure ranking computations. In: Li, Y., Cardei, M., Huang, Y. (eds.) COCOA 2019. LNCS, vol. 11949, pp. 461\u2013472. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-36412-0_37"},{"key":"17_CR34","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. Theoretical Comput. Sci. 845, 122\u2013135 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2020.09.008","journal-title":"Theoretical Comput. Sci."},{"key":"17_CR35","doi-asserted-by":"publisher","unstructured":"Toyoda, K., Miyahara, D., Mizuki, T., Sone, H.: Six-card finite-runtime XOR protocol with only random cut. In: Proceedings of the 7th ACM on ASIA Public-Key Cryptography Workshop, pp. 1\u20137. APKC 2020. ACM, New York, NY, USA. https:\/\/doi.org\/10.1145\/3384940.3388961","DOI":"10.1145\/3384940.3388961"},{"issue":"4","key":"17_CR36","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/s10207-019-00463-w","volume":"19","author":"I Ueda","year":"2019","unstructured":"Ueda, I., Miyahara, D., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: Secure implementations of a random bisection cut. Int. J. Inf. Secur. 19(4), 445\u2013452 (2019). https:\/\/doi.org\/10.1007\/s10207-019-00463-w","journal-title":"Int. J. Inf. Secur."},{"key":"17_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/978-3-319-49001-4_5","volume-title":"Theory and Practice of Natural Computing","author":"I Ueda","year":"2016","unstructured":"Ueda, I., Nishimura, A., Hayashi, Y., Mizuki, T., Sone, H.: How to implement a random bisection cut. In: Mart\u00edn-Vide, C., Mizuki, T., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2016. LNCS, vol. 10071, pp. 58\u201369. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49001-4_5"},{"key":"17_CR38","doi-asserted-by":"publisher","unstructured":"Watanabe, Y., Kuroki, Y., Suzuki, S., Koga, Y., Iwamoto, M., Ohta, K.: Card-based majority voting protocols with three inputs using three cards. In: 2018 International Symposium on Information Theory and Its Applications (ISITA), pp. 218\u2013222 (2018). https:\/\/doi.org\/10.23919\/ISITA.2018.8664324","DOI":"10.23919\/ISITA.2018.8664324"},{"key":"17_CR39","doi-asserted-by":"publisher","unstructured":"Yasunaga, K.: Practical card-based protocol for three-input majority. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E103A(11), 1296\u20131298 (2020). https:\/\/doi.org\/10.1587\/transfun.2020EAL2025","DOI":"10.1587\/transfun.2020EAL2025"}],"container-title":["Lecture Notes in Computer Science","Innovative Security Solutions for Information Technology and Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-69255-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,2,3]],"date-time":"2021-02-03T22:15:49Z","timestamp":1612390549000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-69255-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030692544","9783030692551"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-69255-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 February 2021","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 November 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 November 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"itc2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.secitc.eu\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","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":"19","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":"46% - 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":"3","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":"Yes","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  as full 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)"}}]}}