Almost ideal contrast visual cryptography with reversing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2964, Issue , 2004, Pages 353-365

  Viet, Duong Quang ^a   Kurosawa, Kaoru ^b  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

^b IBARAKI UNIVERSITY   (Japan)

Author keywords

Ideal contrast; Perfect black; Visual cryptography

Indexed keywords

COMPUTERIZED TOMOGRAPHY;

COPY MACHINE; CRYPTOGRAPHIC OPERATIONS; IDEAL CONTRAST; PERFECT BLACK; RECONSTRUCTED IMAGE; VISUAL CRYPTOGRAPHY; VISUAL CRYPTOGRAPHY SCHEMES;

CRYPTOGRAPHY;

EID: 84958770384     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24660-2_27     Document Type: Conference Paper

References (11)

1. G. Ateniese, C. Blundo, A. D. Santis and D. R. Stinson, “Visual cryptography for general access structures”, in: Information and Computation, vol. 129, pp. 86–106 (1996).
2. J. C. Benaloh and J. Leichter, “Generalized secret sharing and monotone functions”, in: Proc. of Crypto’88, Lecture Notes on Computer Science, LNCS vol. 403, pp. 27–36 (1990).
3. C. Blundo and A. De. Santis, “Visual cryptography schemes with perfect reconstruction of black pixels”, in: Computer and Graphics, vol. 22, no. 4, pp. 449–455 (1998).
4. C. Blundo, A. De. Santis and D. R. Stinson, “On the contrast in visual cryptography schemes”, in: Journal of Cryptology, vol. 12, no. 4, pp. 261–289 (1999).
5. C. Blundo, P. D’Arco, A. De. Santis and D. R. Stinson, “Contrast optimal threshold visual cryptography schemes”, to appear in: SIAM Journal on Discrete Mathematics (Available from http://cacr.math.uwaterloo.ca/˜dstinson/papers/COTVCS.ps).
6. C. Blundo, A. De. Bonis and A. De. Santis, “Improved schemes for visual cryptography”, in: Designs, Codes, and Cryptography, vol. 24, pp. 255–278 (2001).
7. P. A. Eisen and D. R. Stinson, “Threshold Visual Cryptography Schemes With Specified Whiteness Levels of Reconstructed Pixels”, in: Designs, Codes, and Cryptography, vol. 25, no. 1, pp. 15–61 (2002).
8. M. Itoh, A. Saito and T. Nishizeki, “Multiple assignment scheme for sharing secret”, in: Journal of Cryptology, vol. 6, no. 1, pp. 15–20 (1993)
9. M. Naor and A. Shamir, “Visual cryptography”, in: Proc. of Eurocrypt’94, Lecture Notes on Computer Science, LNCS vol. 950, pp. 1–12 (1995).
10. M. Naor and A. Shamir, “Visual cryptography II: Improving the Contrast Via the Cover Base”, in: Proc. of Security Protocols’96, Lecture Notes on Computer Science, LNCS vol. 1189, pp. 197–202 (1997). Full version available from http://www.wisdom.weizmann.ac.il/˜naor/PAPERS/newcov.ps.
11. E. R. Verheul and H. C. A. van Tilborg, “Constructions and properties of k out of n visual secret sharing schemes”, in: Designs, Codes, and Cryptography, vol. 11, no. 2, pp. 179–196 (1997).