A colouring protocol for the generalized Russian cards problem
From MaRDI portal
Publication:391146
DOI10.1016/j.tcs.2013.05.010zbMath1295.94176arXiv1207.5216OpenAlexW2073060670WikidataQ58883290 ScholiaQ58883290MaRDI QIDQ391146
Andrés Cordón-Franco, David Fernández-Duque, Fernando Soler-Toscano, Hans P. van Ditmarsch
Publication date: 10 January 2014
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1207.5216
Related Items (13)
Perfectly secure data aggregation via shifted projections ⋮ The undecidability of quantified announcements ⋮ Crossing hands in the Russian cards problem ⋮ Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points ⋮ Additional constructions to solve the generalized Russian cards problem using combinatorial designs ⋮ Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A geometric protocol for cryptography with cards ⋮ A case study in almost-perfect security for unconditionally secure communication ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems ⋮ Positive announcements ⋮ A distributed computing perspective of unconditionally secure information transmission in Russian cards problems
Cites Work
- Unconditional secure communication: a Russian cards protocol
- 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
- Three Steps
- On Cryptosystems Based on Polynomials and Finite Fields
- Combinatorial Designs
- Computations with a deck of cards
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A colouring protocol for the generalized Russian cards problem
