Results 211 to 220 of about 4,411 (251)

Multi-secret sharing threshold access structure

2015 International Conference on Advances in Computing, Communications and Informatics (ICACCI), 2015
This paper proposes threshold access structure for multi-secret sharing. It uses a two-level encoding for share generation from multiple secret images. In the first level of encoding secure Boolean based operations are used. The second level of encoding uses Chinese remainder theorem and Lagrange Interpolation. It is mainly useful for secure encryption
L. Siva Reddy, Munaga V. N. K. Prasad
openaire   +1 more source

Sharing Multi-Secret Based on Circle Properties

2008 International Conference on Computational Intelligence and Security, 2008
A (t, n) threshold multi-secret sharing scheme based on the properties of a circle in multi-dimensional space is proposed in this paper. Only t or more shadows can reconstruct the secrets; while any less than t shadows cannot obtain any information of the secrets.
Lina Ge, Shaohua Tang
openaire   +1 more source

Multi secret sharing with unexpanded meaningful shares

Multimedia Tools and Applications, 2017
Traditional Visual Cryptography (VC) facilitates a technique to protect only one secret image using single set of shares. Recent researches enhance the capabilities of traditional VC by providing the feature of Multi Secret Sharing (MSS), where more than one secret image can be protected at a time.
openaire   +1 more source

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

A new (t,n) multi-secret sharing scheme based on Shamir’s secret sharing

Applied Mathematics and Computation, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yu-Min Wang
exaly   +3 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

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

A novel approach for multilevel multi-secret image sharing scheme

The Journal of Supercomputing, 2021
Multi-secret sharing (MSS) is an effective technique that securely encodes multiple secrets to generate shares and distributes them among the participants in such a way that these shares can be used later to reconstruct the secrets. MSS schemes have a considerable advantage over the single-secret sharing schemes for secure multimedia data transmission.
Kanchan Bisht, Maroti Deshmukh
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   +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   +1 more source