... Perfect Secret Sharing Schemes 89 In this paper, we propose some recursive constructions for perfect secret sharing schemes with access structures of constant rank.. Sti[r] ...

10

... XENIX **for** IBM, Federal Sector Division, Gaithersburg, Maryland, ...consultant **for** the Com- puter and Communications Laboratory, Industrial Technology Re- search Institute, Taiwan, in the area of network ...

11

... Brick- ell and Stinson studied a perfect secret sharing scheme for a graph-based structure where the monotone-increasing access structure F contains the pairs of p[r] ...

7

... Brickell and Stinson [5] studied a perfect secret sharing scheme for graph-based access structure F where the monotone-increasing access structure F contains the pairs of partic[r] ...

10

... A **perfect** **secret**-**sharing** scheme is a method of distributing a **secret** among a set of participants such that only qualified subsets of participants can recover the **secret** and the joint ...

10

... the **schemes** **for** weighted threshold access structure that can be represented by graphs called k-weighted ...the **secret**-**sharing** **schemes** **for** these ...sophisticated ...

12

... visual **secret** **sharing** (VSS) scheme was first proposed by Noar and Shamir in ...a **secret** image into several meaningless images, called shadows, such that certain qualified subsets of shadows can ...

8

... Hashing **schemes** are widely used to improve the performance of data mining association rules, as in the DHP algorithm that utilizes the hash table in identifying the validity of candidate itemsets according to the ...

1

... Hashing **schemes** are a common technique to improve the performance in mining not only association rules but also sequential patterns or traversal ...hash **schemes** may result in severe performance ...propose ...

2

... Scheme **for** Threshold Multi-**Secret** **Sharing** 作者: Chan, ...theorem;Distinctness;Entropy;Idealness;Multi-**secret** **sharing** scheme;Perfectness;The Shamir (t, n)-threshold **secret** ...

1

... a **secret** HTML document are the components that can be displayed or be accessed on browsers, it is proposed in this study to share these components among participants of the **secret** HTML document by the ...

7

... DEFINITION 2. A (k, n) NEVSS scheme can be shown as two collections C 0 and C 1 consisting of n λ and n γ n × 1 matrices, respectively. When **sharing** a white (resp. black) pixel, the dealer first randomly chooses ...

12

... A share spanning tree that connects the root node (the user that recreates the secret under consideration) to some other nodes such that its vertices hold all [r] ...

19

... scheme was first proposed by Naor and Shamir in 1994; many secret sharing schemes were published afterward; one of them, the color images of hierarchical multiple visual secret shari[r] ...

15

... approaches is that the revealed content of the **secret** image must be lossless. Moreover, the distorted stego images can be reverted to the original cover image. In order to achieve these purposes, we first ...

2

... 題名: **Secret** image **sharing** with reversible steganography 作者: Chang, Chin-Chen;Lin, Pei-Yu;Chan, Chi-Shiang 貢獻者: Department of Information Science and Applications 關鍵詞: Artificial intelligence;Computer ...

1

... a **secret** image among n shad- ows: any t of the n shadows can recover the **secret**, whereas t − 1 or fewer shadows ...the **secret** in managers’ ...the **secret**, unless some managers were given ...

7

... the **secret** is shared by a set of participants partitioned into several levels, and the **secret** data can be reconstructed by satisfying a sequence of threshold require- ments ...apply **for** a ...

9

... of **secret** **sharing** is as ...classical **secret** **sharing** cannot prevent an eavesdropper with unlimited power from accessing **secret** ...that **secret** communication using quantum bits can ...

9

... reconstructed grayscale image quality than Wang et al.'s scheme without significantly increasing computational complexity, we apply the voting strategy and the least significant bits a[r] ...

1