{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,9]],"date-time":"2025-12-09T15:39:24Z","timestamp":1765294764778,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T00:00:00Z","timestamp":1461369600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche (FR)","doi-asserted-by":"publisher","award":["ANR-11-IDEX-0002-02"],"award-info":[{"award-number":["ANR-11-IDEX-0002-02"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Des. Codes Cryptogr."],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10623-016-0210-y","type":"journal-article","created":{"date-parts":[[2016,4,23]],"date-time":"2016-04-23T08:15:19Z","timestamp":1461399319000},"page":"145-168","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A case study in almost-perfect security for unconditionally secure communication"],"prefix":"10.1007","volume":"83","author":[{"given":"Esteban","family":"Landerreche","sequence":"first","affiliation":[]},{"given":"David","family":"Fern\u00e1ndez-Duque","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,23]]},"reference":[{"key":"210_CR1","unstructured":"Albert M.H., Aldred R.E.L., Atkinson M.D., van Ditmarsch H., Handley C.C.: Safe communication for card players by combinatorial designs for two-step protocols. Australas. J. Comb. 33, 33\u201346 (2005)."},{"key":"210_CR2","unstructured":"Blakley G.R.: Safeguarding cryptographic keys. In: Proceedings of the 1979 AFIPS National Computer Conference, vol. 48, pp. 313\u2013317 (1979)."},{"key":"210_CR3","unstructured":"Cord\u00f3n-Franco A., van Ditmarsch H., Fern\u00e1ndez-Duque D., Joosten J.J., Soler-Toscano F.: A secure additive protocol for card players. Australas. J. Comb. 54, 163\u2013176 (2012)."},{"key":"210_CR4","doi-asserted-by":"crossref","unstructured":"Cord\u00f3n-Franco A., van Ditmarsch H., Fern\u00e1ndez-Duque D., Soler-Toscano F.: A colouring protocol for the generalized Russian cards problem. Theor. Comput. Sci. 495, 81\u201395 (2013).","DOI":"10.1016\/j.tcs.2013.05.010"},{"key":"210_CR5","doi-asserted-by":"crossref","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 (2015).","DOI":"10.1007\/s10623-013-9855-y"},{"key":"210_CR6","unstructured":"Dembowski P.: Finite Geometries (reprint). Springer, New York (1997)."},{"key":"210_CR7","doi-asserted-by":"crossref","unstructured":"Duan Z., Yang C.: Unconditional secure communication: a Russian cards protocol. J. Comb. Optim. 19, 501\u2013530 (2010).","DOI":"10.1007\/s10878-009-9252-7"},{"key":"210_CR8","doi-asserted-by":"crossref","unstructured":"Fern\u00e1ndez-Duque, D.: Perfectly secure data aggregation via shifted projections. Inform. Sci. 354, 153\u2013164 (2016).","DOI":"10.1016\/j.ins.2016.03.031"},{"key":"210_CR9","doi-asserted-by":"crossref","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. Discret. Appl. Math. 198, 118\u2013135 (2016).","DOI":"10.1016\/j.dam.2015.06.022"},{"key":"210_CR10","doi-asserted-by":"crossref","unstructured":"Fischer M.J., Wright R.N.: Bounds on secret key exchange using a random deal of cards. J. Cryptol. 9(2), 71\u201399 (1996).","DOI":"10.1007\/s001459900004"},{"key":"210_CR11","unstructured":"Keevash P.: The existence of designs. arXiv:1401.3665 (2014)."},{"key":"210_CR12","unstructured":"Kirkman T.P.: On a problem in combinations. Camb. Dublin Math. J. 2, 191\u2013204 (1847)."},{"key":"210_CR13","doi-asserted-by":"crossref","unstructured":"Lidl R., Niederreiter H.: Finite Fields. Cambridge University Press, Cambridge (1997).","DOI":"10.1017\/CBO9780511525926"},{"key":"210_CR14","doi-asserted-by":"crossref","unstructured":"Metsch K.: Blocking sets in projective spaces and polar spaces. J. Geom. 76, 216\u2013232 (2003).","DOI":"10.1007\/s00022-003-1699-6"},{"key":"210_CR15","doi-asserted-by":"crossref","unstructured":"Metsch K.: How many $$S$$ S -subspaces must miss a point set in $${\\rm {P}{G}}(d, q)$$ P G ( d , q ) . J. Geom. 86(1\u20132), 154\u2013164 (2007).","DOI":"10.1007\/s00022-006-1889-0"},{"key":"210_CR16","unstructured":"Ouellette J.: Quantum key distribution. Ind. Phys. 10(6), 22\u201325 (2004)."},{"key":"210_CR17","doi-asserted-by":"crossref","unstructured":"Shamir A.: How to share a secret. Commun. ACM 22(11), 612\u2013613 (1979).","DOI":"10.1145\/359168.359176"},{"key":"210_CR18","doi-asserted-by":"crossref","unstructured":"Stinson D.R.: Cryptography: Theory and Practice. CRC Press, Boca Raton (2005).","DOI":"10.1201\/9781420057133"},{"key":"210_CR19","doi-asserted-by":"crossref","unstructured":"Swanson C.M., Stinson D.R.: Additional constructions to solve the generalized Russian cards problem using combinatorial designs. Electron. J. Comb. 21(3), P3.29 (2014).","DOI":"10.37236\/4019"},{"key":"210_CR20","doi-asserted-by":"crossref","unstructured":"Swanson C.M., Stinson D.R.: Combinatorial solutions providing improved security for the generalized Russian cards problem. Des. Codes Cryptogr. 72(2), 345\u2013367 (2014).","DOI":"10.1007\/s10623-012-9770-7"},{"key":"210_CR21","doi-asserted-by":"crossref","unstructured":"van Ditmarsch H.: The Russian cards problem. Stud. Log. 75, 31\u201362 (2003).","DOI":"10.1023\/A:1026168632319"},{"key":"210_CR22","doi-asserted-by":"crossref","unstructured":"van Ditmarsch H., Soler-Toscano F.: Three steps. In: Proceedings of CLIMA XII. Lecture Notes in Computer Science, vol. 6814, pp. 41\u201357. Springer, New York (2011).","DOI":"10.1007\/978-3-642-22359-4_4"}],"container-title":["Designs, Codes and Cryptography"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0210-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10623-016-0210-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0210-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10623-016-0210-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,18]],"date-time":"2022-06-18T13:23:59Z","timestamp":1655558639000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10623-016-0210-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4,23]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["210"],"URL":"https:\/\/doi.org\/10.1007\/s10623-016-0210-y","relation":{},"ISSN":["0925-1022","1573-7586"],"issn-type":[{"type":"print","value":"0925-1022"},{"type":"electronic","value":"1573-7586"}],"subject":[],"published":{"date-parts":[[2016,4,23]]}}}