Results 251 to 260 of about 4,666,531 (283)

Visual multi-secret sharing with friendliness

Journal of Shanghai Jiaotong University (Science), 2014
Visual secret sharing (VSS) was used in the literature to encode and decode secret images until visual multi-secret sharing (VMSS) was proposed. Distinctly, multiple secret images can be encoded or decoded at a time in VMSS; however, only one secret image can be done in VSS.
Fuh-gwo Jeng, Kai-siang Lin, Chih-hung Lin, Tzung-her Chen   +3 more
openaire   +1 more source

Multi secret Sharing Based on Hill Cipher and Blakley Secret Sharing

2017 27th International Conference on Computer Theory and Applications (ICCTA), 2017
This paper presents multi secret sharing scheme using Hill cipher and Blakley secret sharing. The proposed scheme can reconstruct k- secret images with only or more of shadow images. The proposed scheme is compared with other related visual secret sharing schemes for gray scale images with a $(n, n)-$ threshold.
A. A. Mervat, Osama S. Younes, Hatem S. Abdul-Kader   +2 more
openaire   +1 more source

Verifiable Rational Multi-secret Sharing Scheme

2011
In this paper we mainly focus on the cheating problem and the incapability problem existed in rational secret sharing schemes. Based on current schemes and the related knowledge of bit commitment agreement, we proposed a verifiable rational multi-secret sharing scheme in which players can verify the identity of the dealer.
Yongquan Cai, Zhanhai Luo, Yi Yang
openaire   +2 more sources

A Modified Multi-Secret Sharing Visual Cryptography Scheme

2008 International Conference on Computational Intelligence and Security, 2008
A modified threshold visual cryptography scheme (k, l, n)-VCS is proposed, which is used to analyze the relationship between the pixel expansion and the range of the participants? number. Based on (k, l, n)-VCS, a more precise definition of multi-secret sharing visual cryptography scheme is given, and a new method is presented.
Bin Yu 0003, Zhengxin Fu, Liguo Fang
openaire   +1 more source

High-Capacity Multi-secret Sharing by Random Grid

2010 International Conference on Broadband, Wireless Computing, Communication and Applications, 2010
It’s well-known that visual secret sharing aims at encrypting a secret image into numerous meaningless sharing images by either designing a well-designed codebook or generating random bit sequence, and reconstructing the secret by superimposing them without any computation involved.
Tzung-Her Chen, Yao-Sheng Lee, Ci-Lin Li
openaire   +2 more sources

Visual multi secret sharing by cylindrical random grid

Journal of Information Security and Applications, 2014
Visual secret sharing (VSS) is the process of encoding a secret image into several share images in which the original secret image can be reconstructed and recognized by stacking all of the share images together. VSS has two categories: visual cryptography (VC) and Random Grid (RG). The VC is affected by various drawbacks such as: enlarging the size of
Saman Salehi, M. A. Balafar
openaire   +2 more sources

A multi-secret sharing scheme for 3D solid objects

Expert Systems with Applications, 2015
A novel secret sharing scheme for multiple 3D solid objects is proposed.The algorithm is based on the use of a reversible memory 3D cellular automaton.The scheme exhibit good statistical properties; it is perfect and ideal. In this work a novel protocol to share multiple 3D solid objects in a secure way is presented.
openaire   +2 more sources

A practical dynamic multi-secret sharing scheme

2010 IEEE International Conference on Information Theory and Information Security, 2010
In this paper, we propose a practical dynamic multi-secret sharing scheme based on the intractability of the discrete logarithm and one way hash functions, the exclusive OR operation. Security analysis shows that our scheme could correctly reconstruct the shared secret, and our scheme is as secure as Lin-Yeh's scheme.
null Juan Qu, null Limin Zou, Jianzhong Zhang   +2 more
openaire   +1 more source

A hierarchical threshold multi-secret sharing scheme

2008 2nd International Conference on Anti-counterfeiting, Security and Identification, 2008
This paper first proposes a hierarchical threshold multi-secret sharing scheme based on solving the linearly independent equations. This scheme has the same power as T.Tassapsilas scheme, in which the participants of any authorized subset in the hierarchical threshold access structure can reconstruct the shared secret and the non-authorized subset ...
null Shi Runhua, null Zhong Hong
openaire   +1 more source

Novel and Effective Multi-Secret Sharing Scheme

2013
A new multi-secret sharing (t, n) threshold scheme is proposed in this paper. The scheme uses the Lagrange interpolating polynomial to split and reconstruct the secrets based on Shamir secret sharing scheme, and verifies the legality of data by NTRU algorithm and one-way hashing function.
Shanyue Bu, Ronggeng Yang
openaire   +1 more source