Sharing multiple secrets in visual cryptography

doi:10.1016/j.patcog.2007.03.012

Return

Sharing multiple secrets in visual cryptography

2007-12-01

158

PRE

DOI：10.1016/j.patcog.2007.03.012

Original

Original request for help

Save

Abstract

En 中文

The secret sharing schemes in conventional visual cryptography are characterized by encoding one shared secret into a set of random transparencies which reveal the secret to the human visual system when they are superimposed. In this paper, we propose a visual secret sharing scheme that encodes a set of x >= 2 secrets into two circle shares such that none of any single share leaks the secrets and the x secrets can be obtained one by one by stacking the first share and the rotated second shares with x different rotation angles. This is the first true result that discusses the sharing ability in visual cryptography up to any general number of multiple secrets in two circle shares. (c) 2007 Pattern Recognition Society. Published by Elsevier Ltd. All rights reserved.

Keywords:

secret sharing

visual cryptography

visual multi-secret sharing

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.