Who holds the best card? Secure communication of optimal secret bits

MaRDI QIDQ5000284zbMATH OpenFDO

Authors David Fernández-Duque, S. P. Suresh, Hans van Ditmarsch, Vaishnavi Sundararajan

Publication date 12 July 2021

Full work available at URL http://ajc.maths.uq.edu.au/pdf/80/ajc_v80_p001.pdf

zbMATH Keywords

combinatorial designsRussian cards problemsecret-bit-exchange protocols

Mathematics Subject Classification ID

Cryptography (94A60) Signaling and communication in game theory (91A28) Authentication, digital signatures and secret sharing (94A62)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 437574 (Why is no real title available?)
• scientific article; zbMATH DE number 4191563 (Why is no real title available?)
• scientific article; zbMATH DE number 1925555 (Why is no real title available?)
• scientific article; zbMATH DE number 2230917 (Why is no real title available?)
• A case study in almost-perfect security for unconditionally secure communication
• A colouring protocol 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
• Bounds on secret key exchange using a random deal of cards
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Computations with a deck of cards
• Foundations for actively secure card-based cryptography
• Perfectly secure data aggregation via shifted projections
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
• Secure multiparty computations without computers
• The Russian cards problem
• Three steps

Cited in

(1)

• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy

This page was built for publication: Who holds the best card? Secure communication of optimal secret bits

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