Takaaki Mizuki

Orcid: 0000-0002-8698-1043

According to our database1, Takaaki Mizuki authored at least 119 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Physical ZKP protocols for Nurimisaki and Kurodoko.
Theor. Comput. Sci., September, 2023

Single-Shuffle Card-Based Protocol with Eight Cards per Gate.
Proceedings of the Unconventional Computation and Natural Computation, 2023

Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku.
Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

Upper Bounds on the Number of Shuffles for Two-Helping-Card Multi-input and Protocols.
Proceedings of the Cryptology and Network Security - 22nd International Conference, 2023

Few-helping-card Protocols for Some Wider Class of Symmetric Boolean Functions with Arbitrary Ranges.
Proceedings of the 10th ACM Asia Public-Key Cryptography Workshop, 2023

An Energy Efficient SDN Controller Placement with Delay Constraints.
Proceedings of the 24st Asia-Pacific Network Operations and Management Symposium, 2023

2022
Card-Based ZKP for Connectivity: Applications to Nurikabe, Hitori, and Heyawake.
New Gener. Comput., 2022

Preface: Special Issue on Card-Based Cryptography 2.
New Gener. Comput., 2022

Actively revealing card attack on card-based protocols.
Nat. Comput., 2022

Coin-based Secure Computations.
Int. J. Inf. Sec., 2022

Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle.
Inf. Comput., 2022

Information leakage due to operative errors in card-based protocols.
Inf. Comput., 2022

Hide a Liar: Card-Based ZKP Protocol for Usowan.
Proceedings of the Theory and Applications of Models of Computation, 2022

Card-Based ZKP Protocol for Nurimisaki.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2022

Card-Based Zero-Knowledge Proof Protocol for Pancake Sorting.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2022

Card-Based Secure Sorting Protocol.
Proceedings of the Advances in Information and Computer Security, 2022

Physical Zero-Knowledge Proof Protocol for Topswops.
Proceedings of the Information Security Practice and Experience, 2022

Card-Minimal Protocols for Symmetric Boolean Functions of More than Seven Inputs.
Proceedings of the Theoretical Aspects of Computing - ICTAC 2022, 2022

Secure Computations Through Checking Suits of Playing Cards.
Proceedings of the Frontiers of Algorithmic Wisdom, 2022

Card-based Single-shuffle Protocols for Secure Multiple-input AND and XOR Computations.
Proceedings of the APKC '22: Proceedings of the 9th ACM on ASIA Public-Key Cryptography Workshop, 2022

Card-Minimal Protocols for Three-Input Functions with Standard Playing Cards.
Proceedings of the Progress in Cryptology, 2022

2021
How to construct physical zero-knowledge proofs for puzzles with a "single loop" condition.
Theor. Comput. Sci., 2021

Preface: Special Issue on Card-Based Cryptography.
New Gener. Comput., 2021

Five-Card AND Computations in Committed Format Using Only Uniform Cyclic Shuffles.
New Gener. Comput., 2021

Committed-format AND protocol using only random cuts.
Nat. Comput., 2021

Evaluating card-based protocols in terms of execution time.
Int. J. Inf. Sec., 2021

Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori.
IACR Cryptol. ePrint Arch., 2021

Efficient Generation of a Card-Based Uniformly Distributed Random Derangement.
Proceedings of the WALCOM: Algorithms and Computation, 2021

Zero-Knowledge Proof Protocol for Cryptarithmetic Using Dihedral Cards.
Proceedings of the Unconventional Computation and Natural Computation, 2021

Card-Based Zero-Knowledge Proof Protocols for Graph Problems and Their Computational Model.
Proceedings of the Provable and Practical Security, 2021

Another Use of the Five-Card Trick: Card-Minimal Secure Three-Input Majority Function Evaluation.
Proceedings of the Progress in Cryptology - INDOCRYPT 2021, 2021

Card-Based ZKP Protocols for Takuzu and Juosan.
Proceedings of the 10th International Conference on Fun with Algorithms, 2021

A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards.
Proceedings of the Computer Science - Theory and Applications, 2021

Cooking Cryptographers: Secure Multiparty Computation Based on Balls and Bags.
Proceedings of the 34th IEEE Computer Security Foundations Symposium, 2021

A Card-Minimal Three-Input AND Protocol Using Two Shuffles.
Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

New Card-based Copy Protocols Using Only Random Cuts.
Proceedings of the 8th on ASIA Public-Key Cryptography Workshop, 2021

2020
Card-based protocols for secure ranking computations.
Theor. Comput. Sci., 2020

Efficient card-based zero-knowledge proof for Sudoku.
Theor. Comput. Sci., 2020

Practical card-based implementations of Yao's millionaire protocol.
Theor. Comput. Sci., 2020

Secure implementations of a random bisection cut.
Int. J. Inf. Sec., 2020

How to Implement a Non-uniform or Non-closed Shuffle.
Proceedings of the Theory and Practice of Natural Computing - 9th International Conference, 2020

Physical Zero-Knowledge Proof for Suguru Puzzle.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2020

Card-Based Covert Lottery.
Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2020

Public-PEZ Cryptography.
Proceedings of the Information Security - 23rd International Conference, 2020

Six-Card Finite-Runtime XOR Protocol with Only Random Cut.
Proceedings of the 7th on ASIA Public-Key Cryptography Workshop, 2020

2019
Card-Based Physical Zero-Knowledge Proof for Kakuro.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2019

Card-Based Protocol Against Actively Revealing Card Attack.
Proceedings of the Theory and Practice of Natural Computing - 8th International Conference, 2019

A Physical ZKP for Slitherlink: How to Perform Physical Topology-Preserving Computation.
Proceedings of the Information Security Practice and Experience, 2019

Light Cryptography.
Proceedings of the Information Security Education. Education in Proactive Information Security, 2019

Secure Computation of Any Boolean Function Based on Any Deck of Cards.
Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Interactive Physical Zero-Knowledge Proof for Norinori.
Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

Card-Based Secure Ranking Computations.
Proceedings of the Combinatorial Optimization and Applications, 2019

Session details: Session 1.
Proceedings of the 6th on ASIA Public-Key Cryptography Workshop, 2019

2018
Card-based protocols using unequal division shuffles.
Soft Comput., 2018

Pile-Shifting Scramble for Card-Based Protocols.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph.
Proceedings of the WALCOM: Algorithms and Computation - 12th International Conference, 2018

Analyzing Execution Time of Card-Based Protocols.
Proceedings of the Unconventional Computation and Natural Computation, 2018

Multi-party Computation Based on Physical Coins.
Proceedings of the Theory and Practice of Natural Computing - 7th International Conference, 2018

Physical Zero-Knowledge Proof for Makaro.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols.
Proceedings of the Combinatorial Algorithms - 29th International Workshop, 2018

The Six-Card Trick: Secure Computation of Three-Input Equality.
Proceedings of the Information Security and Cryptology - ICISC 2018, 2018

Card-based Protocols Using Triangle Cards.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Card-Based Zero-Knowledge Proof for Sudoku.
Proceedings of the 9th International Conference on Fun with Algorithms, 2018

Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol.
Proceedings of the Combinatorial Optimization and Applications, 2018

Five-Card AND Protocol in Committed Format Using Only Practical Shuffles.
Proceedings of the 5th ACM on ASIA Public-Key Cryptography Workshop, 2018

2017
Card-Based Protocols Using Regular Polygon Cards.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Computational Model of Card-Based Cryptographic Protocols and Its Applications.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Card-Based Protocols Using Unequal Division Shuffle.
IACR Cryptol. ePrint Arch., 2017

The Minimum Number of Cards in Practical Card-based Protocols.
IACR Cryptol. ePrint Arch., 2017

2016
Card-based protocols for securely computing the conjunction of multiple variables.
Theor. Comput. Sci., 2016

Secure Computation Protocols Using Polarizing Cards.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2016

How to Implement a Random Bisection Cut.
Proceedings of the Theory and Practice of Natural Computing - 5th International Conference, 2016

Necessary and Sufficient Numbers of Cards for Securely Computing Two-Bit Output Functions.
Proceedings of the Paradigms in Cryptology - Mycrypt 2016. Malicious and Exploratory Cryptology, 2016

An Implementation of Non-Uniform Shuffle for Secure Multi-Party Computation.
Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, 2016

Efficient and Secure Multiparty Computations Using a Standard Deck of Playing Cards.
Proceedings of the Cryptology and Network Security - 15th International Conference, 2016

2015
Securely Computing Three-Input Functions with Eight Cards.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2015

Efficient Card-Based Protocols for Generating a Hidden Random Permutation Without Fixed Points.
Proceedings of the Unconventional Computation and Natural Computation, 2015

Five-Card Secure Computations Using Unequal Division Shuffle.
Proceedings of the Theory and Practice of Natural Computing, 2015

Card-Based Protocols for Any Boolean Function.
Proceedings of the Theory and Applications of Models of Computation, 2015

Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards.
Proceedings of the Provable Security, 2015

Secure Multi-Party Computation Using Polarizing Cards.
Proceedings of the Advances in Information and Computer Security, 2015

Fundamental study on randomized processing in cryptographic IC using variable clock against Correlation Power Analysis.
Proceedings of the 10th International Workshop on the Electromagnetic Compatibility of Integrated Circuits, 2015

Basic Study on the Method for Real-Time Video Streaming with Low Latency and High Bandwidth Efficiency.
Proceedings of the 39th Annual Computer Software and Applications Conference, 2015

2014
A formalization of card-based cryptographic protocols via abstract machine.
Int. J. Inf. Sec., 2014

Investigation of Noise Interference due to Connector Contact Failure in a Coaxial Cable.
IEICE Trans. Electron., 2014

AES Cipher Keys Suitable for Efficient Side-Channel Vulnerability Evaluation.
IACR Cryptol. ePrint Arch., 2014

Minimizing ESCT forms for two-variable multiple-valued input binary output functions.
Discret. Appl. Math., 2014

Practical Card-Based Cryptography.
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Evaluation of Resistance and Inductance of Loose Connector Contact.
IEICE Trans. Electron., 2013

Study on Information Leakage of Input Key due to Frequency Fluctuation of RC Oscillator in Keyboard.
IEICE Trans. Commun., 2013

Voting with a Logarithmic Number of Cards.
Proceedings of the Unconventional Computation and Natural Computation, 2013

Securely Computing the Three-Input Majority Function with Eight Cards.
Proceedings of the Theory and Practice of Natural Computing, 2013

2012
Mechanism of Increase in Inductance at Loosened Connector Contact Boundary.
IEICE Trans. Electron., 2012

Evaluation of Information Leakage from Cryptographic Hardware via Common-Mode Current.
IEICE Trans. Electron., 2012

Absolutely Secure Message Transmission using a Key Sharing Graph.
Discret. Math. Algorithms Appl., 2012

The Five-Card Trick Can Be Done with Four Cards.
Proceedings of the Advances in Cryptology - ASIACRYPT 2012, 2012

2011
An Application of ST-Numbering to Secret Key Agreement.
Int. J. Found. Comput. Sci., 2011

Analysis of Electromagnetic Radiation from Transmission Line with Loose Contact of Connector.
IEICE Trans. Electron., 2011

Contact Conditions in Connectors that Cause Common Mode Radiation.
IEICE Trans. Electron., 2011

2010
Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions.
J. Multiple Valued Log. Soft Comput., 2010

2009
A one-round secure message broadcasting protocol through a key sharing tree.
Inf. Process. Lett., 2009

Mechanism behind Information Leakage in Electromagnetic Analysis of Cryptographic Modules.
Proceedings of the Information Security Applications, 10th International Workshop, 2009

Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions.
Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

Six-Card Secure AND and Four-Card Secure XOR.
Proceedings of the Frontiers in Algorithmics, Third International Workshop, 2009

2008
A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange.
Theory Comput. Syst., 2008

2007
An Application of ESOP Expressions to Secure Computations.
J. Circuits Syst. Comput., 2007

Secure Multiparty Computations Using a Dial Lock.
Proceedings of the Theory and Applications of Models of Computation, 2007

Secure Multiparty Computations Using the 15 Puzzle.
Proceedings of the Combinatorial Optimization and Applications, 2007

2006
Best Security Index for Digital Fingerprinting.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2006

Securely computing XOR with 10 cards.
Australas. J Comb., 2006

Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions.
Proceedings of the Theory and Applications of Models of Computation, 2006

2005
Worst-Case Optimal Fingerprinting Codes for Non-threshold Collusion.
Proceedings of the Digital Rights Management: Technologies, 2005

2004
Necessary and Sufficient Numbers of Cards for the Transformation Protocol.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
New Security Index for Digital Fingerprinting and Its Bounds.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2003

Characterization of optimal key set protocols.
Discret. Appl. Math., 2003

2002
A complete characterization of a family of key exchange protocols.
Int. J. Inf. Sec., 2002

2001
Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups.
Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

1999
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key.
Proceedings of the Advances in Cryptology, 1999

1998
Eulerian Secret Key Exchange.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998


  Loading...