{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:30:43Z","timestamp":1755999043873,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030314996"},{"type":"electronic","value":"9783030315009"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-31500-9_10","type":"book-chapter","created":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T23:26:53Z","timestamp":1568935613000},"page":"156-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Card-Based Cryptographic Protocols with the Minimum Number of Rounds Using Private Operations"],"prefix":"10.1007","author":[{"given":"Hibiki","family":"Ono","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6312-257X","authenticated-orcid":false,"given":"Yoshifumi","family":"Manabe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,20]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Abe, Y., Hayashi, Y.I., Mizuki, T., Sone, H.: Five-card and protocol in committed format using only practical shuffles. In: Proceedings of 5th ACM on ASIA Public-Key Cryptography Workshop(APKC 2018), pp. 3\u20138. ACM (2018)","DOI":"10.1145\/3197507.3197510"},{"key":"10_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":"10_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":"10_CR4","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":"10_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":"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"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-319-61273-7_10","volume-title":"Paradigms in Cryptology \u2013 Mycrypt 2016. Malicious and Exploratory Cryptology","author":"D Francis","year":"2017","unstructured":"Francis, D., Aljunid, S.R., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Necessary and sufficient numbers of cards for securely computing two-bit output functions. In: Phan, R.C.-W., Yung, M. (eds.) Mycrypt 2016. LNCS, vol. 10311, pp. 193\u2013211. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61273-7_10"},{"issue":"9","key":"10_CR7","doi-asserted-by":"publisher","first-page":"1503","DOI":"10.1587\/transfun.E101.A.1503","volume":"101\u2013A","author":"Y Hashimoto","year":"2018","unstructured":"Hashimoto, Y., Nuida, K., Shinagawa, K., Inamura, M., Hanaoka, G.: Toward finite-runtime card-based protocol for generating hidden random permutation without fixed points. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101\u2013A(9), 1503\u20131511 (2018)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"issue":"9","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1587\/transfun.E101.A.1512","volume":"101\u2013A","author":"Y Hashimoto","year":"2018","unstructured":"Hashimoto, Y., Shinagawa, K., Nuida, K., Inamura, M., Hanaoka, G.: Secure grouping protocol using a deck of cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101\u2013A(9), 1512\u20131524 (2018)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Ibaraki, T., Manabe, Y.: A more efficient card-based protocol for generating a random permutation without fixed points. In: Proceedings of 3rd International Conference on Mathematics and Computers in Sciences and in Industry (MCSI 2016), pp. 252\u2013257 (2016)","DOI":"10.1109\/MCSI.2016.054"},{"key":"10_CR10","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":"10_CR11","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":"10_CR12","unstructured":"Koch, A.: The landscape of optimal card-based protocols. IACR Cryptology ePrint Archive, Report 2018\/951 (2018)"},{"key":"10_CR13","unstructured":"Koch, A., Walzer, S.: Private function evaluation with cards. IACR Cryptology ePrint Archive, Report 2018\/1113 (2018)"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1007\/978-3-662-48797-6_32","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2015","author":"A Koch","year":"2015","unstructured":"Koch, A., Walzer, S., H\u00e4rtel, K.: Card-based cryptographic protocols using a minimal number of cards. In: Iwata, T., Cheon, J.H. (eds.) ASIACRYPT 2015. LNCS, vol. 9452, pp. 783\u2013807. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48797-6_32"},{"key":"10_CR15","unstructured":"Kurosawa, K., Shinozaki, T.: Compact card protocol. In: Proceedings of 2017 Symposium on Cryptography and Information Security (SCIS 2017), pp. 1A2\u20136 (2017). (in Japanese)"},{"key":"10_CR16","unstructured":"Marcedone, A., Wen, Z., Shi, E.: Secure dating with four or fewer cards. IACR Cryptology ePrint Archive, Report 2015\/1031 (2015)"},{"key":"10_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-030-04651-4_17","volume-title":"Combinatorial Optimization and Applications","author":"D Miyahara","year":"2018","unstructured":"Miyahara, D., Hayashi, Y., Mizuki, T., Sone, H.: Practical and easy-to-understand card-based implementation of yao\u2019s millionaire protocol. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 246\u2013261. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04651-4_17"},{"key":"10_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-319-92435-9_11","volume-title":"Unconventional Computation and Natural Computation","author":"D Miyahara","year":"2018","unstructured":"Miyahara, D., Ueda, I., Hayashi, Y., Mizuki, T., Sone, H.: Analyzing execution time of card-based protocols. In: Stepney, S., Verlan, S. (eds.) UCNC 2018. LNCS, vol. 10867, pp. 145\u2013158. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-92435-9_11"},{"key":"10_CR19","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1016\/j.tcs.2016.01.039","volume":"622","author":"T Mizuki","year":"2016","unstructured":"Mizuki, T.: Card-based protocols for securely computing the conjunction of multiple variables. Theor. Comput. Sci. 622, 34\u201344 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"484","DOI":"10.1007\/978-3-319-48965-0_29","volume-title":"Cryptology and Network Security","author":"T Mizuki","year":"2016","unstructured":"Mizuki, T.: Efficient and secure multiparty computations using a standard deck of playing cards. In: Foresti, S., Persiano, G. (eds.) CANS 2016. LNCS, vol. 10052, pp. 484\u2013499. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48965-0_29"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/978-3-642-39074-6_16","volume-title":"Unconventional Computation and Natural Computation","author":"T Mizuki","year":"2013","unstructured":"Mizuki, T., Asiedu, I.K., Sone, H.: Voting with a logarithmic number of cards. In: Mauri, G., Dennunzio, A., Manzoni, L., Porreca, A.E. (eds.) UCNC 2013. LNCS, vol. 7956, pp. 162\u2013173. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39074-6_16"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-642-34961-4_36","volume-title":"Advances in Cryptology \u2013 ASIACRYPT 2012","author":"T Mizuki","year":"2012","unstructured":"Mizuki, T., Kumamoto, M., Sone, H.: The five-card trick can be done with four cards. In: Wang, X., Sako, K. (eds.) ASIACRYPT 2012. LNCS, vol. 7658, pp. 598\u2013606. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34961-4_36"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-319-07890-8_27","volume-title":"Fun with Algorithms","author":"T Mizuki","year":"2014","unstructured":"Mizuki, T., Shizuya, H.: Practical card-based cryptography. In: Ferro, A., Luccio, F., Widmayer, P. (eds.) FUN 2014. LNCS, vol. 8496, pp. 313\u2013324. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07890-8_27"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1587\/transfun.E100.A.3","volume":"100\u2013A","author":"T Mizuki","year":"2017","unstructured":"Mizuki, T., Shizuya, H.: Computational model of card-based cryptographic protocols and its applications. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 100\u2013A, 3\u201311 (2017)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10_CR25","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":"10_CR26","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":"10_CR27","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"},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0304-3975(97)00107-2","volume":"191","author":"V Niemi","year":"1998","unstructured":"Niemi, V., Renvall, A.: Secure multiparty computations without computers. Theor. Comput. Sci. 191(1), 173\u2013183 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"10_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"110","DOI":"10.1007\/978-3-319-17142-5_11","volume-title":"Theory and Applications of Models of Computation","author":"T Nishida","year":"2015","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols for any boolean function. In: Jain, R., Jain, S., Stephan, F. (eds.) TAMC 2015. LNCS, vol. 9076, pp. 110\u2013121. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-17142-5_11"},{"issue":"6","key":"10_CR30","doi-asserted-by":"publisher","first-page":"1145","DOI":"10.1587\/transfun.E98.A.1145","volume":"98\u2013A","author":"T Nishida","year":"2015","unstructured":"Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Securely computing three-input functions with eight cards. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 98\u2013A(6), 1145\u20131152 (2015)","journal-title":"IEICE Trans. Fundam. Electron. Commun. Comput. Sci."},{"key":"10_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-319-26841-5_9","volume-title":"Theory and Practice of Natural Computing","author":"A Nishimura","year":"2015","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Five-card secure computations using unequal division shuffle. In: Dediu, A.-H., Magdalena, L., Mart\u00edn-Vide, C. (eds.) TPNC 2015. LNCS, vol. 9477, pp. 109\u2013120. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-26841-5_9"},{"issue":"2","key":"10_CR32","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s00500-017-2858-2","volume":"22","author":"A Nishimura","year":"2018","unstructured":"Nishimura, A., Nishida, T., Hayashi, Y., Mizuki, T., Sone, H.: Card-based protocols using unequal division shuffles. Soft Comput. 22(2), 361\u2013371 (2018)","journal-title":"Soft Comput."},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Ono, H., Manabe, Y.: Efficient card-based cryptographic protocols for the millionaires\u2019 problem using private input operations. In: Proceedings of 13th Asia Joint Conference on Information Security (AsiaJCIS 2018), pp. 23\u201328 (2018)","DOI":"10.1109\/AsiaJCIS.2018.00013"},{"key":"10_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/978-3-030-18419-3_13","volume-title":"Foundations and Practice of Security","author":"H Ono","year":"2019","unstructured":"Ono, H., Manabe, Y.: Card-based cryptographic protocols with the minimum number of cards using private operations. In: Zincir-Heywood, N., Bonfante, G., Debbabi, M., Garcia-Alfaro, J. (eds.) FPS 2018. LNCS, vol. 11358, pp. 193\u2013207. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18419-3_13"},{"key":"10_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-030-19955-5_30","volume-title":"Computer Science \u2013 Theory and Applications","author":"S Ruangwises","year":"2019","unstructured":"Ruangwises, S., Itoh, T.: AND protocols using only uniform shuffles. In: van Bevern, R., Kucherov, G. (eds.) CSR 2019. LNCS, vol. 11532, pp. 349\u2013358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-19955-5_30"},{"key":"10_CR36","unstructured":"Sasaki, T., Mizuki, T., Sone, H.: Card-based zero-knowledge proof for sudoku. In: Proceedings of 9th International Conference on Fun with Algorithms (FUN 2018), Leibniz International Proceedings in Informatics (LIPIcs), vol. 100, pp. 29:1\u201329:10 (2018)"},{"key":"10_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-030-18126-0_6","volume-title":"Frontiers in Algorithmics","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K., Mizuki, T.: Secure computation of any boolean function based on any deck of cards. In: Chen, Y., Deng, X., Lu, M. (eds.) FAW 2019. LNCS, vol. 11458, pp. 63\u201375. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-18126-0_6"},{"key":"10_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-030-12146-4_8","volume-title":"Information Security and Cryptology \u2013 ICISC 2018","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K., Mizuki, T.: The six-card trick: secure computation of three-input equality. In: Lee, K. (ed.) ICISC 2018. LNCS, vol. 11396, pp. 123\u2013131. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-12146-4_8"},{"key":"10_CR39","first-page":"380","volume":"2019","author":"K Shinagawa","year":"2019","unstructured":"Shinagawa, K., Nuida, K.: A single shuffle is enough for secure card-based computation of any circuit. IACR Cryptol. ePrint Arch. 2019, 380 (2019)","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"10_CR40","unstructured":"Shirouchi, S., Nakai, T., Iwamoto, M., Ohta, K.: Efficient card-based cryptographic protocols for logic gates utilizing private permutations. In: Proceedings of 2017 Symposium on Cryptography and Information Security (SCIS 2017), pp. 1A2\u20132 (2017). (in Japanese)"},{"issue":"1","key":"10_CR41","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0304-3975(00)00409-6","volume":"259","author":"A Stiglic","year":"2001","unstructured":"Stiglic, A.: Computations with a deck of cards. Theor. Comput. Sci. 259(1), 671\u2013678 (2001)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Data Privacy Management, Cryptocurrencies and Blockchain Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-31500-9_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T00:02:33Z","timestamp":1726790553000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-31500-9_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030314996","9783030315009"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-31500-9_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"20 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DPM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Data Privacy Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Luxembourg","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dpm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/esorics2019.uni.lu\/workshops\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}