Who holds the best card? Secure communication of optimal secret bits
From MaRDI portal
Publication:5000284
zbMATH Open1468.94419MaRDI QIDQ5000284FDOQ5000284
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
Recommendations
Cryptography (94A60) Signaling and communication in game theory (91A28) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- A colouring protocol for the generalized Russian cards problem
- The Russian cards problem
- Bounds on secret key exchange using a random deal of cards
- Combinatorial solutions providing improved security for the generalized Russian cards problem
- A secure additive protocol for card players
- Three steps
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computations with a deck of cards
- Title not available (Why is that?)
- Title not available (Why is that?)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- A geometric protocol for cryptography with cards
- Perfectly secure data aggregation via shifted projections
- A case study in almost-perfect security for unconditionally secure communication
- Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy
- Secure multiparty computations without computers
- Foundations for actively secure card-based cryptography
Cited In (1)
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)
