標題: Recursive constructions for perfect secret sharing schemes
作者: Sun, HM
Shieh, SP
資訊工程學系
Department of Computer Science
關鍵字: cryptography;secret sharing scheme;information theory;access structures
公開日期: 1-二月-1999
摘要: 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.
URI: http://hdl.handle.net/11536/31558
ISSN: 0898-1221
期刊: COMPUTERS & MATHEMATICS WITH APPLICATIONS
Volume: 37
Issue: 3
起始頁: 87
結束頁: 96
顯示於類別:期刊論文


文件中的檔案:

  1. 000078640600010.pdf