کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
6938175 | 1449921 | 2018 | 39 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Enhancing multi-factor cheating prevention in visual cryptography based minimum (k, n)-connected graph
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
چشم انداز کامپیوتر و تشخیص الگو
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Recently, Lin et al. [29] introduced a (k, n) multi-factor cheating prevention visual cryptographic scheme (MCPVCS) by hiding verification images into shadow images. Through authenticating the verification image and the reconstructed image simultaneously, Lin et al.'s MCPVCS can prevent cheating attack that dishonest participants may collude and cheat the honest one to get a wrong secret image. However, the large n reduces the size of verification image and makes the verification difficult. In this paper, a (k, n)-MCPVCS with the large size of verification image is proposed. There are three main contributions for the proposed (k, n)-MCPVCS: (i) the verification condition in (k, n)-MCPVCS is redefined, (ii) a new minimum (k, n)-connected graph problem is introduced, on which the minimum number of verification images is determined, and (iii) the proposed (k, n)-MCPVCS with the large size of verification image can more easily authenticate the unambiguity of verification image.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Visual Communication and Image Representation - Volume 55, August 2018, Pages 660-676
Journal: Journal of Visual Communication and Image Representation - Volume 55, August 2018, Pages 660-676
نویسندگان
Ching-Nung Yang, Fu-Heng Wu, Sheng-Lung Peng,