Cryptography Reference
In-Depth Information
programming, approximation theory, the theory of error correcting codes, de-
sign theory, and elementary combinatorics.
Bibliography
[1] T. Beth, D. Jungnickel, and H. Lenz. Design Theory. Cambridge Uni-
versity Press, 1985.
[2] C. Blundo, P. D'Arco, A. De Santis, and D. R. Stinson. Contrast op-
timal threshold visual cryptography schemes. SIAM J. Discrete Math.,
16(2):224{261 (electronic), 2003.
[3] C. Blundo, A. De Santis, and D. R. Stinson. On the contrast in visual
cryptography schemes. J. Cryptology, 12(4):261{289, 1999.
[4] B. Borchert. Segment-based visual cryptography. Technical report, 17
Wilhelm-Schickard-Institut fur Informatik, Univeristat Tubingen, 2007.
[5] M. Bose and R. Mukerjee. Optimal (n;k) visual cryptography schemes
for general k. Des. Codes Cryptogr., 55:19{35, 2010.
[6] S. Cimato, R. De Prisco, and A. De Santis. Optimal colored threshold
visual cryptography schemes. Des. Codes Cryptogr., 35(3):311{335, 2005.
[7] S. Cimato, R. De Prisco, and A. De Santis. Colored visual cryptography
without color darkening. Theoret. Comput. Sci., 374(1-3):261{276, 2007.
[8] R. Craigen. Hadamard matrices and designs. In C. J. Colbourn and J. H.
Dinitz, editors, The CRC Handbook of Combinatorial Designs, pages 370{
380. CRC Press, Boco Raton, New York, London, Tokyo, 1996.
[9] S. Droste. New results in visual cryptography. In Advances in cryptology
{ CRYPTO '96, volume 1109 of Lect. Notes Comput. Sci., pages 401{415.
Springer, Berlin, 1996.
[10] P. A. Eisen and D. R. Stinson. Threshold visual cryptography schemes
with specified whiteness levels of reconstructed pixels. Des. Codes Cryp-
togr., 25(1):15{61, 2002.
[11] A. Klein. Visuelle Kryptographie. Springer-Verlag, Berlin, 2007.
[12] A. Klein and K. Metsch.
On approximate inclusion-exclusion.
Innov.
Incidence Geom., 6/7:249{270, 2007/08.
[13] A. Klein and M. Wessler. Extended visual cryptography schemes. Infor-
mation and Computation, 205(5):716{732, 2007.
Search WWH ::
Custom Search