A geometric protocol for cryptography with cards

DOI10.1007/S10623-013-9855-YzbMATH Open1351.94036arXiv1301.4289OpenAlexW2010404638WikidataQ58883292 ScholiaQ58883292MaRDI QIDQ488255FDOQ488255

David Fernández-Duque, Fernando Soler-Toscano, Hans van Ditmarsch, Andrés Cordón-Franco

Publication date: 23 January 2015

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Abstract: In the generalized Russian cards problem, the three players Alice, Bob and Cath draw a,b and c cards, respectively, from a deck of a+b+c cards. Players only know their own cards and what the deck of cards is. Alice and Bob are then required to communicate their hand of cards to each other by way of public messages. The communication is said to be safe if Cath does not learn the ownership of any specific card; in this paper we consider a strengthened notion of safety introduced by Swanson and Stinson which we call k-safety. An elegant solution by Atkinson views the cards as points in a finite projective plane. We propose a general solution in the spirit of Atkinson's, although based on finite vector spaces rather than projective planes, and call it the `geometric protocol'. Given arbitrary c,k>0, this protocol gives an informative and k-safe solution to the generalized Russian cards problem for infinitely many values of (a,b,c) with b=O(ac). This improves on the collection of parameters for which solutions are known. In particular, it is the first solution which guarantees $k$-safety when Cath has more than one card.

Full work available at URL: https://arxiv.org/abs/1301.4289

Recommendations

• A colouring protocol for the generalized Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Generalized Russian Cards Problem
• A case study in almost-perfect security for unconditionally secure communication
• Information Exchange in the Russian Cards Problem

zbMATH Keywords

secure communicationinformation-based cryptographysecret-exchange protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Combinatorial Designs
• Cryptography. Theory and practice
• A colouring protocol for the generalized Russian cards problem
• Finite geometries.
• On Cryptosystems Based on Polynomials and Finite Fields
• The Russian cards problem
• Bounds on secret key exchange using a random deal of cards
• A secure additive protocol for card players
• Three Steps
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computations with a deck of cards
• Title not available (Why is that?)
• Constant factor approximation for balanced cut in the PIE model

Cited In (12)

• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Perfectly secure data aggregation via shifted projections
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
• Title not available (Why is that?)
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Information Exchange in the Russian Cards Problem
• Crossing hands in the Russian cards problem
• Generalized Russian Cards Problem
• Symbolic Model Checking for Dynamic Epistemic Logic
• A case study in almost-perfect security for unconditionally secure communication
• Title not available (Why is that?)

This page was built for publication: A geometric protocol for cryptography with cards

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q488255)