Pages that link to "Item:Q391146"
From MaRDI portal
The following pages link to A colouring protocol for the generalized Russian cards problem (Q391146):
Displaying 13 items.
- The undecidability of quantified announcements (Q310079) (← links)
- Additional constructions to solve the generalized Russian cards problem using combinatorial designs (Q406700) (← links)
- A geometric protocol for cryptography with cards (Q488255) (← 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)
- Positive announcements (Q2046881) (← 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)
- (Q5000284) (← links)
- (Q5028475) (← 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)