Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2508.15917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866918128873635840 |
|---|---|
| author | Zhuo, Xiaoli Yan, Xuehu Liu, Lintao Yan, Wei |
| author_facet | Zhuo, Xiaoli Yan, Xuehu Liu, Lintao Yan, Wei |
| contents | In evolving access structures, the number of participants is countably infinite with no predetermined upper bound. While such structures have been realized in secret sharing, research in secret image sharing has primarily focused on visual cryptography schemes (VCS). However, there exists no construction for $(k,\infty)$ VCS that applies to arbitrary $k$ values without pixel expansion currently, and the contrast requires enhancement. In this paper, we first present a formal mathematical definition of $(k,\infty)$ VCS. Then, propose a $(k,\infty)$ VCS based on random grids that works for arbitrary $k$. In addition, to further improve contrast, we develop optimized $(k,\infty)$ VCS for $k=2$ and $3$, along with contrast enhancement strategies for $k\geq 4$. Theoretical analysis and experimental results demonstrate the superiority of our proposed schemes. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2508_15917 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Evolving k-Threshold Visual Cryptography Schemes Zhuo, Xiaoli Yan, Xuehu Liu, Lintao Yan, Wei Cryptography and Security In evolving access structures, the number of participants is countably infinite with no predetermined upper bound. While such structures have been realized in secret sharing, research in secret image sharing has primarily focused on visual cryptography schemes (VCS). However, there exists no construction for $(k,\infty)$ VCS that applies to arbitrary $k$ values without pixel expansion currently, and the contrast requires enhancement. In this paper, we first present a formal mathematical definition of $(k,\infty)$ VCS. Then, propose a $(k,\infty)$ VCS based on random grids that works for arbitrary $k$. In addition, to further improve contrast, we develop optimized $(k,\infty)$ VCS for $k=2$ and $3$, along with contrast enhancement strategies for $k\geq 4$. Theoretical analysis and experimental results demonstrate the superiority of our proposed schemes. |
| title | Evolving k-Threshold Visual Cryptography Schemes |
| topic | Cryptography and Security |
| url | https://arxiv.org/abs/2508.15917 |