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
본 논문에서는 합리적인 제안을 제안한다. m-밖에서-n 비밀 공유 계획, 딜러가 그룹에 비밀을 위탁하려고 합니다. n 플레이어는 m 이상의 플레이어가 비밀을 재구성할 수 있지만 그보다 적은 수의 플레이어가 비밀을 재구성할 수 있습니다. m 플레이어는 비밀에 대해 아무것도 배울 수 없습니다. 우리 계획의 재구성 프로토콜은 다음과 같습니다. 공정한 and 안정된 합리적인 환경에서 모든 플레이어가 지정된 비밀을 얻을 수 있도록 합니다. 우리의 방식은 분산 암호 해독 기능을 갖춘 RSA-OAEP를 기반으로 합니다. 우리 계획의 보안은 계산적 가정에 의존하며 무작위 오라클을 사용합니다. 우리 계획의 각 공유 크기는 효용 함수와 무관하며 재구성 프로토콜의 계산 비용은 일정합니다. 게다가 우리의 계획은 최대한의 공격을 방지합니다. m-1 연합.
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.
부
Toshiyuki ISSHIKI, Koichiro WADA, Keisuke TANAKA, "A Rational Secret-Sharing Scheme Based on RSA-OAEP" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 1, pp. 42-49, January 2010, doi: 10.1587/transfun.E93.A.42.
Abstract: In this paper, we propose a rational m-out-of-n secret sharing scheme, a dealer wishes to entrust a secret with a group of n players such that any subset of m or more players can reconstruct the secret, but a subset of less than m players cannot learn anything about the secret. The reconstruction protocol of our scheme is fair and stable in the rational settings, allowing all players to obtain the designated secret. Our scheme is based on RSA-OAEP with the distributed decryption. The security of our scheme relies on a computational assumption and uses the random oracles. The size of each share in our scheme is independent of the utility function and the computation cost of the reconstruction protocol is constant. Moreover, our scheme prevents the attacks with at most m-1 coalitions.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.42/_p
부
@ARTICLE{e93-a_1_42,
author={Toshiyuki ISSHIKI, Koichiro WADA, Keisuke TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Rational Secret-Sharing Scheme Based on RSA-OAEP},
year={2010},
volume={E93-A},
number={1},
pages={42-49},
abstract={In this paper, we propose a rational m-out-of-n secret sharing scheme, a dealer wishes to entrust a secret with a group of n players such that any subset of m or more players can reconstruct the secret, but a subset of less than m players cannot learn anything about the secret. The reconstruction protocol of our scheme is fair and stable in the rational settings, allowing all players to obtain the designated secret. Our scheme is based on RSA-OAEP with the distributed decryption. The security of our scheme relies on a computational assumption and uses the random oracles. The size of each share in our scheme is independent of the utility function and the computation cost of the reconstruction protocol is constant. Moreover, our scheme prevents the attacks with at most m-1 coalitions.},
keywords={},
doi={10.1587/transfun.E93.A.42},
ISSN={1745-1337},
month={January},}
부
TY - JOUR
TI - A Rational Secret-Sharing Scheme Based on RSA-OAEP
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 42
EP - 49
AU - Toshiyuki ISSHIKI
AU - Koichiro WADA
AU - Keisuke TANAKA
PY - 2010
DO - 10.1587/transfun.E93.A.42
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E93-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2010
AB - In this paper, we propose a rational m-out-of-n secret sharing scheme, a dealer wishes to entrust a secret with a group of n players such that any subset of m or more players can reconstruct the secret, but a subset of less than m players cannot learn anything about the secret. The reconstruction protocol of our scheme is fair and stable in the rational settings, allowing all players to obtain the designated secret. Our scheme is based on RSA-OAEP with the distributed decryption. The security of our scheme relies on a computational assumption and uses the random oracles. The size of each share in our scheme is independent of the utility function and the computation cost of the reconstruction protocol is constant. Moreover, our scheme prevents the attacks with at most m-1 coalitions.
ER -