Cheating prevention visual cryptography scheme using Latin square. (1st July 2017)

• Record Type: Journal Article
• Authors: Ren, Yawei; Liu, Feng; Guo, Teng; Feng, Rongquan; Lin, Dongdai
• Is Part Of: IET information security. Volume 11:Number 4(2017)
• Page Start: 211
• Page End: 219
• Publication Date: 2017-07-01
• Subjects: image processing -- cryptography; Latin square -- cheating prevention visual cryptography schemes -- authentication regions -- (k‐n)‐deterministic visual cryptography scheme -- (k‐n)‐probabilistic visual cryptography scheme -- (k, n)‐DVCS -- (k, n)‐PVCS -- CPVCS; Computer security -- Periodicals; Cryptography -- Periodicals; Computer networks -- Security measures -- Periodicals; Database security -- Periodicals; 005.8
• DOI: 10.1049/iet-ifs.2016.0126
• Languages: English
• ISSNs: 1751-8709

Abstract

Abstract : In the past decade, the researchers paid more attention to the cheating problem in visual cryptography (VC) so that many cheating prevention visual cryptography schemes (CPVCS) have been proposed. In this paper, the authors propose a novel method, which first makes use of Latin square to prevent cheating in VC. Latin squares are utilised to guide the choosing of authentication regions in different rows and columns of each divided block of the shares, which ensures that the choosing of authentication regions is both random and uniform. Without pixel expansion, the new method provides random regions authentication in each divided block of all shares. What is important is that the proposed method is applicable to both ( k, n )‐deterministic visual cryptography scheme (( k, n )‐DVCS) and ( k, n )‐probabilistic visual cryptography scheme (( k, n )‐PVCS). Experimental results and properties analysis are given to show the effectiveness of the proposed method.