Mostrar el registro sencillo del ítem

Perfectly Secure Message Transmission in Two Rounds

hal.structure.identifierMathematisch Instituut Universiteit Leiden
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
hal.structure.identifierCentrum Wiskunde & Informatica [CWI]
dc.contributor.authorSPINI, Gabriele
hal.structure.identifierInstitut de Mathématiques de Bordeaux [IMB]
dc.contributor.authorZÉMOR, Gilles
dc.date.accessioned2024-04-04T03:12:19Z
dc.date.available2024-04-04T03:12:19Z
dc.date.created2016-10-22
dc.date.issued2016-08-05
dc.date.conference2016-10-31
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/193858
dc.description.abstractEnIn the model that has become known as "Perfectly Secure Message Transmission"(PSMT), a sender Alice is connected to a receiver Bob through n parallel two-way channels. A computationally unbounded adversary Eve controls t of these channels, meaning she can acquire and alter any data that is transmitted over these channels. The sender Alice wishes to communicate a secret message to Bob privately and reliably, i.e. in such a way that Eve will not get any information about the message while Bob will be able to recover it completely.In this paper, we focus on protocols that work in two transmission rounds for n= 2t+1. We break from previous work by following a conceptually simpler blueprint for achieving a PSMT protocol. We reduce the previously best-known communication complexity, i.e. the number of transmitted bits necessary to communicate a 1-bit secret, from O(n^3 log n) to O(n^2 log n). Our protocol also answers a question raised by Kurosawa and Suzuki and hitherto left open: their protocol reaches optimal transmission rate for a secret of size O(n^2 log n) bits, and the authors raised the problem of lowering this threshold. The present solution does this for a secret of O(n log n) bits.
dc.language.isoen
dc.source.titleTheory of Cryptography
dc.subject.enPerfectly Secure Message Transmission
dc.title.enPerfectly Secure Message Transmission in Two Rounds
dc.typeCommunication dans un congrès
dc.subject.halInformatique [cs]/Cryptographie et sécurité [cs.CR]
dc.identifier.arxiv1608.01909
bordeaux.page286--304
bordeaux.volume9985
bordeaux.hal.laboratoriesInstitut de Mathématiques de Bordeaux (IMB) - UMR 5251*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleTheory of Cryptography -- 14th International Conference, TCC 2016-B, Beijing, China, October 31-November 3, 2016, Proceedings, Part I
bordeaux.countryCN
bordeaux.title.proceedingTheory of Cryptography
bordeaux.conference.cityBeijing
bordeaux.peerReviewedoui
hal.identifierhal-01413463
hal.version1
hal.invitednon
hal.proceedingsnon
hal.conference.end2016-11-03
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-01413463v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Theory%20of%20Cryptography&rft.date=2016-08-05&rft.volume=9985&rft.spage=286--304&rft.epage=286--304&rft.au=SPINI,%20Gabriele&Z%C3%89MOR,%20Gilles&rft.genre=unknown


Archivos en el ítem

ArchivosTamañoFormatoVer

No hay archivos asociados a este ítem.

Este ítem aparece en la(s) siguiente(s) colección(ones)

Mostrar el registro sencillo del ítem