Pages that link to "Item:Q2248647"

The following pages link to Combinatorial solutions providing improved security for the generalized Russian cards problem (Q2248647):

Displaying 11 items.

• A colouring protocol for the generalized Russian cards problem (Q391146) (← 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)
• Perfectly secure data aggregation via shifted projections (Q1615724) (← links)
• Large sets with multiplicity (Q2035460) (← links)
• Crossing hands in the Russian cards problem (Q2148821) (← links)
• Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569) (← links)
• Coloured and Directed Designs (Q3295270) (← links)
• (Q5000284) (← 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)