| Publication | Date of Publication | Type |
|---|
| Card-based protocol against actively revealing card attack | 2024-04-19 | Paper |
Committed-format AND protocol using only random cuts
Natural Computing | 2023-09-08 | Paper |
Actively revealing card attack on card-based protocols
Natural Computing | 2023-08-31 | Paper |
Physical zero-knowledge proof for Makaro
Lecture Notes in Computer Science | 2023-08-02 | Paper |
| Public-PEZ Cryptography | 2023-03-21 | Paper |
| Card-based ZKP protocols for Takuzu and Juosan | 2023-02-07 | Paper |
| A physical ZKP for Slitherlink: how to perform physical topology-preserving computation | 2022-08-30 | 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
Theoretical Computer Science | 2021-09-27 | Paper |
Card-based protocols for secure ranking computations
Theoretical Computer Science | 2020-10-22 | Paper |
Efficient card-based zero-knowledge proof for Sudoku
Theoretical Computer Science | 2020-09-03 | Paper |
| Card-based zero-knowledge proof for Sudoku | 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
Theoretical Computer Science | 2019-12-27 | Paper |
| Practical and easy-to-understand card-based implementation of Yao's millionaire protocol | 2019-10-11 | Paper |
Card-based protocols using unequal division shuffles
Soft Computing | 2018-10-22 | Paper |
| Analyzing execution time of card-based protocols | 2018-10-18 | 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 any Boolean function
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Minimizing ESCT forms for two-variable multiple-valued input binary output functions
Discrete Applied Mathematics | 2014-05-06 | Paper |
Voting with a Logarithmic Number of Cards
Unconventional Computation and Natural Computation | 2013-06-28 | Paper |
The five-card trick can be done with four cards
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
An application of st-numbering to secret key agreement
International Journal of Foundations of Computer Science | 2011-10-10 | Paper |
A one-round secure message broadcasting protocol through a key sharing tree
Information Processing Letters | 2010-08-20 | Paper |
Six-Card Secure AND and Four-Card Secure XOR
Frontiers in Algorithmics | 2009-07-14 | Paper |
Secure Multiparty Computations Using the 15 Puzzle
Combinatorial Optimization and Applications | 2009-03-03 | Paper |
Secure Multiparty Computations Using a Dial Lock
Lecture Notes in Computer Science | 2007-11-13 | Paper |
Theory and Applications of Models of Computation
Lecture Notes in Computer Science | 2007-04-30 | Paper |
| Securely computing XOR with 10 cards | 2006-12-05 | Paper |
