Pages that link to "Item:Q1916027"
From MaRDI portal
The following pages link to Bounds on secret key exchange using a random deal of cards (Q1916027):
Displaying 18 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 geometric protocol for cryptography with cards (Q488255) (← links)
- A case study in almost-perfect security for unconditionally secure communication (Q517272) (← links)
- To know or not to know: Epistemic approaches to security protocol verification (Q625717) (← links)
- Unconditional secure communication: a Russian cards protocol (Q987501) (← links)
- Characterization of optimal key set protocols (Q1408828) (← links)
- Positive announcements (Q2046881) (← links)
- Combinatorial solutions providing improved security for the generalized Russian cards problem (Q2248647) (← links)
- A revised transformation protocol for unconditionally secure secret key exchange (Q2480750) (← links)
- Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points (Q2945569) (← links)
- Three Steps (Q3092292) (← links)
- AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT (Q3173946) (← links)
- The case of the hidden hand (Q3647237) (← links)
- (Q5000284) (← links)
- (Q5028475) (← links)
- Six-Card Secure AND and Four-Card Secure XOR (Q5321728) (← links)
- A distributed computing perspective of unconditionally secure information transmission in Russian cards problems (Q5925684) (← links)