پیوندهای مفید
اخبار و اعلانات
آمار
| تعداد نشریات | 43 |
| تعداد شمارهها | 1,686 |
| تعداد مقالات | 13,791 |
| تعداد مشاهده مقاله | 32,386,773 |
| تعداد دریافت فایل اصل مقاله | 12,792,571 |
Visual cryptography scheme on graphs with $m^{*}(G)=4$ | ||
| Transactions on Combinatorics | ||
| مقاله 5، دوره 8، شماره 2، شهریور 2019، صفحه 53-66 اصل مقاله (355.06 K) | ||
| نوع مقاله: Research Paper | ||
| شناسه دیجیتال (DOI): 10.22108/toc.2019.113671.1599 | ||
| نویسنده | ||
| Mahmood Davarzani* | ||
| Faculty of Mathematics and Computer Science, Kharazmi University, Tehran, Iran. | ||
| چکیده | ||
| Let $G=(V,E)$ be a connected graph and $\Gamma (G)$ be the strong access structure where obtained from graph $G$. A visual cryptography scheme (VCS) for a set $P$ of participants is a method to encode a secret image such that any pixel of this image change to $m$ subpixels and only qualified sets can recover the secret image by stacking their shares. The value of $m$ is called the pixel expansion and the minimum value of the pixel expansion of a VCS for $\Gamma (G)$ is denoted by $m^{*}(G)$. In this paper we obtain a characterization of all connected graphs $G$ with $m^{*}(G)=4$ and $\omega (G)=5$ which $\omega(G)$ is the clique number of graph $G$. | ||
| کلیدواژهها | ||
| Secret sharing schemes؛ Visual cryptography scheme؛ Graph access structure؛ Pixel expansion | ||
|
آمار تعداد مشاهده مقاله: 361 تعداد دریافت فایل اصل مقاله: 319 |
||