Generalized Russian Cards Problem

DOI10.1007/978-3-642-02026-1_8MaRDI QIDQ3637053zbMATH OpenOpenAlexFDO

Authors Zhenhua Duan, Chen Yang

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_8

zbMATH Keywords

Russian cards problemdeleting rulepicking rule

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Cryptography (94A60)

Recommendations

• Unconditional secure communication: a Russian cards protocol
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• A colouring protocol for the generalized Russian cards problem
• A geometric protocol for cryptography with cards
• The Russian cards problem

Cited in

(14)

• 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
• The Russian cards problem
• A colouring protocol for the generalized Russian cards problem
• Public communication based on Russian cards protocol: a case study
• Combinatorial solutions providing improved security for the generalized Russian cards problem
• Information Exchange in the Russian Cards Problem
• Crossing hands in the Russian cards problem
• Model checking Russian cards
• A geometric protocol for cryptography with cards
• Erotetic epistemic logic in private communication protocol
• Who holds the best card? Secure communication of optimal secret bits
• A case study in almost-perfect security for unconditionally secure communication

This page was built for publication: Generalized Russian Cards Problem

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