JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
http://hdl.handle.net/10119/10296
|
Title: | Ideal Secret Sharing Schemes with Share Selectability |
Authors: | Emura, Keita Miyaji, Atsuko Nomura, Akito Rahman, Mohammad Shahriar Soshi, Masakazu |
Keywords: | Secret Sharing Share Selectability |
Issue Date: | 2011-11-01 |
Publisher: | Springer |
Magazine name: | Lecture Notes in Computer Science |
Volume: | 7043/2011 |
Start page: | 143 |
End page: | 157 |
DOI: | 10.1007/978-3-642-25243-3_12 |
Abstract: | In this paper, we investigate a new concept, called share selectable secret sharing, where no unauthorized set can obtain information of the secret (in the information-theoretic sense) even if shares are selectable as arbitrary values which are independent of the secret. We propose two totally selectable (i.e., all users’ shares are selectable) secret sharing schemes with unanimous structure. We also propose a quasiselectable (i.e., a part of each user’s share is selectable) secret sharing scheme with certain hierarchical structures which contains special cases of the hierarchical threshold structures introduced by Tamir Tassa in TCC2004 (or its full version (J. Cryptology2007)). If all selectable shares are randomly chosen, then our schemes are perfect. Finally, we discuss the effect of the leakage information of the secret if a weak secret is indicated as a selectable share. |
Rights: | This is the author-created version of Springer, Keita Emura, Atsuko Miyaji, Akito Nomura, Mohammad Shahriar Rahman, and Masakazu Soshi, Lecture Notes in Computer Science, 7043/2011, 2011, 143-157. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-642-25243-3_12 |
URI: | http://hdl.handle.net/10119/10296 |
Material Type: | author |
Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
File |
Description |
Size | Format |
17148.pdf | | 147Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|