• norsk
    • English
  • norsk 
    • norsk
    • English
  • Logg inn
Vis innførsel 
  •   Hjem
  • Faculty of Social Sciences
  • Department of Information Science and Media Studies
  • Department of Information Science and Media Studies
  • Vis innførsel
  •   Hjem
  • Faculty of Social Sciences
  • Department of Information Science and Media Studies
  • Department of Information Science and Media Studies
  • Vis innførsel
JavaScript is disabled for your browser. Some features of this site may not work without it.

Crossing Hands in the Russian Cards Problem

Hagland, Tor
Master thesis
Thumbnail
Åpne
master thesis (325.2Kb)
Permanent lenke
http://hdl.handle.net/1956/19997
Utgivelsesdato
2018-12-18
Metadata
Vis full innførsel
Samlinger
  • Department of Information Science and Media Studies [738]
Sammendrag
When communicating using an unconditionally secure protocol, a sender and receiver is able to transmit secret information over a public, insecure channel without fear of the secret being intercepted by a third party. The Russian cards problem is an example of an unconditionally secure protocol where the communication is fully understandable for everyone listening in. Even though everyone can understand what is being said, only the sender and receiver are able to uncover the secrets being transmitted. In this thesis we investigate the interaction among the communicating parties. By extending existing problem-specific software we are able to more efficiently analyze protocols, and we are therefore able to provide an answer to an open problem in the literature. We provide a completely new solution to the Russian cards protocol and show that it fulfills all requirements by the problem. Discovering this new solution provides the person initiating the protocol two new strategies to choose from when constructing the initial announcement of the protocol.
Utgiver
The University of Bergen
Opphavsrett
Copyright the author. All rights reserved.

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit
 

 

Bla i

Hele arkivetDelarkiv og samlingerUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifterDenne samlingenUtgivelsesdatoForfattereTitlerEmneordDokumenttyperTidsskrifter

Min side

Logg inn

Statistikk

Besøksstatistikk

Kontakt oss | Gi tilbakemelding

Personvernerklæring
DSpace software copyright © 2002-2019  DuraSpace

Levert av  Unit