1. [2] E. Cheung, C. Hawthorne, and P. Lee, “Cs 758 project: Secure computation with playing cards,” 2013. https://cdchawthorne.com/writings/secure_playing_cards.pdf
2. [3] B. den Boer, “More efficient match-making and satisfiability: The Five Card Trick,” Advances in Cryptology-EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings, J. Quisquater and J. Vandewalle, eds., volume 434 of Lecture Notes in Computer Science, pp.208-217. Springer, 1989. 10.1007/3-540-46885-4_23
3. [4] R. Ishikawa, E. Chida, and T. Mizuki, “Efficient card-based protocols for generating a hidden random permutation without fixed points,” Unconventional Computation and Natural Computation-14th International Conference, UCNC 2015, Auckland, New Zealand, Aug. 30-Sept. 3, 2015, Proceedings, C.S. Calude and M.J. Dinneen, eds., volume 9252 of Lecture Notes in Computer Science, pp.215-226. Springer, 2015. 10.1007/978-3-319-21819-9_16
4. [5] A. Koch and S. Walzer, “Foundations for actively secure card-based cryptography,” FUN 2021, volume 157 of LIPIcs, pp.17:1-17:23, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2021. 10.4230/LIPIcs.FUN.2021.17
5. [6] A. Koch, S. Walzer, and K. Härtel, “Card-based cryptographic protocols using a minimal number of cards,” Advances in Cryptology-ASIACRYPT 2015-21st International Conference on the Theory and Application of Cryptology and Information Security, Auckland, New Zealand, Nov. 29-Dec. 3, 2015, Proceedings, Part I, T. Iwata and J.H. Cheon, eds., volume 9452 of Lecture Notes in Computer Science, pp.783-807, Springer, 2015. 10.1007/978-3-662-48797-6_32