Name
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 in 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. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1587/transfun.E93.A.42 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
secret sharing, game theory, fairness, RSA, OAEP | Discrete mathematics,Secure multi-party computation,Secret sharing,Optimal asymmetric encryption padding,Computer security,Theoretical computer science,Verifiable secret sharing,Shamir's Secret Sharing,Game theory,Homomorphic secret sharing,Mathematics,Computation | Journal |
Volume | Issue | ISSN |
E93A | 1 | 0916-8508 |
Citations | PageRank | References |
5 | 0.42 | 8 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Toshiyuki Isshiki | 1 | 69 | 5.02 |
| Koichiro Wada | 2 | 6 | 1.12 |
| Keisuke Tanaka | 3 | 278 | 19.04 |