| 作成者 |
|
| 本文言語 |
|
| 出版者 |
|
|
|
| 発行日 |
|
| 収録物名 |
|
| 巻 |
|
| 開始ページ |
|
| 終了ページ |
|
| 出版タイプ |
|
| アクセス権 |
|
| 関連DOI |
|
|
|
| 関連URI |
|
|
|
| 関連情報 |
|
|
|
| 概要 |
Most of the secret sharing schemes are based on algebraic calculations in their realizations. But there are some different realizations from ordinal secret sharing schemes. Visual cryptography is one ...such secret sharing scheme. In visual cryptography, the problem is to encrypt some written material (handwritten notes, printed text, pictures, etc.) in a perfectly secure way in such a manner that the decoding may be done visually, without any cryptographic computations. The concept of visual cryptography was first proposed by Naor and Shamir in 1994. Visual cryptographic scheme for a set P of n participants is a cryptographic paradigm that enables a secret image to be split into n shadow images called shares, where each participant in P receives one share. Certain qualified subsets of participants can "visually" recover the secret image with some loss of contrast, but other forbidden sets of participants have no information about the secret image. In this talk, we shall explore how linear algebra and statistical design theory play an important role in constructing visual cryptographic schemes. We further emphasize on some of the open problems related to visual cryptographic schemes for both (k, n)-threshold and general access structures.続きを見る
|
Mendeley出力
