Secure grouping protocol using a deck of cards

Yuji Hashimoto, Kazumasa Shinagawa, Koji Nuida, Masaki Inamura, Goichiro Hanaoka

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We consider a problem, which we call secure grouping, of dividing a number of parties into some subsets (groups) in the following manner: Each party has to know the other members of his/her group, while he/she may not know anything about how the remaining parties are divided (except for certain public predetermined constraints, such as the number of parties in each group). In this paper, we construct an informationtheoretically secure protocol using a deck of physical cards to solve the problem, which is jointly executable by the parties themselves without a trusted third party. Despite the non-triviality and the potential usefulness of the secure grouping, our proposed protocol is fairly simple to describe and execute. Our protocol is based on algebraic properties of conjugate permutations. A key ingredient of our protocol is our new techniques to apply multiplication and inverse operations to hidden permutations (i.e., those encoded by using face-down cards), which would be of independent interest and would have various potential applications.

Original languageEnglish
Pages (from-to)1512-1524
Number of pages13
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE101A
Issue number9
DOIs
Publication statusPublished - Sep 2018
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Secure grouping protocol using a deck of cards'. Together they form a unique fingerprint.

Cite this