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

Multi-party Computation with Small Shuffle Complexity Using Regular Polygon Cards

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

Published Jan 1, 2015• 31 citations
Publisher
DOI
10.1007/978-3-319-26059-4_7

Related papers

Card-based protocols using unequal division shuffles

Akihiro Nishimura, Takuya Nishida, Yu‐ichi Hayashi +2 more

Soft Computing•Oct 4, 2017•29 citations

Five-Card Secure Computations Using Unequal Division Shuffle

Akihiro Nishimura, Takuya Nishida, Yu‐ichi Hayashi +2 more

Lecture notes in computer science•Jan 1, 2015•23 citations

Secure Multi-Party Computation Using Polarizing Cards

Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt +5 more

Lecture notes in computer science•Jan 1, 2015•15 citations

Single-Shuffle Full-Open Card-Based Secure Computation Protocols for Any Function

Reo Eriguchi, Kazumasa Shinagawa

Lecture notes in computer science•Jul 14, 2026•0 citations

Impossibility of Four-Card AND Protocols with a Single Closed Shuffle

Shizuru Iino, Shota Ikeda, Kazumasa Shinagawa +3 more

Lecture notes in computer science•Nov 12, 2025•1 citation

Card-Based Protocols Using Regular Polygon Cards

Kazumasa Shinagawa, Takaaki Mizuki, Jacob C. N. Schuldt +5 more

Cryptographic protocols enable participating parties to compute any function of their inputs without leaking any information beyond the output. A card-based protocol is a cryptographic protocol implemented by physical cards. In this paper, for constructing protocols with small numbers of shuffles, we introduce a new type of cards, regular polygon cards, and a new protocol, oblivious conversion. Using our cards, we construct an addition protocol on non-binary inputs with only one shuffle and two cards. Furthermore, using our oblivious conversion protocol, we construct the first protocol for general functions in which the number of shuffles is linear in the number of inputs.

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Jan 1, 2017•61 citations
Cryptographic protocols enable participating parties to compute any function of their inputs without leaking any information beyond the output. A card-based protocol is a cryptographic protocol implemented by physical cards. In this paper, for constructing protocols with small numbers of shuffles, we introduce a new type of cards, regular polygon cards, and a new protocol, oblivious conversion. Using our cards, we construct an addition protocol on non-binary inputs with only one shuffle and two cards. Furthermore, using our oblivious conversion protocol, we construct the first protocol for general functions in which the number of shuffles is linear in the number of inputs.