Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Card-Based Zero-Knowledge Proof Protocols for Graph Problems and Their Computational Model

Daiki Miyahara, Hiromichi Haneda, Takaaki Mizuki

Published Jan 1, 2021• 16 citations
Publisher
DOI
10.1007/978-3-030-90402-9_8

Related papers

Card-Based Zero-Knowledge Proofs for Necklace Splitting Problem

S. Ikeda, Kazumasa Shinagawa

Lecture notes in computer science•Oct 18, 2026•0 citations

Zero-Knowledge Proof Protocol for Cryptarithmetic Using Dihedral Cards

Raimu Isuzugawa, Daiki Miyahara, Takaaki Mizuki

Lecture notes in computer science•Jan 1, 2021•21 citations

Card-Based Zero-Knowledge Proof Protocol for Polyomino Tiling Puzzle

Koichi Koizumi, So Shibamiya, Eikoh Chida +2 more

Lecture notes in computer science•Oct 19, 2026•0 citations

A Physical Zero-knowledge Proof for Cryptarithmetic Using Dihedral Cards

Raimu Isuzugawa, Daiki Miyahara, Takaaki Mizuki +1 more

IEICE Technical Report; IEICE Tech. Rep.•Feb 25, 2021•0 citations

Computational Model of Card-Based Cryptographic Protocols and Its Applications

Takaaki Mizuki, Hiroki Shizuya

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Dec 31, 2016•61 citations

Single-Shuffle Physical Zero-Knowledge Proof for Sudoku Using Interactive Inputs

Tomoki Ono, Suthee Ruangwises, Yoshiki Abe +2 more

A zero-knowledge proof (ZKP) is an interactive proof between a prover and a verifier, with the prover's goal to convince the verifier that a solution of a computation problem exists without revealing any information about the solution itself. A card-based physical ZKP is an implementation of a ZKP using physical cards. Several metrics are used to measure the efficiency of card-based ZKPs, such as the numbers of required cards and shuffles. In this paper, we propose the first card-based ZKP for a puzzle Sudoku that uses only one shuffle. To achieve this, we use a technique of applying private operations interactively to prepare inputs for the protocol.

ACM ASIA Public-Key Cryptography Workshop (APKC)•Jun 6, 2025•2 citations
A zero-knowledge proof (ZKP) is an interactive proof between a prover and a verifier, with the prover's goal to convince the verifier that a solution of a computation problem exists without revealing any information about the solution itself. A card-based physical ZKP is an implementation of a ZKP using physical cards. Several metrics are used to measure the efficiency of card-based ZKPs, such as the numbers of required cards and shuffles. In this paper, we propose the first card-based ZKP for a puzzle Sudoku that uses only one shuffle. To achieve this, we use a technique of applying private operations interactively to prepare inputs for the protocol.