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

Minimum Number of up-down Cards for Finite-Time Committed-AND Protocol Without Interlocking Operations

Atsushi Iwasaki

Published Nov 24, 2025• 1 citation
Publisher
DOI
10.1007/978-981-95-4674-9_11

Related papers

Card-Based Cryptographic Protocols with the Minimum Number of Cards Using Private Operations

Hibiki Ono, Yoshifumi Manabe

Lecture notes in computer science•Jan 1, 2019•10 citations

The Minimum Number of Cards in Practical Card-Based Protocols

Julia Kästner, Alexander Koch, Stefan Walzer +4 more

Lecture notes in computer science•Jan 1, 2017•59 citations

Card-Based Cryptographic Protocols with the Minimum Number of Rounds Using Private Operations

Hibiki Ono, Yoshifumi Manabe

Lecture notes in computer science•Jan 1, 2019•13 citations

Card-Based Cryptographic Protocols Using a Minimal Number of Cards

Alexander Koch, Stefan Walzer, Kevin Härtel

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

The Minimum Number of Cards in Practical Card-Based Protocols (from ASIACRYPT 2017)

Daiki Miyahara, 優一 林, 敬明 水木 +1 more

IEICE Technical Report; IEICE Tech. Rep.•May 9, 2018•0 citations

How to Detect Malicious Behaviors in a Card-Based Majority Voting Protocol with Three Inputs

Yoshiki Abe, Mitsugu Iwamoto, Kazuo Ohta

Card-based protocol is a multi-party computation using cards. The card-based protocol using operations called private operation has an advantage that the number of cards and the number of times of communication are smaller than the card-based protocol using operations called shuffle. However, there is a disadvantage that private operation allows dishonest players to perform malicious behaviors. Although the method to detect malicious behaviors in private operations was proposed, the method was available only in committed-format protocols, where inputs and outputs are represented by a pair of cards called commitment. In this paper, we show how to detect malicious behaviors in non-committed-format protocol with an example of a three-input majority voting protocol using private operations. Our majority voting protocol requires a smaller number of cards than the minimum number of cards required for committed-format protocols.

International Symposium on Information Theory and its Applications•Oct 18, 2020•2 citations
Card-based protocol is a multi-party computation using cards. The card-based protocol using operations called private operation has an advantage that the number of cards and the number of times of communication are smaller than the card-based protocol using operations called shuffle. However, there is a disadvantage that private operation allows dishonest players to perform malicious behaviors. Although the method to detect malicious behaviors in private operations was proposed, the method was available only in committed-format protocols, where inputs and outputs are represented by a pair of cards called commitment. In this paper, we show how to detect malicious behaviors in non-committed-format protocol with an example of a three-input majority voting protocol using private operations. Our majority voting protocol requires a smaller number of cards than the minimum number of cards required for committed-format protocols.