A geometric protocol for cryptography with cards

DOI10.1007/s10623-013-9855-yzbMath1351.94036arXiv1301.4289OpenAlexW2010404638WikidataQ58883292 ScholiaQ58883292MaRDI QIDQ488255

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

Publication date: 23 January 2015

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

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

zbMATH Keywords

secure communicationinformation-based cryptographysecret-exchange protocols

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Perfectly secure data aggregation via shifted projections ⋮ Symbolic Model Checking for Dynamic Epistemic Logic ⋮ Crossing hands in the Russian cards problem ⋮ Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy ⋮ Unnamed Item ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ Combinatorial solutions providing improved security for the generalized Russian cards problem ⋮ 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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A colouring protocol for the generalized Russian cards problem
• Finite geometries.
• The Russian cards problem
• Bounds on secret key exchange using a random deal of cards
• Three Steps
• On Cryptosystems Based on Polynomials and Finite Fields
• Combinatorial Designs
• Constant factor approximation for balanced cut in the PIE model
• Computations with a deck of cards

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