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

Minimum Number ofup-down Cards forFinite-Time Committed-AND Protocol Without Interlocking Operations

Iwasaki, Atsushi

•Nov 25, 2025•0 citations

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•57 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•12 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•102 citations

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

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

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