The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images(Special Section on Information Theory and Its Applications)

スポンサーリンク

概要

• 論文の詳細を見る

• In this paper, a method is proposed to construct an n-out-of-n visual secret sharing scheme for gray-scale images, for short an (n,n)-VSS-GS scheme, which is optimal in the sense of contrast and pixel expansion, i.e., resolution. It is shown that any (n,n)-VSS-GS scheme can be constructed based on the so-called polynomial representation of basis matrices treated in [15],[16]. Furthermore, it is proved that such construction can attain the optimal (n,n)-VSS-GS scheme.

• 社団法人電子情報通信学会の論文
• 2002-10-01

著者

• Yamamoto Hirosuke

  Department Of Complexity Science And Engineering Graduate School Of Frontier Science The University

• Yamamoto Hirosuke

  Department Of Mathemetical Informatics Graduate School Of Information Science And Technology The Uni

• IWAMOTO Mitsugu

  Department of Mathemetical Informatics, Graduate School of Information Science and Technology, The U

• Iwamoto Mitsugu

  Department Of Mathemetical Informatics Graduate School Of Information Science And Technology The Uni

関連論文

• Strongly Secure Linear Network Coding
• A Randomness Test Based on T-Complexity
• A New Randomness Test Based on Linear Complexity Profile
• The Optimal n-out-of-n Visual Secret Sharing Scheme for Gray-Scale Images(Special Section on Information Theory and Its Applications)

スポンサーリンク