Skip to main content
main-content

Tipp

Weitere Artikel dieser Ausgabe durch Wischen aufrufen

01.08.2014 | Ausgabe 2/2014

Designs, Codes and Cryptography 2/2014

Combinatorial solutions providing improved security for the generalized Russian cards problem

Zeitschrift:
Designs, Codes and Cryptography > Ausgabe 2/2014
Autoren:
C. M. Swanson, D. R. Stinson
Wichtige Hinweise
Communicated by D. Ghinelli.

Abstract

We present the first formal mathematical presentation of the generalized Russian cards problem, and provide rigorous security definitions that capture both basic and extended versions of weak and perfect security notions. In the generalized Russian cards problem, three players, Alice, Bob, and Cathy, are dealt a deck of \(n\) cards, each given \(a\), \(b\), and \(c\) cards, respectively. The goal is for Alice and Bob to learn each other’s hands via public communication, without Cathy learning the fate of any particular card. The basic idea is that Alice announces a set of possible hands she might hold, and Bob, using knowledge of his own hand, should be able to learn Alice’s cards from this announcement, but Cathy should not. Using a combinatorial approach, we are able to give a nice characterization of informative strategies (i.e., strategies allowing Bob to learn Alice’s hand), having optimal communication complexity, namely the set of possible hands Alice announces must be equivalent to a large set of \(t-(n, a, 1)\)-designs, where \(t=a-c\). We also provide some interesting necessary conditions for certain types of deals to be simultaneously informative and secure. That is, for deals satisfying \(c = a-d\) for some \(d \ge 2\), where \(b \ge d-1\) and the strategy is assumed to satisfy a strong version of security (namely perfect \((d-1)\)-security), we show that \(a = d+1\) and hence \(c=1\). We also give a precise characterization of informative and perfectly \((d-1)\)-secure deals of the form \((d+1, b, 1)\) satisfying \(b \ge d-1\) involving \(d-(n, d+1, 1)\)-designs.

Bitte loggen Sie sich ein, um Zugang zu diesem Inhalt zu erhalten

Literatur
Über diesen Artikel

Weitere Artikel der Ausgabe 2/2014

Designs, Codes and Cryptography 2/2014Zur Ausgabe

Premium Partner

Neuer Inhalt

BranchenIndex Online

Die B2B-Firmensuche für Industrie und Wirtschaft: Kostenfrei in Firmenprofilen nach Lieferanten, Herstellern, Dienstleistern und Händlern recherchieren.

Whitepaper

- ANZEIGE -

Product Lifecycle Management im Konzernumfeld – Herausforderungen, Lösungsansätze und Handlungsempfehlungen

Für produzierende Unternehmen hat sich Product Lifecycle Management in den letzten Jahrzehnten in wachsendem Maße zu einem strategisch wichtigen Ansatz entwickelt. Forciert durch steigende Effektivitäts- und Effizienzanforderungen stellen viele Unternehmen ihre Product Lifecycle Management-Prozesse und -Informationssysteme auf den Prüfstand. Der vorliegende Beitrag beschreibt entlang eines etablierten Analyseframeworks Herausforderungen und Lösungsansätze im Product Lifecycle Management im Konzernumfeld.
Jetzt gratis downloaden!

Bildnachweise