A secure additive protocol for card players
From MaRDI portal
Recommendations
- Efficient and secure multiparty computations using a standard deck of playing cards
- Card-based protocols for securely computing the conjunction of multiple variables
- scientific article; zbMATH DE number 2230917
- Card-based cryptographic protocols with a standard deck of cards using private operations
- Secure computations through checking suits of playing cards
- scientific article; zbMATH DE number 176546
- Card-based cryptographic protocols using a minimal number of cards
- scientific article; zbMATH DE number 4021017
- Bounds on secret key exchange using a random deal of cards
Cited in
(13)- scientific article; zbMATH DE number 4021017 (Why is no real title available?)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs
- 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
- A colouring protocol for the generalized Russian cards problem
- Combinatorial solutions providing improved security for the generalized Russian cards problem
- Information Exchange in the Russian Cards Problem
- Secure computations through checking suits of playing cards
- A geometric protocol for cryptography with cards
- Who holds the best card? Secure communication of optimal secret bits
- Secure grouping protocol using a deck of cards
- A case study in almost-perfect security for unconditionally secure communication
- scientific article; zbMATH DE number 2230917 (Why is no real title available?)
This page was built for publication: A secure additive protocol for card players
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2869467)
