Show simple item record

dc.creatorCordón Franco, Andréses
dc.creatorDitmarsch, Hans P. vanes
dc.creatorFernández Duque, Davides
dc.creatorSoler Toscano, Fernandoes
dc.date.accessioned2017-09-04T12:04:33Z
dc.date.available2017-09-04T12:04:33Z
dc.date.issued2013
dc.identifier.citationCordón Franco, A., Ditmarsch, H.P.v., Fernández Duque, D. y Soler Toscano, F. (2013). A colouring protocol for the generalized Russian cards problem. Theoretical Computer Science, 495, 81-95.
dc.identifier.issn0304-3975es
dc.identifier.urihttp://hdl.handle.net/11441/64155
dc.description.abstractIn the generalized Russian cards problem, Alice, Bob and Cath draw a, b and c cards, respectively, from a deck of size a + b + c. Alice and Bob must then communicate their entire hand to each other, without Cath learning the owner of a single card she does not hold. Unlike many traditional problems in cryptography, however, they are not allowed to encode or hide the messages they exchange from Cath. The problem is then to find methods through which they can achieve this. We propose a general four-step solution based on finite vector spaces, and call it the “colouring protocol”, as it involves colourings of lines. Our main results show that the colouring protocol may be used to solve the generalized Russian cards problem in cases where a is a power of a prime, c = O(a2) and b = O(c2). This improves substantially on the set of parameters for which solutions are known to exist; in particular, it had not been shown previously that the problem could be solved in cases where the eavesdropper has more cards than one of the communicating players.es
dc.description.sponsorshipMinisterio de Economía y Competitividad FFI2011-15945-Ees
dc.description.sponsorshipEuropean Research Council ERC Starting Grant EPS 313360es
dc.description.sponsorshipJunta de Andalucía P08-HUM-04159es
dc.formatapplication/pdfes
dc.language.isoenges
dc.publisherElsevieres
dc.relation.ispartofTheoretical Computer Science, 495, 81-95.
dc.rights.urihttp://creativecommons.org/licenses/by-nc-nd/4.0/*
dc.subjectCryptographyes
dc.subjectInformation protocoles
dc.subjectSecret exchangees
dc.titleA colouring protocol for the generalized Russian cards problemes
dc.typeinfo:eu-repo/semantics/articlees
dc.type.versioninfo:eu-repo/semantics/submittedVersiones
dc.rights.accessrightsinfo:eu-repo/semantics/openAccesses
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificiales
dc.contributor.affiliationUniversidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Cienciaes
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/FP7/313360es
dc.relation.projectIDinfo:eu-repo/grantAgreement/MINECO/FI2011-15945-Ees
dc.relation.projectIDP08-HUM-04159es
dc.relation.publisherversionhttps://doi.org/10.1016/j.tcs.2013.05.010es
dc.identifier.doi10.1016/j.tcs.2013.05.010es
idus.format.extent15 p.es
dc.journaltitleTheoretical Computer Sciencees
dc.publication.volumen495es
dc.publication.initialPage81es
dc.publication.endPage95es
dc.identifier.sisius20604254es
dc.identifier.sisius20604254

FilesSizeFormatViewDescription
colouring_protocol_preprint.pdf324.7KbIcon   [PDF] View/Open  

This item appears in the following collection(s)

Show simple item record

http://creativecommons.org/licenses/by-nc-nd/4.0/
Except where otherwise noted, this item's license is described as: http://creativecommons.org/licenses/by-nc-nd/4.0/