Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
スポンサーリンク
概要
- 論文の詳細を見る
A visual secret sharing scheme (VSSS) is one of secret sharing schemes for images. Droste showed the method for constructing VSSS based on basis matrices whose contrast was high. Koga, Iwamoto, and Yamamoto also proposed the method for constructing a lattice-based VSSS and its polynomial representation. It is known that many good VSSSs are not in the class of lattice-based VSSSs. In this paper, we show the well-defined polynomial representation of a VSSS based on permuting different matrices for black-white images. The necessary and sufficient condition of the existence of a VSSS based on permuting different matrices can he obtained from the proposed polynomial representation. This condition is useful for constructing a good VSSS. We also point out that without additional data, it is possible to achieve member verification by using a VSSS. Using the proposed polynomial representation, the probability of detecting a cheater is analyzed.
- 社団法人電子情報通信学会の論文
- 2002-06-01
著者
-
TANAKA Hatsukazu
Faculty of Engineering, Kobe University
-
Kuwakado Hidenori
Faculty Of Engineering Kobe University
-
Tanaka Hatsukazu
Faculty Of Engineering Kobe University
関連論文
- Image Size Invariant Visual Cryptography (Special Section on Information Theory and Its Applications)
- Security of Modified Counter Modes(HISC2006)
- Size-Reduced Visual Secret Sharing Scheme(Discrete Mathematics and Its Applications)
- Transitive Signature Scheme for Directed Trees
- Polynomial Representation of a Visual Secret Sharing Scheme and Its Application
- A Code Construction for M-Choose-T Communication over the Multiple-Access Adder Channel
- Video Watermarking of Which Embedded Information Depends on the Distance between Two Signal Positions
- A New Approach to Constructing a Provably Secure Variant of Schnorr's Identification Scheme
- A Search Algorithm for Bases of Calderbank-Shor-Steane Type Quantum Error-Correcting Codes(Coding Theory)(Regular Section)
- A New Method of Measuring the Blocking Effects of Images Based on Cepstral Information
- Collision Resistance of Hash Functions in a Weak Ideal Cipher Model
- Identity-Based Non-interactive Key Sharing (Special Section on Cryptography and Information Security)
- Visual Commitment Using the Trusted Initializer
- Multilane Hashing Mode Suitable for Parallel Processing
- On the Security of the ElGamal-Type Signature Scheme with Small Parameters (Special Section on Cryptography and Information Security)
- On the Security of the Improved Knapsack Cryptosystem (Special Section on Information Theory and Its Applications)