Takaaki Mizuki

From MaRDI portal
Person:249090

Available identifiers

zbMath Open mizuki.takaakiMaRDI QIDQ249090

List of research outcomes





PublicationDate of PublicationType
Upper bounds on the number of shuffles for two-helping-card multi-input AND protocols2024-06-05Paper
Two UNO decks efficiently perform zero-knowledge proof for Sudoku2024-05-29Paper
Card-based protocol against actively revealing card attack2024-04-19Paper
Single-shuffle card-based protocol with eight cards per gate2024-01-12Paper
Multi-party computation based on physical coins2023-10-16Paper
Committed-format AND protocol using only random cuts2023-09-08Paper
Physical ZKP protocols for Nurimisaki and Kurodoko2023-09-07Paper
Actively revealing card attack on card-based protocols2023-08-31Paper
Physical zero-knowledge proof protocol for Topswops2023-08-04Paper
Hide a liar: card-based ZKP protocol for Usowan2023-08-04Paper
Secure computations through checking suits of playing cards2023-08-03Paper
Physical zero-knowledge proof for Makaro2023-08-02Paper
Card-minimal protocols for symmetric Boolean functions of more than seven inputs2023-07-28Paper
Card-based ZKP protocol for Nurimisaki2023-06-12Paper
Card-minimal protocols for three-input functions with standard playing cards2023-06-02Paper
Another use of the five-card trick: card-minimal secure three-input majority function evaluation2023-05-12Paper
Card-based zero-knowledge proof protocols for graph problems and their computational model2023-04-13Paper
A card-minimal three-input and protocol using two shuffles2023-03-30Paper
Physical Zero-Knowledge Proof for Suguru Puzzle2023-03-21Paper
Public-PEZ Cryptography2023-03-21Paper
Card-based ZKP protocols for Takuzu and Juosan2023-02-07Paper
Card-Based Secure Sorting Protocol2023-01-18Paper
A physical ZKP for Slitherlink: how to perform physical topology-preserving computation2022-08-30Paper
Zero-knowledge proof protocol for cryptarithmetic using dihedral cards2022-07-06Paper
Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle2022-06-08Paper
Information leakage due to operative errors in card-based protocols2022-06-08Paper
Interactive physical ZKP for connectivity: applications to Nurikabe and Hitori2022-03-22Paper
A secure three-input and protocol with a standard deck of minimal cards2022-03-21Paper
Efficient generation of a card-based uniformly distributed random derangement2021-10-04Paper
How to construct physical zero-knowledge proofs for puzzles with a ``single loop condition2021-09-27Paper
How to implement a non-uniform or non-closed shuffle2021-07-06Paper
Card-based protocols for secure ranking computations2020-10-22Paper
Efficient card-based zero-knowledge proof for Sudoku2020-09-03Paper
Card-based Protocols Using Triangle Cards2020-08-11Paper
Card-Based Zero-Knowledge Proof for Sudoku2020-08-11Paper
Card-based secure ranking computations2020-05-13Paper
Interactive physical zero-knowledge proof for Norinori2020-02-24Paper
Practical card-based implementations of Yao's millionaire protocol2019-12-27Paper
Secure computation of any Boolean function based on any deck of cards2019-10-11Paper
Practical and easy-to-understand card-based implementation of Yao's millionaire protocol2019-10-11Paper
The six-card trick: secure computation of three-input equality2019-03-29Paper
Efficient and secure multiparty computations using a standard deck of playing cards2018-10-26Paper
Secure multi-party computation using polarizing cards2018-10-24Paper
Card-based protocols using unequal division shuffles2018-10-22Paper
Analyzing execution time of card-based protocols2018-10-18Paper
Analysis of information leakage due to operative errors in card-based protocols2018-09-06Paper
Secret key amplification from uniformly leaked key exchange complete graph2018-06-15Paper
The minimum number of cards in practical card-based protocols2018-02-23Paper
Necessary and sufficient numbers of cards for securely computing two-bit output functions2017-10-23Paper
Card-based protocols for securely computing the conjunction of multiple variables2016-02-26Paper
Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards2016-01-27Paper
Card-Based Protocols for Any Boolean Function2015-09-30Paper
Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points2015-09-14Paper
Minimizing ESCT forms for two-variable multiple-valued input binary output functions2014-05-06Paper
Voting with a Logarithmic Number of Cards2013-06-28Paper
The Five-Card Trick Can Be Done with Four Cards2013-03-19Paper
ABSOLUTELY SECURE MESSAGE TRANSMISSION USING A KEY SHARING GRAPH2013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q53892862012-04-26Paper
AN APPLICATION OF ST-NUMBERING TO SECRET KEY AGREEMENT2011-10-10Paper
A one-round secure message broadcasting protocol through a key sharing tree2010-08-20Paper
Six-Card Secure AND and Four-Card Secure XOR2009-07-14Paper
Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions2009-06-03Paper
Secure Multiparty Computations Using the 15 Puzzle2009-03-03Paper
A revised transformation protocol for unconditionally secure secret key exchange2008-04-03Paper
Secure Multiparty Computations Using a Dial Lock2007-11-13Paper
Theory and Applications of Models of Computation2007-04-30Paper
https://portal.mardi4nfdi.de/entity/Q34121482006-12-05Paper
Computing and Combinatorics2005-06-15Paper
https://portal.mardi4nfdi.de/entity/Q44740892004-08-04Paper
Characterization of optimal key set protocols2003-09-25Paper
https://portal.mardi4nfdi.de/entity/Q45364312002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45483012002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q47072302002-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42507752000-03-07Paper
https://portal.mardi4nfdi.de/entity/Q42184381999-02-14Paper

Research outcomes over time

This page was built for person: Takaaki Mizuki