1. Five-Card AND Computations in Committed Format Using Only Uniform Cyclic Shuffles
2. Committed-format AND protocol using only random cuts
3. Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points
4. A Card-Minimal Three-Input AND Protocol Using Two Shuffles
5. Julia Kastner , Alexander Koch , Stefan Walzer , Daiki Miyahara , Yu-ichi Hayashi, Takaaki Mizuki , and Hideaki Sone . 2017. The Minimum Number of Cards in Practical Card-Based Protocols . In Advances in Cryptology -- ASIACRYPT 2017 (Lecture Notes in Computer Science , Vol. 10626), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Cham, 126-- 155 . https://doi.org/10.1007/978-3-319-70700-6_5 Julia Kastner, Alexander Koch, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, and Hideaki Sone. 2017. The Minimum Number of Cards in Practical Card-Based Protocols. In Advances in Cryptology -- ASIACRYPT 2017 (Lecture Notes in Computer Science, Vol. 10626), Tsuyoshi Takagi and Thomas Peyrin (Eds.). Springer, Cham, 126--155. https://doi.org/10.1007/978-3-319-70700-6_5