Recursive constructions for perfect secret sharing schemes

檔案

日期

1999-02-01

類型

期刊名稱

COMPUTERS & MATHEMATICS WITH APPLICATIONS

卷期與頁次

第 37 卷第 3 期,頁 87–96

ISSN

0898-1221

語言

英文

摘要

A secret sharing scheme is a method which allows a secret to be shared among a set of participants in such a way that only qualified subsets of participants can recover the secret. A secret sharing scheme is called perfect if unqualified subsets of participants obtain no information regarding the secret. The information rate of a secret sharing scheme is defined to be the ratio between the size of secret and the maximum size of the shares. In this paper, we propose some recursive constructions for perfect secret sharing schemes with access structures of constant rank. Compared with the best previous constructions, our constructions have some improved lower bounds on the information rate. (C) 1999 Elsevier Science Ltd. All rights reserved.

所屬典藏

期刊論文
顯示完整詮釋資料 統計資料

引用此條目

Sun, H., & Shieh, S. (1999). Recursive constructions for perfect secret sharing schemes. COMPUTERS & MATHEMATICS WITH APPLICATIONS, 37(3), 87–96. https://ir.lib.nycu.edu.tw/handle/11536/31558

BibTeX RIS

引用文字依 APA 第 7 版格式自動產生,使用前請再核對。

分享

永久網址:https://ir.lib.nycu.edu.tw/handle/11536/31558