| dc.contributor | 資科系 | zh_TW |
| dc.creator (作者) | 左瑞麟 | zh_TW |
| dc.creator (作者) | Tso, Raylin | en_US |
| dc.creator (作者) | Miao, Ying | en_US |
| dc.date (日期) | 2017-08 | |
| dc.date.accessioned | 18-Sep-2017 15:39:51 (UTC+8) | - |
| dc.date.available | 18-Sep-2017 15:39:51 (UTC+8) | - |
| dc.date.issued (上傳時間) | 18-Sep-2017 15:39:51 (UTC+8) | - |
| dc.identifier.uri (URI) | http://nccur.lib.nccu.edu.tw/handle/140.119/113062 | - |
| dc.description.abstract (摘要) | Secret sharing schemes are wildly used in many applications where the secret must be recovered by joint work of certain amount of participants. There are many techniques to construct a secret sharing scheme, one of them is the construction using critical sets of Latin squares. In this paper, we will investigate the features of back circulant Latin squares, their corresponding critical sets and show how a secret sharing scheme can be constructed using such kind of critical sets. Finally, we will point out the constraints and future research on such kind of secret sharing schemes. | en_US |
| dc.format.extent | 181 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Smart Innovation, Systems and Technologies, Volume 82, 2018, Pages 267-272 | en_US |
| dc.relation (關聯) | Advances in Intelligent Information Hiding and Multimedia Signal Processing: Proceedings of the Thirteenth International Conference on Intelligent Information Hiding and Multimedia Signal Processing, August, 12-15, 2017, Matsue, Shimane, Japan, Part II | en_US |
| dc.subject (關鍵詞) | Back circulant latin square ; Critical sets ; Multilevel scheme ; Multi-department scheme ; Secret sharing schemes | en_US |
| dc.title (題名) | A survey of secret sharing schemes based on Latin squares | en_US |
| dc.type (資料類型) | conference | |
| dc.identifier.doi (DOI) | 10.1007/978-3-319-63859-1_33 | |
| dc.doi.uri (DOI) | https://doi.org/10.1007/978-3-319-63859-1_33 | |
