scientific article; zbMATH DE number 2230917

MaRDI QIDQ5708984zbMATH OpenFDO

Authors R. E. L. Aldred, Mike Atkinson, Michael Albert, Hans van Ditmarsch, C. C. Handley

Publication date 21 November 2005

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Three steps
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• A geometric protocol for cryptography with cards
• A secure additive protocol for card players
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs

Cited in

(19)

• Perfectly secure data aggregation via shifted projections
• Crossing hands in the Russian cards problem
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• A secure additive protocol for card players
• Three steps
• Mental poker with three or more players
• The case of the hidden hand
• scientific article; zbMATH DE number 4021017 (Why is no real title available?)
• A colouring protocol for the generalized Russian cards problem
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs
• A geometric protocol for cryptography with cards
• Who holds the best card? Secure communication of optimal secret bits
• A case study in almost-perfect security for unconditionally secure communication
• Six-Card Secure AND and Four-Card Secure XOR
• 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
• Information Exchange in the Russian Cards Problem
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Unconditional secure communication: a Russian cards protocol

This page was built for publication:

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