Lecture notes in computer science

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

Takaaki Mizuki, Takao Nishizeki

Published Jan 1, 2001• 2 citations

Related papers

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

Takaaki Mizuki, Hiroki Shizuya, Takao Nishizeki

Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures

Reina Yoshikawa, Shimin Guo, Kazuhiro Motegi +1 more

Necessary and Sufficient Numbers of Cards for the Transformation Protocol

Koichi Koizumi, Takaaki Mizuki, Takao Nishizeki

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

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

Secret Bit Transmission Using a Random Deal of Cards on Hierarchical Structures (Models of Computation and Algorithms)

Reina Yoshikawa, Yoshihide Igarashi

Secret Bit Transmission Using a Random Deal of Cards on Hierarchical Structures (Models of Computation and Algorithms)

玲奈吉川, 善英五十嵐