Visual Cryptography for General Access Structures |
| |
Authors: | Giuseppe Ateniese Carlo Blundo Alfredo De Santis Douglas R. Stinson |
| |
Affiliation: | aDipartimento di Informatica e Scienze dell'Informazione, Università di Genova, via Dodecaneso 35, 16146, Genova, Italyf1;bDipartimento di Informatica ed Applicazioni, Università di Salerno, 84081, Baronissi, (SA), Italyf2;cDepartment of Computer Science and Engineering, Center for Communication and Information Science, University of Nebraska-Lincoln, Lincoln, Nebraska, 68588, f3 |
| |
Abstract: | A visual cryptography scheme for a set ofnparticipants is a method of encoding a secret imageSIintonshadow images called shares, where each participant in receives one share. Certain qualified subsets of participants can “visually” recover the secret image, but other, forbidden, sets of participants have no information (in an information-theoretic sense) onSI. A “visual” recovery for a setX⊆ consists of xeroxing the shares given to the participants inXonto transparencies, and then stacking them. The participants in a qualified setXwill be able to see the secret image without any knowledge of cryptography and without performing any cryptographic computation. In this paper we propose two techniques for constructing visual cryptography schemes for general access structures. We analyze the structure of visual cryptography schemes and we prove bounds on the size of the shares distributed to the participants in the scheme. We provide a novel technique for realizingkout ofnthreshold visual cryptography schemes. Our construction forkout ofnvisual cryptography schemes is better with respect to pixel expansion than the one proposed by M. Naor and A. Shamir (Visual cryptography,in“Advances in Cryptology—Eurocrypt '94” CA. De Santis, Ed.), Lecture Notes in Computer Science, Vol. 950, pp. 1–12, Springer-Verlag, Berlin, 1995) and for the case of 2 out ofnis the best possible. Finally, we consider graph-based access structures, i.e., access structures in which any qualified set of participants contains at least an edge of a given graph whose vertices represent the participants of the scheme. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|