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
Dalam kertas ini, kami mencadangkan rasional m-daripada-n skim perkongsian rahsia, seorang peniaga ingin mempercayakan rahsia dengan sekumpulan n pemain supaya mana-mana subset daripada m atau lebih banyak pemain boleh membina semula rahsia, tetapi subset kurang daripada m pemain tidak boleh belajar apa-apa tentang rahsia itu. Protokol pembinaan semula skim kami ialah adil and stabil dalam tetapan rasional, membenarkan semua pemain mendapatkan rahsia yang ditetapkan. Skim kami adalah berdasarkan RSA-OAEP dengan penyahsulitan yang diedarkan. Keselamatan skim kami bergantung pada andaian pengiraan dan menggunakan ramalan rawak. Saiz setiap bahagian dalam skim kami adalah bebas daripada fungsi utiliti dan kos pengiraan protokol pembinaan semula adalah malar. Selain itu, skim kami menghalang serangan paling banyak m-1 gabungan.
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.
Salinan
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
Salinan
@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},}
Salinan
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 -