Research on a novel construction of probabilistic visual cryptography scheme (k, n, 0, 1, 1)-PVCS for threshold access structures

DOI10.1016/J.TCS.2021.02.010MaRDI QIDQ2658042zbMATH OpenOpenAlexFDO

Authors GwangSu Ju, UnGwang Ko

Publication date 18 March 2021

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2021.02.010

zbMATH Keywords

deterministic visual cryptographypixel expansionprobabilistic visual cryptographyrandom gridsvisual cryptography

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Cryptography (94A60)

Recommendations

• Progress in Cryptology - INDOCRYPT 2004
• Improved schemes for visual cryptography
• Visual cryptography for general access structures
• scientific article; zbMATH DE number 2102766
• Construction of a \((k,n)\)-visual cryptography scheme

Cites work

• A discussion on the relationship between probabilistic visual cryptography and random grid
• scientific article; zbMATH DE number 1088898 (Why is no real title available?)
• Image encryption by multiple random grids
• Image encryption by random grids
• New Results on Visual Cryptography
• On the contrast in visual cryptography schemes
• Probabilistic visual secret sharing schemes for grey-scale images and color images
• Visual cryptograms of random grids for threshold access structures
• Visual multiple-secret sharing by circle random grids
• Visual secret sharing by random grids revisited

Cited in

(2)

• A discussion on the relationship between probabilistic visual cryptography and random grid
• Towards cheat-preventing in block-based progressive visual cryptography for general access structures

This page was built for publication: Research on a novel construction of probabilistic visual cryptography scheme \((k, n, 0, 1, 1)\)-PVCS for threshold access structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2658042)