{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:23:37Z","timestamp":1742973817580,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030887070"},{"type":"electronic","value":"9783030887087"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/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":"https:\/\/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-88708-7_8","type":"book-chapter","created":{"date-parts":[[2021,10,4]],"date-time":"2021-10-04T21:47:06Z","timestamp":1633384026000},"page":"102-110","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Crossing Hands in the Russian Cards\u00a0Problem"],"prefix":"10.1007","author":[{"given":"Tor","family":"Hagland","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"\u00c5gotnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,10,4]]},"reference":[{"key":"8_CR1","unstructured":"Albert, M.H., et al.: Safe communication for card players by combinatorial designs for two-step protocols. Australas. J. Comb. 33 (2005)"},{"key":"8_CR2","series-title":"Advances in Intelligent and Soft Computing","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-19934-9_15","volume-title":"International Symposium on Distributed Computing and Artificial Intelligence","author":"M Albert","year":"2011","unstructured":"Albert, M., Cord\u00f3n-Franco, A., van Ditmarsch, H., Fern\u00e1ndez-Duque, D., Joosten, J.J., Soler-Toscano, F.: Secure communication of local states in interpreted systems. In: Abraham, A., Corchado, J.M., Gonz\u00e1lez, S.R., De Paz Santana, J.F. (eds.) International Symposium on Distributed Computing and Artificial Intelligence. Advances in Intelligent and Soft Computing, vol. 91, pp. 117\u2013124. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19934-9_15"},{"key":"8_CR3","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.tcs.2013.05.010","volume":"495","author":"A Cord\u00f3n-Franco","year":"2013","unstructured":"Cord\u00f3n-Franco, A., van Ditmarsch, H., Fern\u00e1ndez-Duque, D., Soler-Toscano, F.: A colouring protocol for the generalized Russian cards problem. Theoret. Comput. Sci. 495, 81\u201395 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10623-013-9855-y","volume":"74","author":"A Cord\u00f3n-Franco","year":"2013","unstructured":"Cord\u00f3n-Franco, A., van Ditmarsch, H., Fern\u00e1ndez-Duque, D., Soler-Toscano, F.: A geometric protocol for cryptography with cards. Des. Codes Cryptogr. 74(1), 113\u2013125 (2013). https:\/\/doi.org\/10.1007\/s10623-013-9855-y","journal-title":"Des. Codes Cryptogr."},{"key":"8_CR5","unstructured":"Cyriac, A., Krishnan, K.M.: Lower bound for the communication complexity of the Russian cards problem. arXiv preprint (2008)"},{"issue":"1","key":"8_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1026168632319","volume":"75","author":"H van Ditmarsch","year":"2003","unstructured":"van Ditmarsch, H.: The Russian cards problem. Stud. Logica. 75(1), 31\u201362 (2003)","journal-title":"Stud. Logica."},{"key":"8_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5839-4","volume-title":"Dynamic Epistemic Logic","author":"H van Ditmarsch","year":"2007","unstructured":"van Ditmarsch, H., van Der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Springer, Dordrecht (2007). https:\/\/doi.org\/10.1007\/978-1-4020-5839-4"},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1016\/j.entcs.2005.07.029","volume":"149","author":"H van Ditmarsch","year":"2006","unstructured":"van Ditmarsch, H., van der Hoek, W., van der Meyden, R., Ruan, J.: Model checking Russian cards. Electr. Notes Theoret. Comput. Sci. 149, 105\u2013123 (2006)","journal-title":"Electr. Notes Theoret. Comput. Sci."},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"van Ditmarsch, H., Kooi, B.: One hundred prisoners and a light bulb, pp. 83\u201394. Copernicus, Cham (2015)","DOI":"10.1007\/978-3-319-16694-0_9"},{"key":"8_CR10","unstructured":"van Ditmarsch, H.P.: The case of the hidden hand. Liber Amicorum Dick de Jongh (2004). http:\/\/www.illc.uva.nl\/D65\/"},{"issue":"4","key":"8_CR11","doi-asserted-by":"publisher","first-page":"437","DOI":"10.3166\/jancl.15.437-452","volume":"15","author":"HP van Ditmarsch","year":"2005","unstructured":"van Ditmarsch, H.P.: The case of the hidden hand. J. Appl. Non-Classical Logics 15(4), 437\u2013452 (2005)","journal-title":"J. Appl. Non-Classical Logics"},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-642-02026-1_8","volume-title":"Combinatorial Optimization and Applications","author":"Z Duan","year":"2009","unstructured":"Duan, Z., Yang, C.: Generalized Russian cards problem. In: Du, D.-Z., Hu, X., Pardalos, P.M. (eds.) COCOA 2009. LNCS, vol. 5573, pp. 85\u201397. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02026-1_8"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. The MIT Press, Cambridge (1995). Hardcover edn","DOI":"10.7551\/mitpress\/5803.001.0001"},{"key":"8_CR14","doi-asserted-by":"publisher","unstructured":"Fern\u00e1ndez-Duque, D., Goranko, V.: Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy. Discrete Appl. Math. 198, 118\u2013135 (2016). https:\/\/doi.org\/10.1016\/j.dam.2015.06.022. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0166218X1500308X","DOI":"10.1016\/j.dam.2015.06.022"},{"key":"8_CR15","unstructured":"Hagland, T.: Crossing hands in the Russian cards problem. Master\u2019s thesis, Department of Information Science and Media Studies (2019)"},{"key":"8_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569852","volume-title":"Epistemic Logic for AI and Computer Science","author":"JJC Meyer","year":"1995","unstructured":"Meyer, J.J.C., van der Hoek, W.: Epistemic Logic for AI and Computer Science. Cambridge University Press, Cambridge (1995)"},{"key":"8_CR17","unstructured":"Plaza, J.A.: Logics of public communications. In: Emrich, M.L., Pfeifer, M.S., Hadzikadic, M., Ras, Z.W. (eds.) Proceedings of the 4th International Symposium on Methodologies for Intelligent Systems (ISMIS 1989), pp. 201\u2013216. Oak Ridge National Laboratory (1989)"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Swanson, C.M., Stinson, D.R.: Additional constructions to solve the generalized Russian cards problem using combinatorial designs. arXiv preprint (2014)","DOI":"10.37236\/4019"},{"issue":"2","key":"8_CR19","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10623-012-9770-7","volume":"72","author":"CM Swanson","year":"2014","unstructured":"Swanson, C.M., Stinson, D.R.: Combinatorial solutions providing improved security for the generalized Russian cards problem. Des. Codes Crypt. 72(2), 345\u2013367 (2014)","journal-title":"Des. Codes Crypt."},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Van Ditmarsch, H., Soler-Toscano, F.: Three steps. In: International Workshop on Computational Logic in Multi-Agent Systems, pp. 41\u201357 (2011)","DOI":"10.1007\/978-3-642-22359-4_4"}],"container-title":["Lecture Notes in Computer Science","Logic, Rationality, and Interaction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88708-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:45:38Z","timestamp":1725871538000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88708-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030887070","9783030887087"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88708-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"4 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LORI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Logic, Rationality and Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Xi\u2019an","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lori2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/golori.org\/lori2021\/","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":"40","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":"15","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":"7","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","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":"5","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)"}}]}}