Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
- 4 August 2015
- book chapter
- Published by Springer Nature
- p. 215-226
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Card-Based Protocols for Any Boolean Function2015
- A colouring protocol for the generalized Russian cards problemTheoretical Computer Science, 2013
- Voting with a Logarithmic Number of Cards2013
- The Five-Card Trick Can Be Done with Four Cards2012
- Unconditional secure communication: a Russian Cards protocolJournal of Combinatorial Optimization, 2009
- Six-Card Secure AND and Four-Card Secure XOR2009
- Discreet Solitary Games2001
- Secure multiparty computations without computersTheoretical Computer Science, 1998
- Bounds on Secret Key Exchange Using a Random Deal of CardsJournal of Cryptology, 1996
- More Efficient Match-Making and Satisfiability The Five Card Trick1990