The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
우리는 우리가 부르는 문제를 고려합니다. 보안 그룹화, 다음과 같은 방식으로 여러 당사자를 일부 하위 집합(그룹)으로 나누는 것입니다. 각 당사자는 자신의 그룹의 다른 구성원을 알아야 하지만 나머지 당사자가 어떻게 분할되는지에 대해서는 아무것도 알 수 없습니다(예외 각 그룹의 당사자 수와 같은 특정 공개 미리 결정된 제약). 본 논문에서는 문제를 해결하기 위해 물리적 카드 덱을 사용하여 정보 이론적으로 안전한 프로토콜을 구축합니다. 이는 신뢰할 수 있는 제3자 없이 당사자들이 공동으로 실행할 수 있습니다. 보안 그룹화의 사소함과 잠재적인 유용성에도 불구하고 우리가 제안한 프로토콜은 설명하고 실행하기가 매우 간단합니다. 우리의 프로토콜은 공액 순열의 대수적 특성을 기반으로 합니다. 우리 프로토콜의 핵심 요소는 숨겨진 순열(즉, 페이스다운 카드를 사용하여 인코딩된 순열)에 곱셈과 역연산을 적용하는 새로운 기술입니다. 이는 독립적인 관심을 끌며 다양한 잠재적 응용이 가능합니다.
Yuji HASHIMOTO
Tokyo Denki University,the National Institute of Advanced Industrial Science and Technology
Kazumasa SHINAGAWA
the National Institute of Advanced Industrial Science and Technology,Tokyo Institute of Technology
Koji NUIDA
the National Institute of Advanced Industrial Science and Technology
Masaki INAMURA
Tokyo Denki University
Goichiro HANAOKA
the National Institute of Advanced Industrial Science and Technology
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Yuji HASHIMOTO, Kazumasa SHINAGAWA, Koji NUIDA, Masaki INAMURA, Goichiro HANAOKA, "Secure Grouping Protocol Using a Deck of Cards" in IEICE TRANSACTIONS on Fundamentals,
vol. E101-A, no. 9, pp. 1512-1524, September 2018, doi: 10.1587/transfun.E101.A.1512.
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 information-theoretically 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E101.A.1512/_p
부
@ARTICLE{e101-a_9_1512,
author={Yuji HASHIMOTO, Kazumasa SHINAGAWA, Koji NUIDA, Masaki INAMURA, Goichiro HANAOKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Secure Grouping Protocol Using a Deck of Cards},
year={2018},
volume={E101-A},
number={9},
pages={1512-1524},
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 information-theoretically 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.},
keywords={},
doi={10.1587/transfun.E101.A.1512},
ISSN={1745-1337},
month={September},}
부
TY - JOUR
TI - Secure Grouping Protocol Using a Deck of Cards
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1512
EP - 1524
AU - Yuji HASHIMOTO
AU - Kazumasa SHINAGAWA
AU - Koji NUIDA
AU - Masaki INAMURA
AU - Goichiro HANAOKA
PY - 2018
DO - 10.1587/transfun.E101.A.1512
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E101-A
IS - 9
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - September 2018
AB - 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 information-theoretically 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.
ER -