Kazumasa Shinagawa

CoRR, September, 2025

A Note on Single-Cut Full-Open Protocols.

[BibT_eX]

[DOI]

CoRR, July, 2025

Correction to: How to Play Old Maid with Virtual Players.

[BibT_eX]

[DOI]

Daiki Miyahara

Theory Comput. Syst., March, 2025

Simulating Virtual Players for UNO without Computers.

[BibT_eX]

[DOI]

Suthee Ruangwises

CoRR, February, 2025

Visualizing differentially private mechanisms with physical cards.

[BibT_eX]

[DOI]

Reo Eriguchi

Takao Murakami

Theor. Comput. Sci., 2025

Card-Based Protocols Imply PSM Protocols.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Theoretical Aspects of Computer Science, 2025

Only Two Shuffles Perform Card-Based Zero-Knowledge Proof for Sudoku of Any Size.

[BibT_eX]

[DOI]

Proceedings of the 2025 Symposium on Simplicity in Algorithms, 2025

Cyclic Equalizability of Words and Its Application to Card-Based Cryptography.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory - 25th International Symposium, 2025

Efficient Multiparty Private Simultaneous Messages for Symmetric Functions.

[BibT_eX]

[DOI]

Reo Eriguchi

Proceedings of the Advances in Cryptology - EUROCRYPT 2025, 2025

Formal Verification and Proof of Impossibility for Four-Card XOR Protocols Using Only Random Cuts.

[BibT_eX]

[DOI]

Proceedings of the 12th ACM ASIA Public-Key Cryptography Workshop, 2025

2024

Extended Addition Protocol and Efficient Voting Protocols Using Regular Polygon Cards.

[BibT_eX]

[DOI]

Yoshihiro Takahashi

New Gener. Comput., September, 2024

Physical Zero-Knowledge Proof for Sukoro.

[BibT_eX]

[DOI]

Shun Sasaki

New Gener. Comput., September, 2024

Card-Based Protocols for Private Set Intersection and Union.

[BibT_eX]

[DOI]

New Gener. Comput., September, 2024

Coin-Based Cryptographic Protocols without Hand Operations.

[BibT_eX]

[DOI]

Yuta Minamikawa

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2024

Efficient Card-Based Protocols with a Standard Deck of Playing Cards Using Partial Opening.

[BibT_eX]

[DOI]

Yoshiaki Honda

Proceedings of the Advances in Information and Computer Security, 2024

Card-Based Protocols with Single-Card Encoding.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Aspects of Computing - ICTAC 2024, 2024

How to Covertly and Uniformly Scramble the 15 Puzzle and Rubik's Cube.

[BibT_eX]

[DOI]

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

Card-Based Cryptography Meets Differential Privacy.

[BibT_eX]

[DOI]

Reo Eriguchi

Takao Murakami

Proceedings of the 12th International Conference on Fun with Algorithms, 2024

How to Play Old Maid with Virtual Players.

[BibT_eX]

[DOI]

Daiki Miyahara

Proceedings of the Frontiers of Algorithmics - 18th International Joint Conference, 2024

Efficient Card-Based Protocols for Symmetric Functions Using Four-Colored Decks.

[BibT_eX]

[DOI]

Proceedings of the 11th ACM Asia Public-Key Cryptography Workshop, 2024

Size-Hiding Computation in the Honest-But-Curious Model.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy - 29th Australasian Conference, 2024

2023

Private simultaneous messages based on quadratic residues.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., December, 2023

Constant-round linear-broadcast secure computation with penalties.

[BibT_eX]

[DOI]

Takeshi Nakai

Theor. Comput. Sci., May, 2023

Automorphism Shuffles for Graphs and Hypergraphs and Its Applications.

[BibT_eX]

[DOI]

Kengo Miyamoto

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., March, 2023

Uniform Cyclic Group Factorizations of Finite Groups.

[BibT_eX]

[DOI]

CoRR, 2023

Malicious Player Card-Based Cryptographic Protocols with a Standard Deck of Cards Using Private Operations.

[BibT_eX]

[DOI]

Tomoya Morooka

Yoshifumi Manabe

Proceedings of the Information Security Practice and Experience, 2023

Explicit Lower Bounds for Communication Complexity of PSM for Concrete Functions.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - INDOCRYPT 2023, 2023

Single-Shuffle Card-Based Protocols with Six Cards per Gate.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2023, 2023

Secure Multi-party Computation with Legally-Enforceable Fairness.

[BibT_eX]

[DOI]

Takeshi Nakai

Proceedings of the Information and Communications Security - 25th International Conference, 2023

Free-XOR in Card-Based Garbled Circuits.

[BibT_eX]

[DOI]

Yoshifumi Manabe

Proceedings of the Cryptology and Network Security - 22nd International Conference, 2023

2022

Graph Automorphism Shuffles from Pile-Scramble Shuffles.

[BibT_eX]

[DOI]

Kengo Miyamoto

New Gener. Comput., 2022

Single-shuffle Full-open Card-based Protocols Imply Private Simultaneous Messages Protocols.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Card-Based Secure Sorting Protocol.

[BibT_eX]

[DOI]

Proceedings of the Advances in Information and Computer Security, 2022

Card-based Cryptographic Protocols for Private Set Intersection.

[BibT_eX]

[DOI]

Proceedings of the International Symposium on Information Theory and Its Applications, 2022

2021

Card-based Cryptography with Dihedral Symmetry.

[BibT_eX]

[DOI]

New Gener. Comput., 2021

A single shuffle is enough for secure card-based computation of any Boolean circuit.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Secure Computation with Non-Equivalent Penalties in Constant Rounds.

[BibT_eX]

[DOI]

Takeshi Nakai

Proceedings of the 3rd International Conference on Blockchain Economics, 2021

Card-Based ZKP Protocols for Takuzu and Juosan.

[BibT_eX]

[DOI]

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020

Card-based protocols for secure ranking computations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Card-Based Covert Lottery.

[BibT_eX]

[DOI]

Proceedings of the Innovative Security Solutions for Information Technology and Communications, 2020

2019

A Single Shuffle Is Enough for Secure Card-Based Computation of Any Circuit.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Card-Based Cryptography with Invisible Ink.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2019

Light Cryptography.

[BibT_eX]

[DOI]

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

Secure Computation of Any Boolean Function Based on Any Deck of Cards.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics - 13th International Workshop, 2019

Card-Based Secure Ranking Computations.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2019

2018

Toward Finite-Runtime Card-Based Protocol for Generating a Hidden Random Permutation without Fixed Points.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

Physical Zero-Knowledge Proof for Makaro.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2018

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

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2018, 2018

Card-based Protocols Using Triangle Cards.

[BibT_eX]

[DOI]

Proceedings of the 9th International Conference on Fun with Algorithms, 2018

2017

Card-Based Protocols Using Regular Polygon Cards.

[BibT_eX]

[DOI]

IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2017

Secure Grouping Protocol Using a Deck of Cards.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 10th International Conference, 2017

On the Robustness of RSA-OAEP Encryption and RSA-PSS Signatures Against (Malicious) Randomness Failures.

[BibT_eX]

[DOI]

Jacob C. N. Schuldt