| Publication | Date of Publication | Type |
|---|
| Single-shuffle card-based protocol with eight cards per gate | 2024-01-12 | Paper |
| Multi-party computation based on physical coins | 2023-10-16 | Paper |
| Committed-format AND protocol using only random cuts | 2023-09-08 | Paper |
| Physical ZKP protocols for Nurimisaki and Kurodoko | 2023-09-07 | Paper |
| Actively revealing card attack on card-based protocols | 2023-08-31 | Paper |
| Physical zero-knowledge proof protocol for Topswops | 2023-08-04 | Paper |
| Hide a liar: card-based ZKP protocol for Usowan | 2023-08-04 | Paper |
| Secure computations through checking suits of playing cards | 2023-08-03 | Paper |
| Physical zero-knowledge proof for Makaro | 2023-08-02 | Paper |
| Card-minimal protocols for symmetric Boolean functions of more than seven inputs | 2023-07-28 | Paper |
| Card-based ZKP protocol for Nurimisaki | 2023-06-12 | Paper |
| Card-minimal protocols for three-input functions with standard playing cards | 2023-06-02 | Paper |
| Another use of the five-card trick: card-minimal secure three-input majority function evaluation | 2023-05-12 | Paper |
| Card-based zero-knowledge proof protocols for graph problems and their computational model | 2023-04-13 | Paper |
| A card-minimal three-input and protocol using two shuffles | 2023-03-30 | Paper |
| Physical Zero-Knowledge Proof for Suguru Puzzle | 2023-03-21 | Paper |
| Public-PEZ Cryptography | 2023-03-21 | Paper |
| Card-based ZKP protocols for Takuzu and Juosan | 2023-02-07 | Paper |
| Card-Based Secure Sorting Protocol | 2023-01-18 | Paper |
| A physical ZKP for Slitherlink: how to perform physical topology-preserving computation | 2022-08-30 | Paper |
| Zero-knowledge proof protocol for cryptarithmetic using dihedral cards | 2022-07-06 | Paper |
| Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle | 2022-06-08 | Paper |
| Information leakage due to operative errors in card-based protocols | 2022-06-08 | Paper |
| Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori | 2022-03-22 | Paper |
| A secure three-input and protocol with a standard deck of minimal cards | 2022-03-21 | Paper |
| Efficient generation of a card-based uniformly distributed random derangement | 2021-10-04 | Paper |
| How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition | 2021-09-27 | Paper |
| How to implement a non-uniform or non-closed shuffle | 2021-07-06 | Paper |
| Card-based protocols for secure ranking computations | 2020-10-22 | Paper |
| Efficient card-based zero-knowledge proof for Sudoku | 2020-09-03 | Paper |
| Card-Based Zero-Knowledge Proof for Sudoku | 2020-08-11 | Paper |
| Card-based Protocols Using Triangle Cards | 2020-08-11 | Paper |
| Card-based secure ranking computations | 2020-05-13 | Paper |
| Interactive physical zero-knowledge proof for Norinori | 2020-02-24 | Paper |
| Practical card-based implementations of Yao's millionaire protocol | 2019-12-27 | Paper |
| Secure computation of any Boolean function based on any deck of cards | 2019-10-11 | Paper |
| Practical and easy-to-understand card-based implementation of Yao's millionaire protocol | 2019-10-11 | Paper |
| The six-card trick: secure computation of three-input equality | 2019-03-29 | Paper |
| Efficient and secure multiparty computations using a standard deck of playing cards | 2018-10-26 | Paper |
| Secure multi-party computation using polarizing cards | 2018-10-24 | Paper |
| Card-based protocols using unequal division shuffles | 2018-10-22 | Paper |
| Analyzing execution time of card-based protocols | 2018-10-18 | Paper |
| Analysis of information leakage due to operative errors in card-based protocols | 2018-09-06 | Paper |
| Secret key amplification from uniformly leaked key exchange complete graph | 2018-06-15 | Paper |
| The minimum number of cards in practical card-based protocols | 2018-02-23 | Paper |
| Necessary and sufficient numbers of cards for securely computing two-bit output functions | 2017-10-23 | Paper |
| Card-based protocols for securely computing the conjunction of multiple variables | 2016-02-26 | Paper |
| Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards | 2016-01-27 | Paper |
| Card-Based Protocols for Any Boolean Function | 2015-09-30 | Paper |
| Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points | 2015-09-14 | Paper |
| Minimizing ESCT forms for two-variable multiple-valued input binary output functions | 2014-05-06 | Paper |
| Voting with a Logarithmic Number of Cards | 2013-06-28 | Paper |
| The Five-Card Trick Can Be Done with Four Cards | 2013-03-19 | Paper |
| ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH | 2013-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389286 | 2012-04-26 | Paper |
| AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT | 2011-10-10 | Paper |
| A one-round secure message broadcasting protocol through a key sharing tree | 2010-08-20 | Paper |
| Six-Card Secure AND and Four-Card Secure XOR | 2009-07-14 | Paper |
| Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions | 2009-06-03 | Paper |
| Secure Multiparty Computations Using the 15 Puzzle | 2009-03-03 | Paper |
| A revised transformation protocol for unconditionally secure secret key exchange | 2008-04-03 | Paper |
| Secure Multiparty Computations Using a Dial Lock | 2007-11-13 | Paper |
| Theory and Applications of Models of Computation | 2007-04-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3412148 | 2006-12-05 | Paper |
| Computing and Combinatorics | 2005-06-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4474089 | 2004-08-04 | Paper |
| Characterization of optimal key set protocols | 2003-09-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536431 | 2002-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4548301 | 2002-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4707230 | 2002-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4250775 | 2000-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4218438 | 1999-02-14 | Paper |
