On $$(k, n)$$ Visual Cryptography Scheme with $$t$$ Essential Parties

DOI10.1007/978-3-319-04268-8_4zbMath1395.94285OpenAlexW2226600187MaRDI QIDQ2948252

Teng Guo, Chuan-Kun Wu, Yawei Ren, Feng Liu, Wen Wang

Publication date: 30 September 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-04268-8_4

zbMATH Keywords

visual cryptographypixel expansionrelative contrastessential parties

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (4)

Constructions and analysis of some efficient \(t\)-\((k,n)^\ast\)-visual cryptographic schemes using linear algebraic techniques ⋮ Visual cryptographic schemes using combined Boolean operations ⋮ Perfect contrast XOR-based visual cryptography schemes via linear algebra ⋮ Maximal contrast color visual secret sharing schemes

This page was built for publication: On $$(k, n)$$ Visual Cryptography Scheme with $$t$$ Essential Parties