Top PDF Recursive constructions for perfect secret sharing schemes

Recursive constructions for perfect secret sharing schemes

Recursive constructions for perfect secret sharing schemes

... 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

Constructing perfect secret sharing schemes for general and uniform access structures

Constructing perfect secret sharing schemes for general and uniform access structures

... 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

An efficient construction of perfect secret sharing schemes for graph-based structures

An efficient construction of perfect secret sharing schemes for graph-based structures

... 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

Secret sharing schemes for graph-based prohibited structures

Secret sharing schemes for graph-based prohibited structures

... 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

The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures

The exact values of the optimal average information ratio of perfect secret-sharing schemes for tree-based access structures

... 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

New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

New bounds on the average information rate of secret-sharing schemes for graph-based weighted threshold access structures

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

12

On the (2,2) Visual Multi-Secret Sharing Schemes

On the (2,2) Visual Multi-Secret Sharing Schemes

... 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

Perfect Hashing Schemes for Mining Association Rules

Perfect Hashing Schemes for Mining Association Rules

... 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

Perfect Hashing Schemes for Mining Traversal Patterns

Perfect Hashing Schemes for Mining Traversal Patterns

... 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

A Scheme for Threshold Multi-Secret Sharing

A Scheme for Threshold Multi-Secret Sharing

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

1

Secret Sharing with Steganographic Effects for HTML Documents

Secret Sharing with Steganographic Effects for HTML Documents

... 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

New Visual Secret Sharing Schemes With Non-Expansible Shadow Size Using Non-binary Sub Pixel

New Visual Secret Sharing Schemes With Non-Expansible Shadow Size Using Non-binary Sub Pixel

... 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 probability model for reconstructing secret sharing under the internet environment

A probability model for reconstructing secret sharing under the internet environment

... 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

A Study of Bit-level Processing Based on Color  Imagines of Hierarchical Multiple Visual Secret Sharing Schemes and Applications

A Study of Bit-level Processing Based on Color Imagines of Hierarchical Multiple Visual Secret Sharing Schemes and Applications

... 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

Secret Image Sharing with Reversible Steganography

Secret Image Sharing with Reversible Steganography

... 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

Secret image sharing with reversible steganography

... 題名: 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

Fast-weighted secret image sharing

Fast-weighted secret image sharing

... 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

A hierarchical threshold secret image sharing

A hierarchical threshold secret image sharing

... 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

Quantum secret sharing using product states

Quantum secret sharing using product states

... 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

A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy

A Probabilistic Visual Secret Sharing Scheme for Grayscale Images with Voting Strategy

... 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

Show all 10000 documents...