Pages that link to "Item:Q987501"

The following pages link to Unconditional secure communication: a Russian cards protocol (Q987501):

Displaying 9 items.

• A colouring protocol for the generalized Russian cards problem (Q391146) (← links)
• Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
• A case study in almost-perfect security for unconditionally secure communication (Q517272) (← links)
• Secure aggregation of distributed information: how a team of agents can safely share secrets in front of a spy (Q897593) (← links)
• Linear time-dependent constraints programming with MSVL (Q2015809) (← links)
• Combinatorial solutions providing improved security for the generalized Russian cards problem (Q2248647) (← links)
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569) (← links)
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5918638) (← links)
• A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)