On (k, n)*-visual cryptography scheme

Author： Arumugam S. Lakshmanan R. Nagar Atulya

ISSN： 0925-1022

Source： Designs, Codes and Cryptography, Vol.71, Iss.1, 2014-04, pp. : 153-162

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

By Koga Hiroki Ueda Etsuyo

Designs, Codes and Cryptography, Vol. 40, Iss. 1, 2006-07 ,pp. : 81-102

Springer Publishing Company

Access to resources Recommend Favorite

Remarks on the k-error linear complexity of p ⁿ-periodic sequences

By Meidl Wilfried Venkateswarlu Ayineedi

Designs, Codes and Cryptography, Vol. 42, Iss. 2, 2007-02 ,pp. : 181-193

Springer Publishing Company

Access to resources Recommend Favorite

Maximal Subsemigroups of Finite Transformation Semigroups K(n, r)

By Yang Hao Yang Xiu

Acta Mathematica Sinica, Vol. 20, Iss. 3, 2004-06 ,pp. : 475-482

Springer Publishing Company

Access to resources Recommend Favorite

Zeros in tables of characters for the groups S_n and A_n

By Belonogov V.

Algebra and Logic, Vol. 44, Iss. 1, 2005-01 ,pp. : 13-24

Springer Publishing Company

Access to resources Recommend Favorite

Irreducible characters with equal roots in the groups S _n and A _n

By Belonogov V.

Algebra and Logic, Vol. 46, Iss. 1, 2007-01 ,pp. : 1-15

Springer Publishing Company

Access to resources Recommend Favorite