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

Necessary and Sufficient Numbers of Cards for the Transformation Protocol

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

Published Jan 1, 2004• 8 citations
Publisher
DOI
10.1007/978-3-540-27798-9_12

Related papers

Necessary and Sufficient Numbers of Cards for Sharing Secret Keys on Hierarchical Groups

Takaaki Mizuki, Takao Nishizeki

Lecture notes in computer science•Jan 1, 2001•2 citations

Necessary and Sufficient Numbers of Cards for Securely Computing Two-Bit Output Functions

Danny Francis, Syarifah Ruqayyah Aljunid, Takuya Nishida +3 more

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

Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key (Extended Abstract)

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Lecture notes in computer science•Jan 1, 1999•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 Cards Using Private Operations

Hibiki Ono, Yoshifumi Manabe

Lecture notes in computer science•Jan 1, 2019•10 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