dc.creator | Cordón Franco, Andrés | es |
dc.creator | Ditmarsch, Hans P. van | es |
dc.creator | Fernández Duque, David | es |
dc.creator | Soler Toscano, Fernando | es |
dc.date.accessioned | 2017-09-04T12:04:33Z | |
dc.date.available | 2017-09-04T12:04:33Z | |
dc.date.issued | 2013 | |
dc.identifier.citation | Cordó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.issn | 0304-3975 | es |
dc.identifier.uri | http://hdl.handle.net/11441/64155 | |
dc.description.abstract | In 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.sponsorship | Ministerio de Economía y Competitividad FFI2011-15945-E | es |
dc.description.sponsorship | European Research Council ERC Starting Grant EPS 313360 | es |
dc.description.sponsorship | Junta de Andalucía P08-HUM-04159 | es |
dc.format | application/pdf | es |
dc.language.iso | eng | es |
dc.publisher | Elsevier | es |
dc.relation.ispartof | Theoretical Computer Science, 495, 81-95. | |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | * |
dc.subject | Cryptography | es |
dc.subject | Information protocol | es |
dc.subject | Secret exchange | es |
dc.title | A colouring protocol for the generalized Russian cards problem | es |
dc.type | info:eu-repo/semantics/article | es |
dcterms.identifier | https://ror.org/03yxnpp24 | |
dc.type.version | info:eu-repo/semantics/submittedVersion | es |
dc.rights.accessRights | info:eu-repo/semantics/openAccess | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Ciencias de la Computación e Inteligencia Artificial | es |
dc.contributor.affiliation | Universidad de Sevilla. Departamento de Filosofía y Lógica y Filosofía de la Ciencia | es |
dc.relation.projectID | info:eu-repo/grantAgreement/EC/FP7/313360 | es |
dc.relation.projectID | info:eu-repo/grantAgreement/MINECO/FI2011-15945-E | es |
dc.relation.projectID | P08-HUM-04159 | es |
dc.relation.publisherversion | https://doi.org/10.1016/j.tcs.2013.05.010 | es |
dc.identifier.doi | 10.1016/j.tcs.2013.05.010 | es |
idus.format.extent | 15 p. | es |
dc.journaltitle | Theoretical Computer Science | es |
dc.publication.volumen | 495 | es |
dc.publication.initialPage | 81 | es |
dc.publication.endPage | 95 | es |
dc.identifier.sisius | 20604254 | es |
dc.identifier.sisius | 20604254 | |