Details of the Researcher

PHOTO

Takaaki Mizuki
Section
Cyberscience Center
Job title
Professor
Degree

  • 博士（情報科学）（東北大学）

  • 修士（情報科学）（東北大学）

e-Rad No.
90323089

Committee Memberships 11

  • 情報処理学会 コンピュータセキュリティ研究運営委員会　専門委員

    2019/04 - Present

  • 東北学術研究インターネットコミュニティ　技術部幹事

    2002/04 - Present

  • 情報処理学会 コンピュータセキュリティ研究運営委員会　運営委員

    2015/04 - 2019/03

  • 電子情報通信学会 基礎・境界ソサイエティ 情報セキュリティ研究専門委員会　幹事

    2016/06 - 2018/05

  • 電子情報通信学会 基礎・境界ソサイエティ 情報セキュリティ研究専門委員会　幹事補佐

    2014/06 - 2016/06

  • 情報処理学会 東北支部　運営委員

    2013/05 - 2015/05

  • 電子情報通信学会 情報・システムソサイエティ英文論文誌編集委員会　編集委員

    2011/07 - 2015/05

  • 電子情報通信学会 基礎・境界ソサイエティ 情報セキュリティ研究専門委員会　専門委員

    2005/08 - 2014/05

  • 情報処理学会 東北支部　評議員

    2010/05 - 2013/05

  • 情報処理学会 東北支部　評議員

    2006/04 - 2008/04

  • 情報処理学会 東北支部　庶務幹事

    2004/04 - 2006/04

Show all ︎Show first 5

Professional Memberships 3

  • IEEE

  • Information Processing Society of Japan

  • 電子情報通信学会

Research Interests 1

  • カードベース暗号

Research Areas 1

  • Informatics / Information theory /

Awards 4

  1. SCISイノベーション論文賞(2013)

    2014/01　電子情報通信学会情報セキュリティ研究専門委員会

  2. 2013 Best Symposium Paper Award, IEEE Electromagnetic Compatibility Society

    2013/08　IEEE Electromagnetic Compatibility Society

  3. 国際コミュニケーション基金優秀研究賞

    2005/11/15　財団法人国際コミュニケーション基金（ICF）

  4. 船井情報科学奨励賞

    2005/03/12　船井情報科学振興財団

Papers 139

  1. Single-shuffle Card-based Protocol with Eight Cards per Gate and Its Extensions International-journal Peer-reviewed

    Kazunari Tozawa, Hiraku Morita, Takaaki Mizuki

    Natural Computing　24　(1)　131-147　2025/03

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s11047-024-10006-5 　

    ISSN： 1567-7818

    eISSN： 1572-9796

    More details Close

    Abstract Card-based cryptography allows us to securely compute arbitrary functions using a deck of physical cards. Its performance is mainly measured by the number of used cards and shuffles, and there is a line of work that aims to reduce either of them. One seminal work is the card-based garbled circuit technique by Shinagawa and Nuida (Discret Appl Math 289:248–261, 2021, https://doi.org/10.1016/j.dam.2020.10.013), which allows the construction of a card-based protocol for any Boolean function with a single shuffle. Their construction requires $$2n + 24g$$ cards for an n-input Boolean function that is represented by g logical gates. In this paper, we reduce the number of cards to $$2n + 8g$$ for arbitrary functions while keeping it working with only one shuffle. In addition, we propose two types of extensions to support numerical encoding and multi-input gates. In the extended scheme, the free-ADD technique, obtained by generalizing the free-XOR technique by Manabe and Shinagawa (Deng J, Kolesnikov V, Schwarzmann AA (eds) CANS 2023, LNCS, vol 14342. Springer, Singapore, pp 232–248, 2023, https://doi.org/10.1007/978-981-99-7563-1-11), is available. The free-ADD technique allows our scheme to evaluate any n-input symmetric Boolean function using $$2n^2+6n+2$$ cards.

  2. How to Play Old Maid with Virtual Players International-journal Peer-reviewed

    Kazumasa Shinagawa, Daiki Miyahara, Takaaki Mizuki

    Theory of Computing Systems　69　(1)　2025/03/01

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s00224-024-10203-w 　

    ISSN： 1432-4350

    eISSN： 1433-0490

    More details Close

    Abstract Old Maid is a popular card game. While typically played with three or more players, it is less enjoyable with only two people. To address this, we propose a protocol to create a virtual player, Carol, by making use of card-based cryptography when only two people, Alice and Bob, are available to play Old Maid. Specifically, we design a card-based protocol to remove any pair of cards having the same number in Carol’s hand (namely, the virtual player’s hand) without leaking any information about Carol’s hand (more than necessary); our protocol uses additional cards aside from playing cards that are used in Old Maid. Using our protocol, without any third human player, Alice and Bob can have fun with Old Maid!

  3. Only Two Shuffles Perform Card-Based Zero-Knowledge Proof for Sudoku of Any Size International-journal Peer-reviewed

    Kodai Tanaka, Shun Sasaki, Kazumasa Shinagawa, Takaaki Mizuki

    Symposium on Simplicity in Algorithms (SOSA 2025), SIAM Proceedings Series　94-107　2025/01/07

    Publisher: Society for Industrial and Applied Mathematics

    DOI： 10.1137/1.9781611978315.7 　

  4. How to Play Old Maid with Virtual Players International-journal Peer-reviewed

    Kazumasa Shinagawa, Daiki Miyahara, Takaaki Mizuki

    Frontiers of Algorithmics (IJTCS-FAW 2024), Lecture Notes in Computer Science　14752　53-65　2024/12/29

    Publisher: Springer Nature Singapore

    DOI： 10.1007/978-981-97-7752-5_4 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  5. ZKP Protocols for Usowan, Herugolf, and Five Cells International-journal International-coauthorship Peer-reviewed

    Daiki Miyahara, Léo Robert, Pascal Lafourcade, Takaaki Mizuki

    Tsinghua Science and Technology　29　(6)　1651-1666　2024/12

    Publisher: Tsinghua University Press

    DOI： 10.26599/tst.2023.9010153 　

    eISSN： 1007-0214

  6. Physical Zero-Knowledge Proof Protocols for Topswops and Botdrops International-journal Peer-reviewed

    Yuichi Komano, Takaaki Mizuki

    New Generation Computing　42　(3)　399-428　2024/09

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s00354-024-00272-3 　

    ISSN： 0288-3635

    eISSN： 1882-7055

    More details Close

    Abstract Suppose that a sequence of $${\varvec{n } }$$ cards, numbered 1 to $${\varvec{n } }$$, is placed face up in random order. Let $${\varvec{k } }$$ be the number on the first card in the sequence. Then take the first $${\varvec{k } }$$ cards from the sequence, rearrange that subsequence of $${\varvec{k } }$$ cards in reverse order, and return them to the original sequence. Repeat this prefix reversal until the number on the first card in the sequence becomes 1. This is a one-player card game called Topswops. The computational complexity of Topswops has not been thoroughly investigated. For example, letting $${\varvec{f } }({\varvec{n } })$$ denote the maximum number of prefix reversals for Topswops with $${\varvec{n } }$$ cards, values of $${\varvec{f } }({\varvec{n } })$$ for $${\varvec{n } }\ge 20$$ remain unknown. In general, there is no known efficient algorithm for finding an initial sequence of $${\varvec{n } }$$ cards that requires exactly $$\ell $$ prefix reversals for any integers $${\varvec{n } }$$ and $${\varvec{\ell } }$$. In this paper, using a deck of cards, we propose a physical zero-knowledge proof protocol that allows a prover to convince a verifier that the prover knows an initial sequence of $${\varvec{n } }$$ cards that requires $${\varvec{\ell } }$$ prefix reversals without leaking knowledge of that sequence. We also deal with Botdrops, a variant of Topswops.

  7. Card-Based Zero-Knowledge Proof Protocols for the 15-Puzzle and the Token Swapping Problem International-journal

    Yuma Tamura, Akira Suzuki, Takaaki Mizuki

    Proceedings of the 11th ACM International Workshop on ASIA Public-Key Cryptography (APKC '24)　11-22　2024/07

    Publisher: ACM

    DOI： 10.1145/3659467.3659905 　

  8. Efficient Card-Based Protocols for Symmetric Functions Using Four-Colored Decks International-journal Peer-reviewed

    Yoshihiro Takahashi, Kazumasa Shinagawa, Hayato Shikata, Takaaki Mizuki

    Proceedings of the 11th ACM International Workshop on ASIA Public-Key Cryptography (APKC '24)　1-10　2024/07

    Publisher: ACM

    DOI： 10.1145/3659467.3659902 　

  9. Card-Based Cryptography Meets 3D Printer International-journal Peer-reviewed

    Yuki Ito, Hayato Shikata, Takuo Suganuma, Takaaki Mizuki

    Unconventional Computation and Natural Computation (UCNC 2024), Lecture Notes in Computer Science　14776　74-88　2024/06/18

    Publisher: Springer Nature Switzerland

    DOI： 10.1007/978-3-031-63742-1_6 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  10. Upper Bounds on the Number of Shuffles for Two-Helping-Card Multi-input AND Protocols International-journal Peer-reviewed

    Takuto Yoshida, Kodai Tanaka, Keisuke Nakabayashi, Eikoh Chida, Takaaki Mizuki

    Cryptology and Network Security (CANS 2023), Lecture Notes in Computer Science　14342　211-231　2023/10/31

    Publisher: Springer Nature Singapore

    DOI： 10.1007/978-981-99-7563-1_10 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  11. Two UNO Decks Efficiently Perform Zero-Knowledge Proof for Sudoku International-journal

    Kodai Tanaka, Takaaki Mizuki

    Fundamentals of Computation Theory (FCT 2023), Lecture Notes in Computer Science　14292　406-420　2023/09/21

    Publisher: Springer Nature Switzerland

    DOI： 10.1007/978-3-031-43587-4_29 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  12. Physical ZKP protocols for Nurimisaki and Kurodoko International-journal International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    Theoretical Computer Science　972　114071-114071　2023/09

    Publisher: Elsevier BV

    DOI： 10.1016/j.tcs.2023.114071 　

    ISSN： 0304-3975

  13. Few-helping-card Protocols for Some Wider Class of Symmetric Boolean Functions with Arbitrary Ranges International-journal Peer-reviewed

    Hayato Shikata, Daiki Miyahara, Takaaki Mizuki

    Proceedings of the 10th ACM Asia Public-Key Cryptography Workshop (APKC '23)　33-41　2023/07/10

    Publisher: ACM

    DOI： 10.1145/3591866.3593073 　

  14. Single-Shuffle Card-Based Protocol with Eight Cards per Gate International-journal Peer-reviewed

    Kazunari Tozawa, Hiraku Morita, Takaaki Mizuki

    Unconventional Computation and Natural Computation (UCNC 2023), Lecture Notes in Computer Science　14003　171-185　2023/06/01

    Publisher: Springer Nature Switzerland

    DOI： 10.1007/978-3-031-34034-5_12 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  15. Card-Based Zero-Knowledge Proof Protocol for Pancake Sorting International-journal Peer-reviewed

    Yuichi Komano, Takaaki Mizuki

    Innovative Security Solutions for Information Technology and Communications (SecITC 2022), Lecture Notes in Computer Science　13809　222-239　2023/05/12

    Publisher: Springer Nature Switzerland

    DOI： 10.1007/978-3-031-32636-3_13 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  16. Hide a Liar: Card-Based ZKP Protocol for Usowan International-journal International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    Theory and Applications of Models of Computation (TAMC 2022), Lecture Notes in Computer Science　13571　201-217　2023/01

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-20350-3_17 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  17. Secure Computations Through Checking Suits of Playing Cards International-journal Peer-reviewed

    Daiki Miyahara, Takaaki Mizuki

    Frontiers of Algorithmic Wisdom (FAW 2022), Lecture Notes in Computer Science　13461　110-128　2023/01

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-20796-9_9 　

    ISSN： 0302-9743

    eISSN： 1611-3349

    More details Close

    Abstract Card-based cryptography started with the “five-card trick” designed by Den Boer (EUROCRYPT 1989); it enables Alice and Bob to securely evaluate the AND value of their private bits using a physical deck of five cards. It was then shown that the same task can be done with only four cards, i.e., Mizuki et al. proposed a four-card AND protocol (ASIACRYPT 2012). These two AND protocols are simple and easy even for non-experts, such as high school students, to execute. Their only common drawback is the need to prepare a customized deck consisting of red and black cards such that all cards of the same color must be identical. Fortunately, several existing protocols are based on a standard deck of playing cards (commercially available). Among them, the state-of-the-art AND protocol was constructed by Koch et al. (ASIACRYPT 2019); it uses four playing cards (such as ‘A, J, Q, K’) to securely evaluate the AND value. The protocol is elaborate, while its possible drawback is the need to repeat a shuffling operation six times (in expectation), which makes it less practical. This paper aims to provide the first practical protocol working on a standard deck of playing cards. We present an extremely simple AND protocol that terminates after only one shuffle using only four cards; our proposed protocol relies on a new operation, called the “half-open” action, whereby players can check only the suit of a face-down card without revealing the number on it. We believe that this new operation is easy-to-implement, and hence, our four-card AND protocol working on a standard deck is practical. We formalize the half-open action to present a formal description of our proposed protocol. Moreover, we discuss what is theoretically implied by introducing the half-open action and show that it can be applied to efficiently solving Yao’s Millionaires’ problem with a standard deck of cards.

  18. Actively revealing card attack on card-based protocols International-journal Peer-reviewed

    Ken Takashima, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Natural Computing　21　(4)　615-628　2022/12

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s11047-020-09838-8 　

    ISSN： 1567-7818

    eISSN： 1572-9796

    More details Close

    Abstract In 1989, den Boer presented the first card-based protocol, called the “five-card trick,” that securely computes the AND function using a deck of physical cards via a series of actions such as shuffling and turning over cards. This protocol enables a couple to confirm their mutual love without revealing their individual feelings. During such a secure computation protocol, it is important to keep any information about the inputs secret. Almost all existing card-based protocols are secure under the assumption that all players participating in a protocol are semi-honest or covert, i.e., they do not deviate from the protocol if there is a chance that they will be caught when cheating. In this paper, we consider a more malicious attack in which a player as an active adversary can reveal cards illegally without any hesitation. Against such an actively revealing card attack, we define the t-secureness, meaning that no information about the inputs leaks even if at most t cards are revealed illegally. We then actually design t-secure AND protocols. Thus, our contribution is the construction of the first formal framework to handle actively revealing card attacks as well as their countermeasures.

  19. Physical Zero-Knowledge Proof Protocol for Topswops International-journal Peer-reviewed

    Yuichi Komano, Takaaki Mizuki

    Information Security Practice and Experience (ISPEC 2022), Lecture Notes in Computer Science　13620　537-553　2022/11

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-21280-2_30 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  20. Card-Based ZKP Protocol for Nurimisaki International-journal International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    Stabilization, Safety, and Security of Distributed Systems (SSS 2022), Lecture Notes in Computer Science　13751　285-298　2022/11

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-21017-4_19 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  21. Card-Minimal Protocols for Three-Input Functions with Standard Playing Cards International-journal Peer-reviewed

    Rikuo Haga, Yuichi Hayashi, Daiki Miyahara, Takaaki Mizuki

    Progress in Cryptology -- AFRICACRYPT 2022, Lecture Notes in Computer Science　13503　448-468　2022/10

    Publisher: Springer Nature Switzerland

    DOI： 10.1007/978-3-031-17433-9_19 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  22. Card-Minimal Protocols for Symmetric Boolean Functions of More than Seven Inputs International-journal Peer-reviewed

    Hayato Shikata, Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

    Theoretical Aspects of Computing (ICTAC 2022), Lecture Notes in Computer Science　13572　388-406　2022/10

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-17715-6_25 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  23. Coin-based Secure Computations International-journal Peer-reviewed

    Yuichi Komano, Takaaki Mizuki

    International Journal of Information Security　21　(4)　833-846　2022/08

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s10207-022-00585-8 　

    ISSN： 1615-5262

    eISSN： 1615-5270

    More details Close

    Abstract In the history of cryptography, many cryptographic protocols have relied on random coin tosses to prove their security. Although flipping coins is indispensable in this manner, the coins themselves have never been in the spotlight. Therefore, we would like to make physical coins rise to the level of cryptography, just as a deck of physical playing cards has been used to perform a secure multi-party computation. Such a card-based protocol is known to be helpful both to perform a secure computation without any black-box computers and to understand the principles of secure protocols. In this paper, we propose a new framework of secure multi-party computation using physical coins, named a coin-based protocol. One advantage of the use of coins is that they are more ubiquitous than cards. Whereas a face-down card can conceal the information about its face side, one side of a coin reveals the information of its other side. Hence, more careful design is required for a secure coin-based protocol than for a card-based one. We formalize a computational model of the coin-based protocol and explicitly give protocols for NOT, AND, COPY, OR, and XOR computations. We also discuss the composability of the extended protocols and how to implement them in practice.

  24. Card-Based Secure Sorting Protocol International-journal Peer-reviewed

    Rikuo Haga, Kodai Toyoda, Yuto Shinoda, Daiki Miyahara, Kazumasa Shinagawa, Yuichi Hayashi, Takaaki Mizuki

    Advances in Information and Computer Security (IWSEC 2022), Lecture Notes in Computer Science　13504　224-240　2022/08

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-031-15255-9_12 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  25. Physical zero-knowledge proof and NP-completeness proof of Suguru puzzle International-journal International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Luc Libralesso, Takaaki Mizuki

    Information and Computation　285　104858-104858　2022/05

    Publisher: Elsevier BV

    DOI： 10.1016/j.ic.2021.104858 　

    ISSN： 0890-5401

  26. Information leakage due to operative errors in card-based protocols International-journal Peer-reviewed

    Takaaki Mizuki, Yuichi Komano

    Information and Computation　285　104910-104910　2022/05

    Publisher: Elsevier BV

    DOI： 10.1016/j.ic.2022.104910 　

    ISSN： 0890-5401

  27. Card-based Single-shuffle Protocols for Secure Multiple-input AND and XOR Computations International-journal Peer-reviewed

    Tomoki Kuzuma, Raimu Isuzugawa, Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

    Proceedings of the 9th ACM International Workshop on ASIA Public-Key Cryptography (APKC '22)　51-58　2022/05

    DOI： 10.1145/3494105.3526236 　

  28. Card-Based ZKP for Connectivity: Applications to Nurikabe, Hitori, and Heyawake International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    New Generation Computing　40　(1)　149-171　2022/04

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s00354-022-00155-5 　

    ISSN： 0288-3635

    eISSN： 1882-7055

    More details Close

    Abstract During the last years, several card-based Zero-Knowledge Proof (ZKP) protocols for Nikoli’s puzzles have been designed. Although there are relatively simple card-based ZKP protocols for a number of puzzles, such as Sudoku and Kakuro, some puzzles face difficulties in designing simple protocols. For example, Slitherlink requires novel and elaborate techniques to construct a protocol. In this study, we focus on three Nikoli puzzles: Nurikabe, Hitori, and Heyawake. To date, no card-based ZKP protocol for these puzzles has been developed, partially because they have a relatively tricky rule that colored cells should form a connected area (namely a polyomino); this rule, sometimes referred to as “Bundan-kin” (in Japanese), complicates the puzzles, as well as facilitating difficulties in designing card-based ZKP protocols. We address this challenging task and propose a method for verifying the connectivity of hidden colored cells in a ZKP manner, such that we construct card-based ZKP protocols for the three puzzles.

  29. Committed-format AND protocol using only random cuts International-journal Peer-reviewed

    Yuta Abe, Takaaki Mizuki, Hideaki Sone

    Natural Computing　20　(4)　639-645　2021/12

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s11047-021-09862-2 　

    ISSN： 1567-7818

    eISSN： 1572-9796

  30. Another Use of the Five-Card Trick: Card-Minimal Secure Three-Input Majority Function Evaluation International-journal Peer-reviewed

    Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

    Progress in Cryptology -- INDOCRYPT 2021, Lecture Notes in Computer Science　13143　536-555　2021/12

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-92518-5_24 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  31. Card-Based Zero-Knowledge Proof Protocols for Graph Problems and Their Computational Model International-journal Peer-reviewed

    Daiki Miyahara, Hiromichi Haneda, Takaaki Mizuki

    Provable and Practical Security (ProvSec 2021), Lecture Notes in Computer Science　13059　136-152　2021/11

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-90402-9_8 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  32. A Card-Minimal Three-Input AND Protocol Using Two Shuffles International-journal Peer-reviewed

    Raimu Isuzugawa, Kodai Toyoda, Yu Sasaki, Daiki Miyahara, Takaaki Mizuki

    Computing and Combinatorics (COCOON 2021), Lecture Notes in Computer Science　668-679　2021/10

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-89543-3_55 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  33. Zero-Knowledge Proof Protocol for Cryptarithmetic Using Dihedral Cards International-journal Peer-reviewed

    Raimu Isuzugawa, Daiki Miyahara, Takaaki Mizuki

    Unconventional Computation and Natural Computation (UCNC 2021), Lecture Notes in Computer Science　51-67　2021/10

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-87993-8_4 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  34. How to construct physical zero-knowledge proofs for puzzles with a “single loop” condition International-journal International-coauthorship Peer-reviewed

    Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Léo Robert, Tatsuya Sasaki, Hideaki Sone

    Theoretical Computer Science　888　41-55　2021/10

    Publisher: Elsevier BV

    DOI： 10.1016/j.tcs.2021.07.019 　

    ISSN： 0304-3975

  35. Evaluating card-based protocols in terms of execution time International-journal Peer-reviewed

    Daiki Miyahara, Itaru Ueda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    International Journal of Information Security　20　(5)　729-740　2021/10

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s10207-020-00525-4 　

    ISSN： 1615-5262

    eISSN： 1615-5270

    More details Close

    <title>Abstract</title>Card-based cryptography is an attractive and unconventional computation model; it provides secure computing methods using a deck of physical cards. It is noteworthy that a card-based protocol can be easily executed by non-experts such as high school students without the use of any electric device. One of the main goals in this discipline is to develop efficient protocols. The efficiency has been evaluated by the number of required cards, the number of colors, and the average number of protocol trials. Although these evaluation metrics are simple and reasonable, it is difficult to estimate the total number of operations or execution time of protocols based only on these three metrics. Therefore, in this paper, we consider adding other metrics to estimate the execution time of protocols more precisely. Furthermore, we actually evaluate some of the important existing protocols using our new criteria.

  36. Interactive Physical ZKP for Connectivity: Applications to Nurikabe and Hitori International-journal Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    Beyond the Horizon of Computability (CiE 2021), Lecture Notes in Computer Science　12813　373-384　2021/07

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-80049-9_37 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  37. Cooking Cryptographers: Secure Multiparty Computation Based on Balls and Bags International-journal Peer-reviewed

    Daiki Miyahara, Yuichi Komano, Takaaki Mizuki, Hideaki Sone

    IEEE Computer Security Foundations Symposium (CSF 2021)　1-16　2021/06

    Publisher: IEEE

    DOI： 10.1109/csf51468.2021.00034 　

  38. A Secure Three-Input AND Protocol with a Standard Deck of Minimal Cards Peer-reviewed

    Hiroto Koyama, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Computer Science -- Theory and Applications (CSR 2021), Lecture Notes in Computer Science　12730　242-256　2021/06

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-79416-3_14 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  39. New Card-based Copy Protocols Using Only Random Cuts Peer-reviewed

    Hiroto Koyama, Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki

    Proceedings of the 8th ACM International Workshop on ASIA Public-Key Cryptography (APKC '21)　13-22　2021/06

    Publisher: ACM

    DOI： 10.1145/3457338.3458297 　

  40. Five-Card AND Computations in Committed Format Using Only Uniform Cyclic Shuffles International-journal Peer-reviewed

    Yuta Abe, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    New Generation Computing　39　(1)　97-114　2021/04

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s00354-020-00110-2 　

    ISSN： 0288-3635

    eISSN： 1882-7055

    More details Close

    <title>Abstract</title>In card-based cryptography, designing AND protocols in committed format is a major research topic. The state-of-the-art AND protocol proposed by Koch, Walzer, and Härtel in ASIACRYPT 2015 uses only four cards, which is the minimum permissible number. The minimality of their protocol relies on somewhat complicated shuffles having non-uniform probabilities of possible outcomes. Restricting the allowed shuffles to uniform closed ones entails that, to the best of our knowledge, six cards are sufficient: the six-card AND protocol proposed by Mizuki and Sone in 2009 utilizes the random bisection cut, which is a uniform and cyclic (and hence, closed) shuffle. Thus, a question has arisen: “Can we improve upon this six-card protocol using only uniform closed shuffles?” In other words, the existence or otherwise of a five-card AND protocol in committed format using only uniform closed shuffles has been one of the most important open questions in this field. In this paper, we answer the question affirmatively by designing five-card committed-format AND protocols using only uniform cyclic shuffles. The shuffles that our protocols use are the random cut and random bisection cut, both of which are uniform cyclic shuffles and can be easily implemented by humans.

  41. Efficient Generation of a Card-Based Uniformly Distributed Random Derangement Peer-reviewed

    Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Algorithms and Computation (WALCOM 2021), Lecture Notes in Computer Science　12635　78-89　2021/02

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-68211-8_7 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  42. Card-Based Covert Lottery International-journal Peer-reviewed

    Yuto Shinoda, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone

    Innovative Security Solutions for Information Technology and Communications (SecITC 2020), Lecture Notes in Computer Science　12596　257-270　2021/02

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-69255-1_17 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  43. How to Implement a Non-uniform or Non-closed Shuffle International-journal Peer-reviewed

    Takahiro Saito, Daiki Miyahara, Yuta Abe, Takaaki Mizuki, Hiroki Shizuya

    Theory and Practice of Natural Computing (TPNC 2020), Lecture Notes in Computer Science　12494　107-118　2020/12

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-63000-3_9 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  44. Card-based protocols for secure ranking computations Peer-reviewed

    Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone

    Theoretical Computer Science　845　122-135　2020/12

    Publisher: Elsevier BV

    DOI： 10.1016/j.tcs.2020.09.008 　

    ISSN： 0304-3975

  45. Physical Zero-Knowledge Proof for Suguru Puzzle International-journal International-coauthorship Peer-reviewed

    Léo Robert, Daiki Miyahara, Pascal Lafourcade, Takaaki Mizuki

    Stabilization, Safety, and Security of Distributed Systems (SSS 2020), Lecture Notes in Computer Science　12514　235-247　2020/11

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-64348-5_19 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  46. Public-PEZ Cryptography Peer-reviewed

    Soma Murata, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Information Security (ISC 2020), Lecture Notes in Computer Science　12472　59-74　2020/11

    Publisher: Springer International Publishing

    DOI： 10.1007/978-3-030-62974-8_4 　

    ISSN： 0302-9743

    eISSN： 1611-3349

  47. Efficient Card-based Zero-knowledge Proof for Sudoku Peer-reviewed

    Tatsuya Sasaki, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Theoretical Computer Science　839　135-142　2020/11

    Publisher: Elsevier BV

    DOI： 10.1016/j.tcs.2020.05.036 　

    ISSN： 0304-3975

  48. Six-Card Finite-Runtime XOR Protocol with Only Random Cut Peer-reviewed

    Kodai Toyoda, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Proceedings of the 7th ACM Workshop on ASIA Public-Key Cryptography　2-8　2020/10/05

    Publisher: ACM

    DOI： 10.1145/3384940.3388961 　

  49. Card-Based ZKP Protocols for Takuzu and Juosan International-coauthorship Peer-reviewed

    Daiki Miyahara, Léo Robert, Pascal Lafourcade, So Takeshige, Takaaki Mizuki, Kazumasa Shinagawa, Atsuki Nagao, Hideaki Sone

    Fun with Algorithms (FUN 2021), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik　157　20:1-20:21　2020/09

    DOI： 10.4230/LIPIcs.FUN.2021.20 　

  50. Secure Implementations of a Random Bisection Cut Peer-reviewed

    Itaru Ueda, Daiki Miyahara, Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    International Journal of Information Security　19　(4)　445-452　2020/08

    Publisher: Springer Science and Business Media LLC

    DOI： 10.1007/s10207-019-00463-w 　

    ISSN： 1615-5262

    eISSN： 1615-5270

  51. Practical Card-Based Implementations of Yao's Millionaire Protocol Peer-reviewed

    Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Theoretical Computer Science　803　207-221　2020/01

    DOI： 10.1016/j.tcs.2019.11.005 　

  52. Card-Based Secure Ranking Computations Peer-reviewed

    Ken Takashima, Yuta Abe, Tatsuya Sasaki, Daiki Miyahara, Kazumasa Shinagawa, Takaaki Mizuki, Hideaki Sone

    Combinatorial Optimization and Applications (COCOA 2019), Lecture Notes in Computer Science　11949　461-472　2019/12

    DOI： 10.1007/978-3-030-36412-0_37 　

  53. Card-Based Protocol Against Actively Revealing Card Attack Peer-reviewed

    Ken Takashima, Daiki Miyahara, Takaaki Mizuki, Hideaki Sone

    Theory and Practice of Natural Computing (TPNC 2019), Lecture Notes in Computer Science　11934　95-106　2019/12

    DOI： 10.1007/978-3-030-34500-6_6 　

  54. A Physical ZKP for Slitherlink: How to Perform Physical Topology-Preserving Computation Peer-reviewed

    Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone

    Information Security Practice and Experience (ISPEC 2019), Lecture Notes in Computer Science　11879　135-151　2019/11

    DOI： 10.1007/978-3-030-34339-2_8 　

  55. Card-based Physical Zero-knowledge Proof for Kakuro Peer-reviewed

    Daiki Miyahara, Tatsuya Sasaki, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Fundamentals　102-A　(9)　1072-1078　2019/09

    DOI： 10.1587/transfun.E102.A.1072 　

  56. Interactive Physical Zero-Knowledge Proof for Norinori Peer-reviewed

    Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Tatsuya Sasaki, Hideaki Sone

    Computing and Combinatorics (COCOON 2019), Lecture Notes in Computer Science　11653　166-177　2019/07

    DOI： 10.1007/978-3-030-26176-4_14 　

  57. Light Cryptography Peer-reviewed

    Pascal Lafourcade, Takaaki Mizuki, Atsuki Nagao, Kazumasa Shinagawa

    Information Security Education (WISE 2019), IFIP Advances in Information and Communication Technology　557　89-101　2019/06

    DOI： 10.1007/978-3-030-23451-5_7 　

  58. Secure Computation of Any Boolean Function Based on Any Deck of Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki

    Frontiers in Algorithmics (FAW 2019), Lecture Notes in Computer Science　11458　63-75　2019/04

    DOI： 10.1007/978-3-030-18126-0_6 　

  59. The Six-Card Trick: Secure Computation of Three-Input Equality Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki

    Information Security and Cryptology (ICISC 2018), Lecture Notes in Computer Science　11396　123-131　2019/01

    DOI： 10.1007/978-3-030-12146-4_8 　

  60. Practical and Easy-to-Understand Card-Based Implementation of Yao's Millionaire Protocol Peer-reviewed

    Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Combinatorial Optimization and Applications (COCOA 2018), Lecture Notes in Computer Science　11346　246-261　2018/12

    DOI： 10.1007/978-3-030-04651-4_17 　

  61. Multi-party Computation Based on Physical Coins Peer-reviewed

    Yuichi Komano, Takaaki Mizuki

    Theory and Practice of Natural Computing (TPNC 2018), Lecture Notes in Computer Science　11324　87-98　2018/12

    DOI： 10.1007/978-3-030-04070-3_7 　

  62. Physical Zero-Knowledge Proof for Makaro Peer-reviewed

    Xavier Bultel, Jannik Dreier, Jean-Guillaume Dumas, Pascal Lafourcade, Daiki Miyahara, Takaaki Mizuki, Atsuki Nagao, Tatsuya Sasaki, Kazumasa Shinagawa, Hideaki Sone

    Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Lecture Notes in Computer Science　11201　111-125　2018/11

    DOI： 10.1007/978-3-030-03232-6_8 　

  63. Information Leakage Threats for Cryptographic Devices Using IEMI and EM Emission Peer-reviewed

    Ko Nakamura, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEEE Transactions on Electromagnetic Compatibility,vol., no., pp.-, 2018.　60　(5)　1340-1347　2018/09

    DOI： 10.1109/TEMC.2017.2766139 　

  64. Pile-Shifting Scramble for Card-Based Protocols Peer-reviewed

    Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Fundamentals　E101-A　(9)　1494-1502　2018/09

    DOI： 10.1587/transfun.E101.A.1494 　

  65. Analysis of Information Leakage Due to Operative Errors in Card-Based Protocols Peer-reviewed

    Takaaki Mizuki, Yuichi Komano

    Combinatorial Algorithms (IWOCA 2018), Lecture Notes in Computer Science　10979　250-262　2018/07

    DOI： 10.1007/978-3-319-94667-2_21 　

  66. Analyzing Execution Time of Card-Based Protocols Peer-reviewed

    Daiki Miyahara, Itaru Ueda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Unconventional Computation and Natural Computation (UCNC 2018), Lecture Notes in Computer Science　10867　145-158　2018/06

    DOI： 10.1007/978-3-319-92435-9_11 　

  67. Card-based Protocols Using Triangle Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki

    Fun with Algorithms (FUN 2018), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik　100　31:1-31:13　2018/06

    DOI： 10.4230/LIPIcs.FUN.2018.31 　

  68. Card-Based Zero-Knowledge Proof for Sudoku Peer-reviewed

    Tatsuya Sasaki, Takaaki Mizuki, Hideaki Sone

    Fun with Algorithms (FUN 2018), Leibniz International Proceedings in Informatics (LIPIcs), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik　100　29:1-29:10　2018/06

    DOI： 10.4230/LIPIcs.FUN.2018.29 　

  69. Five-Card AND Protocol in Committed Format Using Only Practical Shuffles Peer-reviewed

    Yuta Abe, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Proceedings of the 5rd ACM International Workshop on ASIA Public-Key Cryptography (APKC '18),　3-8　2018/06

    DOI： 10.1145/3197507.3197510 　

  70. Secret Key Amplification from Uniformly Leaked Key Exchange Complete Graph Peer-reviewed

    Tatsuya Sasaki, Bateh Mathias Agbor, Shingo Masuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Algorithms and Computation (WALCOM 2018), Lecture Notes in Computer Science　10755　20-31　2018/03

    DOI： 10.1007/978-3-319-75172-6_3 　

  71. Card-Based Protocols Using Unequal Division Shuffles Peer-reviewed

    Akihiro Nishimura, Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Soft Computing　22　(2)　361-371　2018/01

    DOI： 10.1007/s00500-017-2858-2 　

  72. The Minimum Number of Cards in Practical Card-Based Protocols Peer-reviewed

    Julia Kastner, Alexander Koch, Stefan Walzer, Daiki Miyahara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Advances in Cryptology -- ASIACRYPT 2017, Part III, Lecture Notes in Computer Science　10626　126-155　2017/12

    DOI： 10.1007/978-3-319-70700-6_5 　

  73. Necessary and Sufficient Numbers of Cards for Securely Computing Two-Bit Output Functions Peer-reviewed

    Danny Francis, Syarifah Ruqayyah Aljunid, Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Paradigms in Cryptology (Mycrypt 2016), Lecture Notes in Computer Science　10311　193-211　2017/11

    DOI： 10.1007/978-3-319-61273-7_10 　

  74. Card-Based Protocols Using Regular Polygon Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki, Jacob C, N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

    IEICE Trans. Fundamentals　E100-A　(9)　1900-1909　2017/09

    DOI： 10.1587/transfun.E100.A.1900 　

  75. Computational Model of Card-Based Cryptographic Protocols and Its Applications Invited Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya

    IEICE Trans. Fundamentals　E100-A　(1)　3-11　2017/01

    DOI： 10.1587/transfun.E100.A.3 　

  76. How to Implement a Random Bisection Cut Peer-reviewed

    Itaru Ueda, Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Theory and Practice of Natural Computing (TPNC 2016), Lecture Notes in Computer Science　10071　58-69　2016/12

    DOI： 10.1007/978-3-319-49001-4_5 　

  77. Efficient and Secure Multiparty Computations Using a Standard Deck of Playing Cards Peer-reviewed

    Takaaki Mizuki

    Cryptology and Network Security (CANS 2016), Lecture Notes in Computer Science　10052　484-499　2016/11

    DOI： 10.1007/978-3-319-48965-0_29 　

  78. Secure Computation Protocols Using Polarizing Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki, Jacob C, N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

    IEICE Trans. Fundamentals　E99-A　(6)　1122-1131　2016/06

    DOI： 10.1587/transfun.E99.A.1122 　

  79. An Implementation of Non-Uniform Shuffle for Secure Multi-Party Computation Peer-reviewed

    Akihiro Nishimura, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography (AsiaPKC '16)　49-55　2016/05

    DOI： 10.1145/2898420.2898425 　

  80. Card-Based Protocols for Securely Computing the Conjunction of Multiple Variables Peer-reviewed

    Takaaki Mizuki

    Theoretical Computer Science　622　34-44　2016/04

    DOI： 10.1016/j.tcs.2016.01.039 　

  81. Five-Card Secure Computations Using Unequal Division Shuffle Peer-reviewed

    Akihiro Nishimura, Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Theory and Practice of Natural Computing (TPNC 2015), Lecture Notes in Computer Science　9477　109-120　2015/12

    DOI： 10.1007/978-3-319-26841-5_9 　

  82. Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki, Jacob C, N. Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

    International Conference on Provable Security (ProvSec 2015), Lecture Notes in Computer Science　9451　127-146　2015/11

    DOI： 10.1007/978-3-319-26059-4_7 　

  83. Efficient Card-based Protocols for Generating a Hidden Random Permutation without Fixed Points Peer-reviewed

    Rie Ishikawa, Eikoh Chida, Takaaki Mizuki

    Unconventional Computation and Natural Computation (UCNC 2015), Lecture Notes in Computer Science　9252　215-226　2015/08

    DOI： 10.1007/978-3-319-21819-9_16 　

  84. Secure Multi-Party Computation Using Polarizing Cards Peer-reviewed

    Kazumasa Shinagawa, Takaaki Mizuki, Jacob Schuldt, Koji Nuida, Naoki Kanayama, Takashi Nishide, Goichiro Hanaoka, Eiji Okamoto

    Advances in Information and Computer Security (IWSEC 2015), Lecture Notes in Computer Science　9241　281-297　2015/08

    DOI： 10.1007/978-3-319-22425-1_17 　

  85. Method for Estimating Fault Injection Time on Cryptographic Devices from EM Leakage Peer-reviewed

    Ko Nakamura, Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2014)　235-240　2015/08

    DOI： 10.1109/ISEMC.2015.7256165 　

  86. Securely Computing Three-input Functions with Eight Cards Peer-reviewed

    Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Fundamentals　E98-A　(6)　1145-1152　2015/06

    DOI： 10.1587/transfun.E98.A.1145 　

  87. Card-Based Protocols for Any Boolean Function Peer-reviewed

    Takuya Nishida, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    Theory and Applications of Models of Computation (TAMC 2015), Lecture Notes in Computer Science　9076　110-121　2015/05

    DOI： 10.1007/978-3-319-17142-5_11 　

  88. Investigation of Noise Interference due to Connector Contact Failure in a Coaxial Cable Peer-reviewed

    Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Electronics　E97-C　(9)　900-903　2014/09

    DOI： 10.1587/transele.E97.C.900 　

  89. Precisely Timed IEMI Fault Injection Synchronized with EM Information Leakage Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2014)　738-742　2014/08

    DOI： 10.1109/ISEMC.2014.6899066 　

  90. Practical Card-Based Cryptography Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya

    Fun with Algorithms (FUN 2014), Lecture Notes in Computer Science　8496　313-324　2014/07

    DOI： 10.1007/978-3-319-07890-8_27 　

  91. Minimizing ESCT Forms for Two-Variable Multiple-Valued Input Binary Output Functions Peer-reviewed

    Takaaki Mizuki, Daizo Mikami, Hideaki Sone

    Discrete Applied Mathematics　169　186-194　2014/05

    DOI： 10.1016/j.dam.2013.12.023 　

  92. A Formalization of Card-Based Cryptographic Protocols via Abstract Machine Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya

    International Journal of Information Security　13　(1)　15-23　2014/02/01

    DOI： 10.1007/s10207-013-0219-4 　

  93. Securely Computing the Three-Input Majority Function with Eight Cards Peer-reviewed

    Takuya Nishida, Takaaki Mizuki, Hideaki Sone

    Theory and Practice of Natural Computing (TPNC 2013), Lecture Notes in Computer Science　8273　193-204　2013/12

    DOI： 10.1007/978-3-642-45008-2_16 　

  94. Study on Information Leakage of Input Key due to Frequency Fluctuation of RC Oscillator in Keyboard Peer-reviewed

    Masahiro Kinugawa, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Communications　E96-B　(10)　2633-2638　2013/10/01

    DOI： 10.1587/transcom.E96.B.2633 　

  95. Evaluation of Resistance and Inductance of Loose Connector Contact Peer-reviewed

    Kazuya Uehara, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Electronics　E96-C　(9)　1148-1150　2013/09

    DOI： 10.1587/transele.E96.C.1148 　

  96. Map-Based Analysis of IEMI Fault Injection into Cryptographic Devices Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2013)　829-833　2013/08

    DOI： 10.1109/ISEMC.2013.6670525 　

  97. Voting with a Logarithmic Number of Cards Peer-reviewed

    Takaaki Mizuki, Isaac Kobina Asiedu, Hideaki Sone

    Unconventional Computation and Natural Computation (UCNC 2013), Lecture Notes in Computer Science　7956　162-173　2013/07

    DOI： 10.1007/978-3-642-39074-6_16 　

  98. Efficient Evaluation of EM Radiation Associated with Information Leakage from Cryptographic Devices Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Haruki Shimada, Takafumi Aoki, Hideaki Sone, Laurent Sauvage, Jean-Luc Danger

    IEEE Transactions on Electromagnetic Compatibility　55　(3)　555-563　2013/06

    DOI： 10.1109/TEMC.2012.2222890 　

  99. Analysis of Electromagnetic Information Leakage from Cryptographic Devices with Different Physical Structures Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone, Laurent Sauvage, Jean-Luc Danger

    IEEE Transactions on Electromagnetic Compatibility　55　(3)　571-580　2013/06

    DOI： 10.1109/TEMC.2012.2227486 　

  100. Transient IEMI Threats for Cryptographic Devices Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone

    IEEE Transactions on Electromagnetic Compatibility　55　(1)　140-148　2013/02

    DOI： 10.1109/TEMC.2012.2206393 　

  101. The Five-Card Trick Can Be Done with Four Cards Peer-reviewed

    Takaaki Mizuki, Michihito Kumamoto, Hideaki Sone

    Advances in Cryptology -- ASIACRYPT 2012, Lecture Notes in Computer Science　7658　598-606　2012/12

    DOI： 10.1007/978-3-642-34961-4_36 　

  102. Absolutely Secure Message Transmission Using a Key Sharing Graph Peer-reviewed

    Yoshihiro Indo, Takaaki Mizuki, Takao Nishizeki

    Discrete Mathematics, Algorithms and Applications　4　(4)　1250053-1-1250053-15　2012/09/21

    DOI： 10.1142/S179383091250053X 　

  103. Mechanism of Increase in Inductance at Loosened Connector Contact Boundary Peer-reviewed

    Kazuki Matsuda, Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Electronics　E95-C　(9)　1502-1507　2012/09

    DOI： 10.1587/transele.E95.C.1502 　

  104. Efficient Mapping of EM Radiation Associated with Information Leakage for Cryptographic Devices Peer-reviewed

    Haruki Shimada, Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone, Laurent Sauvage, Jean-Luc Danger

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2012)　794-799　2012/08/09

    DOI： 10.1109/ISEMC.2012.6351663 　

  105. An Efficient Method for Estimating the Area of Information Propagation through Electromagnetic Radiation Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Taishi Ikematsu, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone, Jean-Luc Danger

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2012)　800-805　2012/08/09

    DOI： 10.1109/ISEMC.2012.6351662 　

  106. Evaluation of Information Leakage from Cryptographic Hardware via Common-Mode Current Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takeshi Sugawara, Yoshiki Kayano, Takafumi Aoki, Shigeki Minegishi, Akashi Satoh, Hideaki Sone, Hiroshi Inoue

    IEICE Trans. Electronics　E95-C　(6)　1089-1097　2012/06/01

    DOI： 10.1587/transele.E95.C.1089 　

  107. Contact Conditions in Connectors that Cause Common Mode Radiation Peer-reviewed

    Yu-ichi Hayashi, Yoshiki Kayano, Takaaki Mizuki, Hideaki Sone, Hiroshi Inoue

    IEICE Trans. Electronics　E94-C　(9)　1369-1374　2011/09

    DOI： 10.1587/transele.E94.C.1369 　

  108. Analysis of Electromagnetic Radiation from Transmission Line with Loose Contact of Connector Peer-reviewed

    Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEICE Trans. Electronics　E94-C　(9)　1427-1430　2011/09

    DOI： 10.1587/transele.E94.C.1427 　

  109. An Application of st-Numbering to Secret Key Agreement Peer-reviewed

    Takaaki Mizuki, Satoru Nakayama, Hideaki Sone

    International Journal of Foundations of Computer Science　22　(5)　1211-1227　2011/08

    DOI： 10.1142/S0129054111008659 　

  110. Non-Invasive EMI-Based Fault Injection Attack against Cryptographic Modules Peer-reviewed

    Yu-ichi Hayashi, Naofumi Homma, Takeshi Sugawara, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2011)　763-767　2011/08

    DOI： 10.1109/ISEMC.2011.6038411 　

  111. Suppression of Information Leakage from Electronic Devices Based on SNR Peer-reviewed

    Taishi Ikematsu, Yu-ichi Hayashi, Takaaki Mizuki, Naofumi Homma, Takafumi Aoki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2011)　920-924　2011/08

    DOI： 10.1109/ISEMC.2011.6038440 　

  112. Information Leakage from Cryptographic Hardware via Common-Mode Current Peer-reviewed

    Yu-ichi Hayashi, Takeshi Sugawara, Yoshiki Kayano, Naofumi Homma, Takaaki Mizuki, Akashi Satoh, Takafumi Aoki, Shigeki Minegishi, Hideaki Sone, Hiroshi Inoue

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2010)　109-114　2010/07

    DOI： 10.1109/ISEMC.2010.5711256 　

  113. Modeling Connector Contact Condition Using a Contact Failure Model with Equivalent Inductance Peer-reviewed

    Yu-ichi Hayashi, Songping Wu, Jun Fan, Takaaki Mizuki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2010)　743-747　2010/07

    DOI： 10.1109/ISEMC.2010.5711371 　

  114. Minimizing AND-EXOR Expressions for Two-Variable Multiple-Valued Input Binary Output Functions Peer-reviewed

    Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki

    Journal of Multiple-Valued Logic and Soft Computing　16　197-208　2010/01

  115. Mechanism behind Information Leakage in Electromagnetic Analysis of Cryptographic Modules Peer-reviewed

    Takeshi Sugawara, Yu-ichi Hayashi, Naofumi Homma, Takaaki Mizuki, Takafumi Aoki, Hideaki Sone, Akashi Satoh

    Information Security Applications (WISA 2009), Lecture Notes in Computer Science　5932　66-78　2009/12

    DOI： 10.1007/978-3-642-10838-9_6 　

  116. Relationship between Connector Contact Points and Common-Mode Current on a Coaxial Transmission Line Peer-reviewed

    Yu-ichi Hayashi, Takaaki Mizuki, Hideaki Sone

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2009)　209-212　2009/08

    DOI： 10.1109/ISEMC.2009.5284621 　

  117. A One-Round Secure Message Broadcasting Protocol through a Key Sharing Tree Peer-reviewed

    Takaaki Mizuki, Takuya Sato, Hideaki Sone

    Information Processing Letters　109　(15)　842-845　2009/07/16

    DOI： 10.1016/j.ipl.2009.04.004 　

  118. Six-Card Secure AND and Four-Card Secure XOR Peer-reviewed

    Takaaki Mizuki, Hideaki Sone

    Frontiers in Algorithmics (FAW 2009), Lecture Notes in Computer Science　5598　358-369　2009/06

    DOI： 10.1007/978-3-642-02270-8_36 　

  119. Minimizing AND-EXOR Expressions for Multiple-Valued Two-Input Logic Functions (Extended Abstract) Peer-reviewed

    Takaaki Mizuki, Hitoshi Tsubata, Takao Nishizeki

    Theory and Applications of Models of Computation (TAMC 2009), Lecture Notes in Computer Science　5532　301-310　2009/05

    DOI： 10.1007/978-3-642-02017-9_33 　

  120. On contact conditions in connectors to cause Common Mode radiation Peer-reviewed

    Yu-ichi Hayashi, Yoshiki Kayano, Takaaki Mizuki, Hideaki Sone, Hiroshi Inoue

    IEEE International Symposium on Electromagnetic Compatibility (EMC 2008)　1-4　2008/08

    DOI： 10.1109/ISEMC.2008.4652102 　

  121. A Revised Transformation Protocol for Unconditionally Secure Secret Key Exchange Peer-reviewed

    Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

    Theory of Computing Systems　42　(2)　187-221　2008/02

    DOI： 10.1007/s00224-007-9052-3 　

  122. Secure Multiparty Computations Using the 15 Puzzle (Extended Abstract) Invited Peer-reviewed

    Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone

    Combinatorial Optimization and Applications (COCOA 2007), Lecture Notes in Computer Science　4616　255-266　2007/08

    DOI： 10.1007/978-3-540-73556-4_28 　

  123. Secure Multiparty Computations Using a Dial Lock (Extended Abstract) Peer-reviewed

    Takaaki Mizuki, Yoshinori Kugimoto, Hideaki Sone

    Theory and Applications of Models of Computation (TAMC 2007), Lecture Notes in Computer Science　4484　499-510　2007/05

    DOI： 10.1007/978-3-540-72504-6_45 　

  124. An Application of ESOP Expressions to Secure Computations Peer-reviewed

    Takaaki Mizuki, Taro Otagiri, Hideaki Sone

    Journal of Circuits, Systems, and Computers　16　(2)　191-198　2007/04

    DOI： 10.1142/S0218126607003605 　

  125. Securely Computing XOR with 10 Cards Peer-reviewed

    Takaaki Mizuki, Fumishige Uchiike, Hideaki Sone

    Australasian Journal of Combinatorics　36　279-293　2006/10

  126. Worst-Case Optimal Fingerprinting Codes for Non-Threshold Collusion Peer-reviewed

    Takaaki Mizuki, Satoshi Nounin, Hideaki Sone, Yousuke Toyota

    Digital Rights Management: Technology, Issues, Challenges and Systems (DRMTICS 2005), Lecture Notes in Computer Science　3919　203-216　2006/08

    DOI： 10.1007/11787952_16 　

  127. Secure Computations in a Minimal Model Using Multiple-Valued ESOP Expressions Peer-reviewed

    Takaaki Mizuki, Taro Otagiri, Hideaki Sone

    Theory and Applications of Models of Computation (TAMC 2006), Lecture Notes in Computer Science　3959　547-554　2006/05

    DOI： 10.1007/11750321_52 　

  128. Best Security Index for Digital Fingerprinting Peer-reviewed

    Kozo BANNO, Shingo ORIHARA, Takaaki MIZUKI, Takao NISHIZEKI

    IEICE Trans. Fundamentals　E89-A　(1)　169-177　2006/01

    DOI： 10.1093/ietfec/e89-a.1.169 　

  129. Best Security Index for Digital Fingerprinting (Extended Abstract) Peer-reviewed

    Kozo Banno, Shingo Orihara, Takaaki Mizuki, Takao Nishizeki

    Information Hiding Workshop (IH 2005), Lecture Notes in Computer Science　3106　398-412　2005/12

    DOI： 10.1007/11558859_29 　

  130. Necessary and sufficient numbers of cards for the transformation protocol Peer-reviewed

    Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

    Proc. COCOON 2004, Lecture Notes in Computer Science　3106　92-101　2004

  131. Characterization of Optimal Key Set Protocols Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

    Discrete Applied Mathematics　131　(1)　213-236　2003/09

    DOI： 10.1016/S0166-218X(02)00426-2 　

  132. New Security Index for Digital Fingerprinting and Its Bounds Peer-reviewed

    Shingo ORIHARA, Takaaki MIZUKI, Takao NISHIZEKI

    IEICE Trans. Fundamentals　E86-A　(5)　1156-1163　2003/05

  133. A Complete Characterization of a Family of Key Exchange Protocols Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

    International Journal of Information Security　1　(2)　131-142　2002/02

    DOI： 10.1007/s102070100011 　

  134. Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups Peer-reviewed

    Takaaki MIZUKI, Takao NISHIZEKI

    IEICE Trans. Inf. & Syst.　E85-D　(2)　333-345　2002/02

  135. Necessary and sufficient numbers of cards for sharing secret keys on hierarchical groups Peer-reviewed

    Takaaki Mizuki, Takao Nishizeki

    Proc. ISAAC 2001, Lecture Notes in Computer Science　2223　196-207　2001

    DOI： 10.1007/3-540-45678-3_18 　

  136. On the Average Length of Secret Key Exchange Eulerian Circuits Peer-reviewed

    Takaaki MIZUKI, Zhi-Bo SUI, Hiroki SHIZUYA, Takao NISHIZEKI

    IEICE Trans. Fundamentals　E83-A　(4)　662-670　2000

  137. Characterization of optimal key set protocols Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

    Proc. IFIP TCS 2000, Lecture Notes in Computer Science　1872　273-285　2000

  138. Dealing necessary and sufficient numbers of cards for sharing a one-bit secret key Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

    Proc. Eurocrypt '99, Lecture Notes in Computer Science　1592　389-401　1999/05

    DOI： 10.1007/3-540-48910-X_27 　

  139. Eulerian secret key exchange Peer-reviewed

    Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

    Computing and Combinatorics (COCOON '98), Lecture Notes in Computer Science　1449　349-360　1998/08

Show all ︎Show first 5

Misc. 1

  1. カード組を用いた秘密計算

    水木敬明

    基礎・境界ソサイエティ Fundamentals Review　9　(3)　179-187　2016/01/01

    Publisher: 電子情報通信学会

    DOI： 10.1587/essfr.9.3_179